Are timed automata updatable?

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

Volumn 1855, Issue , 2000, Pages 464-479

  Bouyer, Patricia ^a   Dufourd, Catherine ^a   Fleury, Emmanuel ^a   Petit, Antoine ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CLOCKS; COMPUTER AIDED ANALYSIS;

CLOCK CONSTRAINTS; CONSTANT VALUES; DECISION PROCEDURE; PSPACE-COMPLETE; TIMED AUTOMATA; UNDECIDABILITY;

EQUIVALENCE CLASSES;

EID: 84944406327     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/10722167_35     Document Type: Article

References (21)

1. R. Alur, C. Courcoubetis, D.L. Dill, N. Halbwachs, and H. Wong-Toi. Minimization of timed transition systems. In Proc. of CONCUR’92, LNCS 630, 1992.
2. ACH94. R. Alur, C. Courcoubetis, and T.A. Henzinger. The observational power of clocks. In Proc. of CONCUR’94, LNCS 836, pages 162-177, 1994.
3. AD90. R. Alur and D.L. Dill. Automata for modeling real-time systems. In Proc. of ICALP’90, LNCS 443, pages 322-335, 1990.
4. AD94. R. Alur and D.L. Dill. A theory of timed automata. Theorical Computer Science, 126:183-235, 1994.
5. AFH94. R. Alur, L Fix, and T.A. Henzinger. A determinizable class of timed automata. In Proc. of CAV’94, LNCS 818, pages 1-13, 1994.
6. AHV93. R. Alur, T.A. Henzinger, and M. Vardi. Parametric real-time reasoning. In Proc. of ACM Symposium on Theory of Computing, pages 592-601, 1993.
7. BD00. B. Berard and C. Dufourd. Timed automata and additive clock constraints. To appear in IPL, 2000.
8. P. Bouyer, C. Dufourd, E. Fleury, and A. Petit. Are timed automata updatable ? Research Report LSV-00-3, LSV, ENS de Cachan, 2000.
9. P. Bouyer, C. Dufourd, E. Fleury, and A. Petit. Expressiveness of updatable timed automata. Research report, LSV, ENS de Cachan, 2000. Submitted to MFCS’2000.
10. BDGP98. B. Berard, V. Diekert, P. Gastin, and A. Petit. Characterization of the expressive power of silent transitions in timed automata. Fundamenta Informaticae, pages 145-182, 1998.
11. BF99. B. Berard and L. Fribourg. Automatic verification of a parametric realtime program: the ABR conformance protocol. In Proc. of CAV’99, LNCS 1633, 1999.
12. BFKM99. B. Berard, L. Fribourg, F. Klay, and J.F. Monin. A compared study of two correctness proofs for the standardized algorithm of ABR conformance. Research Report LSV-99-7, LSV, ENS de Cachan, 1999.
13. E. Domenjoud. Solving systems of linear diophantine equations: an algebraic approach. In Proc. of MFCS’91, LNCS 520, pages 141-150, 1991.
14. HHWT95. T.A. Henzinger, P. Ho, and H. Wong-Toi. A user guide to HyTech. In Proc. of TACAS’95, LNCS 1019, pages 41-71, 1995.
15. HHWT97. 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.
16. HKWT95. T.A. Henzinger, P.W. Kopke, and H. Wong-Ti. The expressive power of clocks. In Proc. of ICALP’95, LNCS 944, pages 335-346, 1995.
17. HU79. J.E. Hopcroft and J.D. Ullman. Introduction to automata theory, languages and computation. Addison Wesley, 1979.
18. LPY97. Kim G. Larsen, Paul Pettersson, and Wang Yi. Uppaal in a Nutshell. Int. Journal on Software Tools for Technology Transfer, 1:134-152, 1997.
19. M. Minsky. Computation: finite and infinite machines. Prentice Hall Int., 1967.
20. T. Wilke. Specifying timed state sequences in powerful decidable logics and timed automata. In Proc. of Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS 863, 1994.
21. S. Yovine. A verification tool for real-time systems. Springer International Journal of Software Tools for Technology Transfer, 1, October 1997.