Author： Alur R. Fix L. Henzinger T.A.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.211, Iss.1, 1999-01, pp. : 253-273
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
-transitions in Concurrent Timed Automata
By Lanotte R. Maggiolo-Schettini A. Tini S.
Information Processing Letters, Vol. 89, Iss. 1, 2004-01 ,pp. :
Access to resources
Recommend
Finite automata on timed -trees
Theoretical Computer Science, Vol. 293, Iss. 3, 2003-02 ,pp. :
By Lanotte R. Maggiolo-Schettini A. Tini S.
Theoretical Computer Science, Vol. 309, Iss. 1, 2003-12 ,pp. :
Timed automata with urgent transitions
Acta Informatica, Vol. 40, Iss. 5, 2004-03 ,pp. :
On probabilistic timed automata
By Beauquier D.
Theoretical Computer Science, Vol. 292, Iss. 1, 2003-01 ,pp. :