Advertisement

Accepting Zeno words without making time stand still

  • Béatrice Bérard
  • Claudine Picaronny
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1295)

Abstract

Timed models were introduced to describe the behaviors of real-time systems and, up to now, they were usually required to produce only executions with divergent sequences of times. However, some physical phenomena, as the movements of a damped oscillator, can be represented by convergent executions, producing Zeno words in a natural way. Moreover, time can progress if such an execution can be followed by other ones. We extend the definition of timed automata, allowing to generate sequences of infinite convergent executions, while keeping good properties for the verification of systems: emptiness is still decidable. We introduce a new notion of refinement for timed systems, in which actions are replaced by recognizable Zeno languages and we prove that the corresponding class of languages is the closure of the usual one under refinement.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.Google Scholar
  2. 2.
    R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183–235, 1994.CrossRefGoogle Scholar
  3. 3.
    N. Bedon. Automata, semi-groups and recognizability of words on ordinals. International Journal of Algebra and Computation. to appear.Google Scholar
  4. 4.
    N. Bedon. Finite automata and ordinals. Theoretical Computer Science, 156:119–144, 1996.CrossRefGoogle Scholar
  5. 5.
    B. Bérard. Untiming timed languages. Information Processing Letters, 55:129–135, 1995.CrossRefGoogle Scholar
  6. 6.
    B. Bérard, P. Gastin, and A. Petit. On the power of non observable actions in timed automata. In Proceedings of STACS'96, number 1046 in Lecture Notes in Computer Science, pages 257–268. Springer Verlag, 1996.Google Scholar
  7. 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.Google Scholar
  8. 8.
    B. Bérard and C. Picaronny. Accepting zeno words without stopping time. Technical report, LSV, CNRS URA 2236, ENS de Cachan, 1997.Google Scholar
  9. 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.Google Scholar
  10. 10.
    Y. Choueka. Finite automata, definable sets and regular expressions over ωn-tapes. Journal of Computer and System Sciences, 17:81–97, 1978.CrossRefGoogle Scholar
  11. 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.Google Scholar
  12. 12.
    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.Google Scholar
  13. 13.
    M.R. Hansen, P.K. Pandya, and C. Zhou. Finite divergence. Theoretical Computer Science, 138:113–139, 1995.CrossRefGoogle Scholar
  14. 14.
    J. C. Hemmer and P. Wolper. Ordinal finite automata and languages. Technical report, University of Liege, 1992.Google Scholar
  15. 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.Google Scholar
  16. 16.
    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.CrossRefGoogle Scholar
  17. 17.
    N. Lynch and H. Attiya. Using mappings to prove timing properties. In Proceedings of PODC'90, pages 265–280, 1990.Google Scholar
  18. 18.
    J. Ostroff. Temporal Logic of Real-time Systems. Research Studies Press, 1990.Google Scholar
  19. 19.
    C. Ramchandani. Analysis of asynchronous concurrent systems by Petri nets. Technical report, Massachusetts Institute of Technology, 1974.Google Scholar
  20. 20.
    J.G. Rosenstein. Linear orderings. Academic Press, New York, 1982.Google Scholar
  21. 21.
    J. Wojciechowski. Finite automata on transfinite sequences and regular expressions. Fundamenta Informaticae, 8.3-4:379–396, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Béatrice Bérard
    • 1
  • Claudine Picaronny
    • 1
  1. 1.LSV, CNRS URA 2236, ENS de CachanCachan CedexFrance

Personalised recommendations