Abstract
A language for representing timed automata is introduced. Its semantics is defined in terms of timed automata. This language is complete in the sense that any timed automaton can be represented by a term in the language. We also define a direct operational semantics for the language in terms of (timed) transition systems. This is proven to be equivalent (or, more precisely, timed bisimilar) to the interpretation in terms of timed automata.
In addition, a set of axioms is given that is shown to be sound for timed bisimulation. Finally, we introduce several features including the parallel composition and derived time operations like wait, time-out and urgency. We conclude with an example and show that we can eliminate non-reachable states using algebraic techniques.
Supported by the NWO/SION project 612-33-006.
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, C. Courcoubetis, N. Halbwachs, D. Dill, and H. Wong-Toi. Minimization of timed transition systems. In W.R. Cleaveland, editor, Proceedings CONCUR 92, Stony Brook, NY, USA, volume 630 of Lecture Notes in Computer Science, pages 340–354. Springer-Verlag, 1992.
R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138:3–34, 1995.
R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183–235, 1994.
R. Alur and T.A. Henzinger. Real-time system=discrete system + clock variables. In T. Rus and C. Rattray, editors, Theories and Experiences for Real-Time System Development — Papers presented at First AMAST Workshop on Real-Time System Development, Iowa City, Iowa, November 1993, pages 1–29. World Scientific, 1994.
J.C.M. Baeten and J.A. Bergstra. Real time process algebra. Journal of Formal Aspects of Computing Science, 3(2):142–188, 1991.
J.C.M. Baeten and J.A. Bergstra. Real time process algebra with infinitesimals. In A. Ponse, C. Verhoef, and S.F.M. van Vlijmen, editors, Algebra of Communicating Processes, Utrecht, 1994, Workshops in Computing, pages 148–187. Springer-Verlag, 1995.
J.C.M. Baeten and J.W. Klop, editors. Proceedings CONCUR 90, Amsterdam, volume 458 of Lecture Notes in Computer Science. Springer-Verlag, 1990.
T. Bolognesi and E. Brinksma. Introduction to the ISO specification language LOTOS. In P.H.L. van Eijk, C.A. Vissers, and M. Diaz, editors, The formal description technique LOTOS, pages 23–73. Elsevier Science Publishers, 1989.
T. Bolognesi and F. Lucidi. Timed process algebras with urgent interactions and a unique powerful binary operator. In de Bakker et al. [13], pages 124–148.
P.R. D'Argenio and E. Brinksma. A calculus for timed automata. Technical Report CTIT 96-13, Department of Computer Science, University of Twente, 1996.
J. Davies et al. Timed CSP: Theory and practice. In de Bakker et al. [13], pages 640–675.
C. Daws, A. Olivero, and S. Yovine. Verifying ET-LOTOS programs with KRONOS. In Hogrefe and Leue [16], pages 207–222.
J.W. de Bakker, C. Huizing, W.P. de Roever, and G. Rozenberg, editors. Proceedings REX Workshop on Real-Time: Theory in Practice, Mook, The Netherlands, June 1991, volume 600 of Lecture Notes in Computer Science. Springer-Verlag, 1992.
W.J. Fokkink. Clocks, Trees and Stars in Process Theory. PhD thesis, University of Amsterdam, December 1994.
T.A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. Information and Computation, 111:193–244, 1994.
D. Hogrefe and S. Leue, editors. Proceedings of the 7th International Conference on Formal Description Techniques, FORTE'94 North-Holland, 1994.
A.S. Klusener. Models and axioms for a fragment of real time process algebra. PhD thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology, December 1993.
G. Leduc and L. Léonard. A formal definition of time in LOTOS. In Revised draft on enhancements to LOTOS, 1994. Annex G of document ISO/IEC JTC1/SC21/WG1/Q48.6.
N.A. Lynch and P.W. Vaandrager. Forward and backward simulations — part II: Timing-based systems. Report CS-R9314, CWI, Amsterdam, March 1993. To appear in Information and Computation.
N.A. Lynch and F.W. Vaandrager. Action transducers and timed automata. Report CS-R9460, CWI, Amsterdam, November 1994. To appear in Formal Aspects of Computing.
R. Milner. Communication and Concurrency. Prentice-Hall International, Englewood Cliffs, 1989.
F. Moller and C. Tofts. A temporal calculus of communicating systems. In Baeten and Klop [7], pages 401–415.
X. Nicollin and J. Sifakis. The algebra of timed processe ATP: Theory and application. Information and Computation, 114(1):131–178, 1994.
X. Nicollin, J. Sifakis, and S. Yovine. Compiling real-time specifications into extended automata. IEEE Transactions on Software Engineering, 18(9):794–804, September 1992.
X. Nicollin, J. Sifakis, and S. Yovine. From ATP to timed graphs and hybrid systems. Acta Informatica, 30(2):181–202, 1993.
W. Yi. Real-time behaviour of asynchronous agents. In Baeten and Klop [7], pages 502–520.
W. Yi, P. Pettersson, and M. Daniels. Automatic verification of real-time communicating systems by constraint-solving. In Hogrefe and Leue [16], pages 223–238.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
D'Argenio, P.R., Brinksma, E. (1996). A calculus for timed automata. In: Jonsson, B., Parrow, J. (eds) Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT 1996. Lecture Notes in Computer Science, vol 1135. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61648-9_37
Download citation
DOI: https://doi.org/10.1007/3-540-61648-9_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61648-1
Online ISBN: 978-3-540-70653-3
eBook Packages: Springer Book Archive