Accepting Zeno words: A way toward timed refinements

Acta Informatica

Volumn 37, Issue 1, 2000, Pages 45-81

  Bérard, Béatrice ^a   Picaronny, Claudine ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034348608     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050003     Document Type: Article

References (20)

1. 1. R. Alur, D.L. Dill: Automata for modeling real-time systems. In Proceedings of ICALP'90, Lecture Notes in Computer Science vol 443, pp 322-335, Berlin Heidelberg New York: Springer 1990
2. 2. R. Alur, D.L. Dill: A theory of timed automata. Theor Comput Sci 126: 183-235 (1994)
3. 3. E. Asarin, P. Caspi, O. Maler: A Kleene theorem for timed automata. In: Proceedings of LICS'97, 1997
4. 4. N. Bedon: Finite automata and ordinals. Theor Comput Sci 156: 119-144 (1996)
5. 5. B. Bérard: Untiming timed languages. Inform Process Lett 55: 129-135 (1995)
6. 6. B. Bérard, P. Gastin, A. Petit: On the power of non observable actions in timed automata. In Proceedings of STACS'96, in Lecture Notes in Computer Science vol 1046, pp. 257-268. Berlin Heidelberg New York: Springer 1996
7. 7. B. Bérard, P. Gastin, A. Petit: Refinement and abstraction for timed languages. Technical report, LSV, CNRS URA 2236, ENS de Cachan, 1997
8. 1. In Siefkes Büchi (ed.) The Monadic Second Order Theory of All Countable Ordinals, Lecture Notes in Mathematics vol 328, pp. 1-126, 1973
9. n-tapes. J Comput Syst Sci 17: 81-97 (1978)
10. 10. C. Courcoubetis, M. Yannakakis: Minimum and maximum delay problems in real-time systems. In Proceedings of CAV'91, Lecture Notes in Computer Science vol 575, pp. 399-409. Berlin Heidelberg New York: Springer 1991
11. 11. V. Diekert, P. Gastin, A. Petit Removing ∈-transitions in timed automata. In Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS'97), Lecture Notes in Computer Science vol 1200, pp. 583-594. Berlin Heidelberg New York: Springer 1997
12. 12. M.R. Hansen, P.K. Pandya, C. Zhou: Finite divergence. Theor Comput Sci 138: 113-139 (1995)
13. 13. J. C. Hemmer, P. Wolper: Ordinal finite automata and languages. Technical report, University of Liege, 1992
14. 14. TA. Henzinger, Z. Manna, A. Pnueli: Temporal proofs methodologies for real-time systems. In Proceedings of POPL'91, pp. 353-366, 1991
15. 15. T.A. Henzinger, X. Nicollin, J. Sifakis, S. Yovine: Symbolic model checking for real-time systems. Informa Comput 111(2): 193-244 (1994)
16. 16. N. Lynch, H. Attiya: Using mappings to prove timing properties. In Proceedings of PODC'90, pp. 265-280, 1990
17. 17. J. Ostroff: Temporal Logic of Real-time Systems. Research Studies Press, 1990
18. 18. C. Ramchandani: Analysis of asynchronous concurrent systems by Petri nets. Technical report, Massachusetts Institute of Technology, 1974
19. 19. J.G. Rosenstein: Linear orderings. New York: Academic Press 1982
20. 20. J. Wojciechowski: Finite automata on transfinite sequences and regular expressions. Fundam Inform 8(3-4): 379-396 (1985)