Author: Beauquier D. Slissenko
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.275, Iss.1, 2002-03, pp. : 347-388
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
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. :
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. :
Completeness of a first-order temporal logic with time-gaps
Theoretical Computer Science, Vol. 160, Iss. 1, 1996-06 ,pp. :