Abstract
In this paper we present the theory of Timed Modal Specifications (TMS) together with its implementation, the tool Epsilon. TMS and Epsilon are timed extensions of respectively Modal Specifications [7, 9] and the Tav system [6, 4]. Also, the theory of TMS is an extension of real-timed process calculi with the specific aim of allowing loose or partial specifications. This allows us to define a notion of refinement, generalizing in a natural way the classical notion of bisimulation.
This work has been supported by the Danish National Science Research Council project DART and the ESPRIT Basic Research Action 7166, CONCUR2.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R. Alur and D. Dill. Automata for modelling real-time systems. In ICALP'90, volume 443 of Lecture Notes in Computer Science. Springer-Verlag, 1990.
R. Alur and D. Dill. The theory of timed automata. In Real-Time: Theory in Practice, volume 600 of Lecture Notes in Computer Science. Springer-Verlag, 1991.
J. Baeten and J. Bergstra. Real time process algebra. Technical Report P8916, University of Amsterdam, 1989.
A. Børjesson, K. Larsen, and A. Skou. Generality in design and compositional verification using tav. In Proceedings of FORTE'92, 1992.
G. Boudol and K. Larsen. Graphical versus logical specifications. In Proceedings of CAAP'90, volume 431 of Lecture Notes in Computer Science, 1990.
J. Godskesen, K. Larsen, and M. Zeeberg. TAV (tools for automatic verification) — users manual. Technical report, University of Aalborg, Denmark, 1989.
K. Larsen. Modal specifications. In Proceedings of Workshop on Automatic Verification Methods for Finite State Systems, volume 407 of Lecture Notes in Computer Science, 1990.
K. Larsen. Efficient local correctness checking. In Proceedings of CAV'92, 1992.
K. Larsen and B. Thomsen. A modal process logic. In Proceedings LICS'88, 1988.
K. Larsen and Y. Wang. Time abstracted bisimulation: Implicit specifications and decidability. Submitted for MFPS'93.
R. Milner. Communication and Concurrency. Series in Computer Science. Prentice-Hall International, 1989.
X. Nicollin, J. Sifakis, and S. Yovine. Prom ATP to timed graphs and hybrid systems. In Real-Time: Theory in Practice, volume 600 of Lecture Notes in Computer Science. Springer-Verlag, 1991.
K. Čerāns. Decidability of bisimulation equivalences for processes with parallel timers. In Proceedings of CAV'92, 1992.
Y. Wang. Real-time behaviour of asynchronous agents. In Proceedings of CON-CUR '90, volume 458 of Lecture Notes in Computer Science. Springer-Verlag, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Čerāns, K., Godskesen, J.C., Larsen, K.G. (1993). Timed modal specification — Theory and tools. In: Courcoubetis, C. (eds) Computer Aided Verification. CAV 1993. Lecture Notes in Computer Science, vol 697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56922-7_21
Download citation
DOI: https://doi.org/10.1007/3-540-56922-7_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56922-0
Online ISBN: 978-3-540-47787-7
eBook Packages: Springer Book Archive