Author： Dang Z. Ibarra O.H. Kemmerer R.A.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.296, Iss.1, 2003-03, pp. : 59-74
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Access to resources
Recommend
Presburger liveness verification of discrete timed automata
By Dang Z. Pietro P.S. Kemmerer R.A.
Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. :
Past pushdown timed automata and safety verification
By Dang Z. Bultan T. H. Ibarra O. A. Kemmerer R.
Theoretical Computer Science, Vol. 313, Iss. 1, 2004-02 ,pp. :
Verification in loosely synchronous queue-connected discrete timed automata
By Ibarra O.H. Dang Z. Pietro P.S.
Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. :
Pushdown timed automata: a binary reachability characterization and safety verification
By Dang Z.
Theoretical Computer Science, Vol. 302, Iss. 1, 2003-06 ,pp. :