Timed automata and additive clock constraints

Information Processing Letters

Volumn 75, Issue 1, 2000, Pages 1-7

  Bérard, Béatrice ^a   Dufourd, Catherine ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; CONSTRAINT THEORY; THEOREM PROVING; TIMING CIRCUITS;

ADDITIVE CLOCK CONSTRAINTS; LINEAR HYBRID AUTOMATA; TIME AUTOMATA;

AUTOMATA THEORY;

EID: 0343442409     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00075-2     Document Type: Article

References (10)

1. Alur R., Dill D.L. Automata for modeling real-time systems. Proc. ICALP'90. Lecture Notes in Comput. Sci. Vol. 443:1990;322-335 Springer, Berlin.
2. Alur R., Dill D.L. A theory of timed automata. Theoret. Comput. Sci. Vol. 126:1994;183-235.
3. Alur R., Fix L., Henzinger T.A. A determinizable class of timed automata. Proc. CAV'94. Lecture Notes in Comput. Sci. Vol. 818:1994;1-13 Springer, Berlin.
4. Bérard B. Untiming timed languages. Inform. Process. Lett. Vol. 55:1995;129-135.
5. Bérard B., Diekert V., Gastin P., Petit A. Characterization of the expressive power of silent transitions in timed automata. Fund. Inform. Vol. 36:1998;145-182.
6. P. Bouyer, C. Dufourd, E. Fleury, A. Petit, Are timed automata updatable?, in: Proc. CAV'00, to appear.
7. Demichelis F., Zielonka W. Controlled timed automata. Proc. CONCUR'98. Lecture Notes in Comput. Sci. Vol. 1466:1998;455-469 Springer, Berlin.
8. Henzinger T.A. The theory of hybrid automata. Proc. LICS'96. 1996;278-292.
9. Henzinger T.A., Kopke P., Puri A., Varaiya P. What's decidable about hybrid automata. Proc. STOC'95. 1995;373-382.
10. Minski M. Computation: Finite and Infinite Machines. 1967;Prentice-Hall, Englewood Cliffs, NJ.