Abstract
The model of timed I/O automata represents an extension of the model of I/O automata with the aim of reasoning about realtime systems. A number of case studies using timed I/O automata has been carried out, among them a treatment of the so-called Generalized Railroad Crossing (GRC). An already existing formalization of the metatheory of I/O automata within Isabelle/HOLCF allows for fully formal tool-supported verification using I/O automata. We present a modification of this formalization which accomodates for reasoning about timed I/O automata. The guiding principle in choosing the parts of the metatheory of timed I/O automata to formalize has been to provide all the theory necessary for formalizing the solution to the GRC. This leads to a formalization of the GRC, in which not only the correctness proof itself has been formalized, but also the underlying meta-theory of timed I/O automata, on which the correctness proof is based.
BRICS: Basic Research in Computer Science, Centre of the Danish National Research Foundation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
The isabelle theories for timed i/o automata and the Generalized Railroad Crossing. available via http://www.brics.dk/~grobauer/tioa/index.html.
Myla M. Archer and Constance L. Heitmeyer. Mechanical verification of timed automata: A case study. Technical Report NRL/MR/5546-98-8180, Naval Research Laboratory, 1998.
Myla M. Archer, Constance L. Heitmeyer, and Steve Sims. TAME: A PVS interface to simplify proofs for automata models. In Proceedings of UITP’ 98, July 1998.
Stefan Berghofer. Definitorische Konstruktion induktiver Datentypen in Isabelle/HOL. Master’s thesis, TU München, 1998.
Albert J. Camilleri. Mechanizing CSP trace theory in higher order logic. IEEE Transactions on Software Engineering, 16(9):993–1004, 1990.
Ching-Tsun Chou and Doron Peled. Formal verification of a partial-order reduction technique for model checking. In T. Margaria and B. Steffen, editors, Proc. 2nd Workshop Tools and Algorithms for the Construction and Analysis of Systems (TACAS’96), volume 1055 of Lecture Notes in Computer Science. Springer Verlag, 1996.
Marco Devillers, David Griffioen, and Olaf Müller. Possibly infinite sequences in theorem provers: A comparative study. In TPHOL’97, Proc. of the 10th International Workshop on Theorem Proving in Higher Order Logics, volume 1275 of Lecture Notes in Computer Science, pages 89–104, 1997.
R. Gawlick, R. Segala, J.F. Sogaard-Andersen, and N.A. Lynch. Liveness in timed and untimed systems. Technical report, Laboratory for Computer Science, MIT, Cambridge, MA., December 1993. Extended abstract in Proceedings ICALP’ 94.
Constance Heitmeyer and Nancy Lynch. The generalized railroad crossing: A case study in formal verification of real-time systems. In Proceedings of the IEEE Real-Time Systems Symposium, San Juan, Puerto Rico, Dec. 1994.
N.A. Lynch and F.W. Vaandrager. Forward and backward simulations — Part II: timing based systems. Technical Report CS-R9314, CWI, 1993.
Nancy A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, 1996.
Olaf Müller. I/O Automata and Beyond — Temporal Logic and Abstraction in Isabelle. In TPHOL’98. Proc. of the 11th International Workshop on Theorem Proving in Higher Order Logics, volume 1479 of Lecture Notes in Computer Science, pages 331–348, 1998.
Olaf Müller. A Verification Environment for I/O Automata Based on Formalized Meta-Theory. PhD thesis, TUMünchen, 1998.
Olaf Müller and Tobias Nipkow. Traces of I/O automata in Isabelle/HOLCF. In M. Bidoit and M. Dauchet, editors, TAPSOFT’97: Theory and Practice of Software Development, volume 1214 of LNCS, pages 580–594. Springer, 1997.
Olaf Müller, Tobias Nipkow, David von Oheimb, and Oscar Slotosch. HOLCF = HOL + LCF. To appear in Journal of Functional Programming.
Wolfgang Naraschewski and Markus Wenzel. Object-oriented verification based on record subtyping in higher-order logic. In Theorem Proving in Higher Order Logics, Proceedings of TPHOLs’ 98, volume 1479 of Lecture Notes in Computer Science, 1998.
Tobias Nipkow and David von Oheimb. Javalight is type-safe — definitely. In Proc. 25th ACM Symp. Principles of Programming Languages, pages 161–170. ACM Press, New York, 1998.
S. Owre, Rushby J., Shankar N., and M. Srivas. PVS: Combining specification, proof checking, and model checking. In R. Alur and T.A. Henzinger, editors, Computer Aided Verification, volume 1102 of Lecture Notes in Computer Science, 1996.
Lawrence C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of Lecture Notes in Computer Science. Springer Verlag, 1994.
Lawrence C. Paulson. Generic automatic proof tools. In R. Veroff, editor, Automated Reasoning and its Applications. MIT Press, 1997.
Lawrence C. Paulson. A generic tableau prover and its integration with Isabelle. In CADE-15 Workshop on Integration of Deductive Systems, 1998.
Markus Wenzel. Type classes and overloading in higher-order logic. In Theorem Proving in Higher Order Logics, Proceedings of TPHOLs’ 97, volume 1275 of Lecture Notes in Computer Science, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grobauer, B., Müller, O. (1999). From I/O Automata to Timed I/O Automata. In: Bertot, Y., Dowek, G., Théry, L., Hirschowitz, A., Paulin, C. (eds) Theorem Proving in Higher Order Logics. TPHOLs 1999. Lecture Notes in Computer Science, vol 1690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48256-3_18
Download citation
DOI: https://doi.org/10.1007/3-540-48256-3_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66463-5
Online ISBN: 978-3-540-48256-7
eBook Packages: Springer Book Archive