Expressiveness of updatable timed automata

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

Volumn 1893, Issue , 2000, Pages 232-242

  Bouyer, P ^a   Dufourd, C ^a   Fleury, E ^a   Petit, A ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; INTERACTIVE COMPUTER SYSTEMS;

BISIMILARITY; ORIGINAL MODEL; TIMED AUTOMATA;

REAL TIME SYSTEMS;

EID: 84959195025     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44612-5_19     Document Type: Conference Paper

References (17)

1. R. Alur, C. Courcoubetis, and T.A. Henzinger. The observational power of clocks. In Proc. of CONCUR'94, LNCS 836, pages 162-177, 1994.
2. R. Alur and D. Dill. Automata for modeling real-time systems. In Proc. of ICALP'90, LNCS 443, pages 322-335, 1990.
3. R. Alur and D. Dill. A theory of timed automata. TCS'94, pages 183-235, 1994.
4. R. Alur, T.A. Henzinger, and M. Vardi. Parametric real-time reasoning. In Proc. of the 25th ACM STOC, pages 592-601, 1993.
5. P. Bouyer, C. Dufourd, E. Fleury, and A. Petit. Are timed automata updatable ? In Proc. of CAV'2000, LNCS, 2000. To appear.
6. P. Bouyer, C. Dufourd, E. Fleury, and A. Petit. Expressiveness of updatable timed automata. Research report, ENS de Cachan, 2000.
7. B. Berard, V. Diekert, P. Gastin, and A. Petit. Characterization of the expressive power of silent transitions in timed automata. Fundamental Informaticae, pages 145-182, 1998.
8. B. Berard and C. Dufourd. Timed automata and additive clock constraints. Research report LSV-00-4, LSV, ENS de Cachan, 2000.
9. B. Berard and L. Fribourg. Automatic verification of a parametric real-time program: the ABR conformance protocol. In Proc. of CAV'99, LNCS 1633, pages 96-107, 1999.
10. C. Choffrut and M. Goldwurm. Timed automata with periodic clock constraints. Technical Report 99/28, LIAFA, Universite Paris VII, 1999.
11. F. Demichelis and W. Zielonka. Controlled timed automata. In Proc. of CON-CUR'98, LNCS 1466, pages 455-469, 1998.
12. T.A. Henzinger, P. Ho, and H. Wong-Toi. Hytech: A model checker for hybrid systems. In Software Tools for Technology Transfer, pages 110-122, 1997. (special issue on Timed and Hybrid Systems).
13. K.G. Larsen, P. Pettersson, and W. Yi UPPAAL in a Nutshell. Int. Journal on Software Tools for Technology Transfer, 1:134-152, 1997.
14. R. Milner. Communication and Concurrency. Prentice Hall Int., 1989.
15. D. M. Park. Concurrency on automata and infinite sequences. In CTCS'81, LNCS 104, pages 167-183, 1981.
16. T. Wilke. Specifying timed state sequences in powerful decidable logics and timed automata. In Proc. of FTRT-FTS, LNCS 863, pages 694-715, 1994.
17. S. Yovine. A verification tool for real-time systems. Springer International Journal of Software Tools for Technology Transfer, 1, 1997.