Accepting zeno words without making time stand still

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

Volumn 1295, Issue , 1997, Pages 149-158

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

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

INTERACTIVE COMPUTER SYSTEMS; TIME SHARING SYSTEMS;

DAMPED OSCILLATORS; PHYSICAL PHENOMENA; TIMED AUTOMATA; TIMED MODELS; TIMED SYSTEMS;

REAL TIME SYSTEMS;

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

References (21)

1. 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
2. R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994
3. N. Bedon. Automata, semi-groups and recognizability of words on ordinals. International Journal of Algebra and Computation. to appear
4. N. Bedon. Finite automata and ordinals. Theoretical Computer Science, 156:119-144, 1996
5. B. Bérard. Untiming timed languages. Information Processing Letters, 55:129-135, 1995
6. B. Bérard, P. Gastin, and A. Petit. On the power of non observable actions in timed automata, tn Proceedings of STACS'96, number 1046 in Lecture Notes in Computer Science, pages 257-268. Springer Verlag, 1996
7. B. Bérard, P. Gastin, and A. Petit. Refinement and abstraction for timed languages. Technical report, LSV, CNRS URA 2236, ENS de Cachan, 1997
8. B. Bérard and C. Picaronny. Accepting zeno words without stopping time. Technical report, LSV, CNRS URA 2236, ENS de Cachan, 1997
9. R. Büchi. On a decision method in restricted second order arithmetic. In Proceedings of the International Congress on Logic, Methodology and Philosophy, pages 1-11. Standford University Press, 1962
10. Y. Choueka. Finite automata, definable sets and regular expressions over wn-tapes. Journal of Computer and System Sciences, 17:81-97, 1978
11. 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
12. V. Diekert, P. Gastin, and A. Petit. Removing e-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
13. M.R. Hansen, P.K. Pandya, and C. Zhou. Finite divergence. Theoretical Computer Science, 138:113-139, 1995
14. J. C. Hemmer and P. Wolper. Ordinal finite automata and languages. Technical report, University of Liege, 1992
15. T.A. Henzinger, Z. Manna, and A. Pnueli. Temporal proofs methodologies for real-time systems. In Proceedings of POPL'91, pages 353-366, 1991
16. T.A. Henzinger, X. NicoUin, J. Sifalds, and S. Yovine. Symbolic model checking for real-time systems. Information and Computation, 111(2):193-244, 1994
17. N. Lynch and H. Attiya. Using mappings to prove timing properties. In Proceedings of PODC'90, pages 265-280, 1990
18. J. Ostroff. Temporal Logic of Real-time Systems. Research Studies Press, 1990
19. C. Ramchandani. Analysis of asynchronous concurrent systems by Petri nets. Technical report, Massachusetts Institute of Technology, 1974
20. J.G. Rosenstein. Linear orderings. Academic Press, New York, 1982
21. J. Wojciechowski. Finite automata on transfmite sequences and regular expressions. Fundamenta Informaticae, 8.3-4:379-396, 1985