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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183–235, 1994.
N. Bedon. Automata, semi-groups and recognizability of words on ordinals. International Journal of Algebra and Computation. to appear.
N. Bedon. Finite automata and ordinals. Theoretical Computer Science, 156:119–144, 1996.
B. Bérard. Untiming timed languages. Information Processing Letters, 55:129–135, 1995.
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.
B. Bérard, P. Gastin, and A. Petit. Refinement and abstraction for timed languages. Technical report, LSV, CNRS URA 2236, ENS de Cachan, 1997.
B. Bérard and C. Picaronny. Accepting zeno words without stopping time. Technical report, LSV, CNRS URA 2236, ENS de Cachan, 1997.
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.
Y. Choueka. Finite automata, definable sets and regular expressions over ωn-tapes. Journal of Computer and System Sciences, 17:81–97, 1978.
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.
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.
M.R. Hansen, P.K. Pandya, and C. Zhou. Finite divergence. Theoretical Computer Science, 138:113–139, 1995.
J. C. Hemmer and P. Wolper. Ordinal finite automata and languages. Technical report, University of Liege, 1992.
T.A. Henzinger, Z. Manna, and A. Pnueli. Temporal proofs methodologies for real-time systems. In Proceedings of POPL'91, pages 353–366, 1991.
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.
N. Lynch and H. Attiya. Using mappings to prove timing properties. In Proceedings of PODC'90, pages 265–280, 1990.
J. Ostroff. Temporal Logic of Real-time Systems. Research Studies Press, 1990.
C. Ramchandani. Analysis of asynchronous concurrent systems by Petri nets. Technical report, Massachusetts Institute of Technology, 1974.
J.G. Rosenstein. Linear orderings. Academic Press, New York, 1982.
J. Wojciechowski. Finite automata on transfinite sequences and regular expressions. Fundamenta Informaticae, 8.3-4:379–396, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bérard, B., Picaronny, C. (1997). Accepting Zeno words without making time stand still. In: Prívara, I., Ružička, P. (eds) Mathematical Foundations of Computer Science 1997. MFCS 1997. Lecture Notes in Computer Science, vol 1295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029958
Download citation
DOI: https://doi.org/10.1007/BFb0029958
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63437-9
Online ISBN: 978-3-540-69547-9
eBook Packages: Springer Book Archive