Characterization of the Expressive Power of Silent Transitions in Timed Automata

Fundamenta Informaticae

Volumn 36, Issue 2, 1998, Pages 145-182

  Bérard, Béatrice ^a   Petit, Antoine ^a   Diekert, Volker ^b   Gastin, Paul ^c  

^a CNRS   (France)

^b UNIVERSITY OF STUTTGART   (Germany)

^c UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000767643     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1998-36233     Document Type: Article

References (28)

1. R. Alur, C. Courcoubetis, D.L. Dill, N. Halbwachs, and H. Wong-Toi. Minimization of timed transition systems. In Proceedings of CONCUR'92, number 630 in Lecture Notes in Computer Science. Springer Verlag, 1992.
2. R. Alur, C. Courcoubetis, and T.A. Henzinger. The observational power of clocks. In Proceedings of CONCUR'94, number 836 in Lecture Notes in Computer Science, pages 162-177. Springer Verlag, 1994.
3. R. Alur and D.L. Dill. Automata for modeling real-time systems. In Proceedings of ICALP'90, number 443 in Lecture Notes in Computer Science, pages 322-335. Springer Verlag, 1990.
4. R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
5. R. Alur, L. Fix, and T.A. Henzinger. A determinizable class of timed automata. In Proceedings of CAV'94, number 818 in Lecture Notes in Computer Science, pages 1-13. Springer Verlag, 1994.
6. R. Alur and T.A. Henzinger. Back to the future: towards a theory of timed regular languages. In Proceedings of FOCS'92, Lecture Notes in Computer Science, pages 177-186. Springer Verlag, 1992.
7. D. Beauquier. Pumping lemmas for timed automata. In Proceedings of FoSSaCS'98, number 1378 in Lecture Notes in Computer Science, pages 81-94. Springer Verlag, 1998.
8. B. Bérard. Untiming timed languages. Information Processing Letters, 55:129-135, 1995.
9. B. Bérard, P. Gastin, and A. Petit. On the power of non observable actions in timed automata. In C. Puech and R. Reischuk, editors, Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science (STACS'96), number 1046 in Lecture Notes in Computer Science, pages 257-268. Springer Verlag, 1996.
10. Ch. Choffrut and M. Goldwurm. Timed automata with periodic clock constraints. Tech. Rep. 225-98, Università degli Study di Milano (Italy), Dipartimento di Scienze dell'Informazione, 1998.
11. E. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal-logic specifications. ACM Trans. Programming Languages and Systems, 8:244-263, 1986.
12. C. Courcoubetis and M. Yannakakis. Minimum and maximum delay problems in real-time systems. In Proceedings of CAV'91, number 575 in Lecture Notes in Computer Science, pages 399-409. Springer Verlag, 1991.
13. V. Diekert, P. Gastin, and A. Petit. Removing ε-transitions in timed automata. In Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science. (STACS'97), number 1200 in Lecture Notes in Computer Science, pages 583-594. Springer Verlag, 1997.
14. T.A. Henzinger. The theory of hybrid automata. In Proceedings of LICS'96, pages 278 -292, New Brunswick, New Jersey, 1996. Invited tutorial.
15. T.A. Henzinger, P.W. Kopke, and H. Wong-Toi. The expressive power of clocks. In Proceedings of ICALP '95, number 944 in Lecture Notes in Computer Science, pages 335-346. Springer Verlag, 1995.
16. T.A. Henzinger, Z. Manna, and A. Pnueli. Temporal proofs methodologies for real-time systems. In Proceedings of POPL'91, pages 353-366, 1991.
17. T.A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. Information and Computation, 111(2):193-244, 1994.
18. Ph. Herrmann. Timed automata and recognizability. Information Processing Letters, 65:313-318, 1988.
19. N. Lynch and H. Attiya. Using mappings to prove timing properties. In Proceedings of PODC'90, pages 265-280, 1990.
20. X. Nicollin, J. Sifakis, and S. Yovine. From ATP to timed graphs and hybrid systems. In Proceedings of REX workshop "Real-time: theory in practice", number 600 in Lecture Notes in Computer Science, pages 549-572. Springer Verlag, 1991.
21. J. Ostroff. Temporal Logic of Real-time Systems. Research Studies Press, 1990.
22. C. Ramchandani. Analysis of asynchronous concurrent systems by Petri nets. Technical report, Massachusetts Institute of Technology, 1974.
23. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 133-191. Elsevier Science Publishers (North-Holland), 1990.
24. M. Vardi. Verification of concurrent-programs - the automata-theoretic framework. In Proceedings of LICS'87, pages 167-176, 1987.
25. T. Wilke. Automaten und Logiken zur Beschreibung zeitabhängiger Systeme. PhD thesis, Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, 1994. Available as Tech. Rep. 9408.
26. T. Wilke. Specifying timed state sequences in powerful decidable logics and timed automata. In H. Langmaack, W.-P. de Roever, and J. Vytopil, editors, Formal Techniques in Real-Time and Fault-Tolerant Systems, volume 863 of Lecture Notes in Computer Science. Springer Verlag, 1994.
27. P. Wolper, M. Vardi, and A.P. Sistla. Reasoning about infinite computation paths. In Proceedings of FOCS'83, pages 185-194, 1983.
28. H. Wong-Toi and G. Hoffmann. The control of dense real-time discrete event systems. In Proceedings of the 30th IEEE Conf. on Decision and Control, pages 1527-1528, 1991.