Controlled timed automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1466, Issue , 1998, Pages 455-469

  Demichelis, François ^a   Zielonka, Wiesław ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CLOCKS; ROBOTS;

BOOLEAN OPERATIONS; EMPTINESS PROBLEM; PARAMETERIZED; PERIODIC TESTS; REAL-TIME AUTOMATON; REAL-TIME LANGUAGES; TIMED AUTOMATA;

AUTOMATA THEORY;

EID: 84945915318     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055641     Document Type: Conference Paper

References (12)

1. Rajeev Alur, Costas Courcoubetis, and David Dill. Model-checking in real-time systems. Information and Computation, 104:2-34, 1993.
2. Rajeev Alur and David L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183-235, 1994.
3. Rajeev Alur, Limor Fix, and Thomas A. Henzinger. A determinizable class of timed automata. In Proceedings of CAV’94, volume 818 of Lecture Notes in Comp. Sci., pages 1-13. Springer Verlag, 1994.
4. Rajeev Alur and Thomas A. Henzinger. Back to the future: Towards a theory of timed regular languages. In Proceed, of 33th IEEE Symp. of Fundamentals of Computer Science, pages 177-186, 1992.
5. Christian Choffrut and Massimiliano Goldwurm. Timed automata with periodic clock constraints. Technical report, University of Milano, 1998.
6. V. Diekert, R Gastin, and A. Petit. Removing ε-transitions in timed automata. In Proceedings of STACS’97, volume 1200 of Lecture Notes in Comp. Sci., pages 583-594. Springer Verlag, 1997.
7. V. Gupta, T.A. Henzinger, and Ft. Jagadeesan. Robust timed automata. In Proceedings of HART’97, volume 1201 of Lecture Notes in Comp. Sci., pages 331-345. Springer Verlag, 1997.
8. T.A. Henzinger. The theory of hybrid automata. In Proceedings of LICS’96, pages 278-292, 1996.
9. Philippe Hermann. Automates temporisés et reconnaissabilité. Memoire de DEA, LIAFA, Universite Paris VII, 1997. extended version of [10].
10. Philippe Hermann. Timed automata and recognizability. Information Processing Letters, 1998. to appear.
11. W. Thomas. Automata on infinite objects. In J. van Leeuven, editor, Handbook of Theoretical Computer Science, volume B, pages 133-191. Elsevier Science, 1990.
12. Th. Wilke. Specifying timed step sequences in powerful decidable logics and timed automata. In Formal Techniques in Real-Time and Fault-Tolerant Systems, volume 863 of Lecture Notes in Comp. Sci. Springer Verlag, 1994.