Abstract
Temporal logic is a useful tool for specifying correctness properties of reactive programs. In particular, real-time temporal logics have been developed for expressing quantitative timing aspects of systems. A tableau construction is an algorithm that translates a temporal logic formula into a finite-state automaton that accepts precisely all the models of the formula. It is a key ingredient to checking satisfiability of a formula as well as to the automata-theoretic approach to model checking. An improvement to the efficiency of tableau constructions has been the development of on-the-fly versions. In the real-time domain, tableau constructions have been developed for various logics and their complexities have been studied. However, there has been considerably less work aimed at improving and implementing them. In this paper, we present an on-the-fly tableau construction for a linear temporal logic with dense time, a fragment of Metric Interval Temporal Logic that is decidable in PSPACE. We have implemented a prototype of the algorithm and give experimental results. Being on-the-fly, our algorithm is expected to use less memory and to give smaller tableaux in many cases in practice than existing constructions.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. Alur. Techniques for automatic verification of real-time systems. PhD thesis, Stanford University, 1991.
R. Alur, C. Courcoubetis, and D. Dill. Model-checking in dense real-time. Information and Computation, 104:2–34, 1993.
R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183–235, 1994.
R. Alur, T. Feder, and T. Henzinger. The benefits of relaxing punctuality. Journal of the ACM, 43(1):116–146, January 1996.
M. Daniele, F. Giunchiglia, and M. Y. Vardi. Improved automata generation for linear temporal logic. In N. Halbwachs and D. Peled, editors, Computer Aided Verification: 11th International Conference Proceedings, CAV’99, Trento, Italy, July 6-10, 1999 (LNCS 1633), pages 249–260. Springer, 1999.
K. Etessami and G. Holzmann. Optimizing Büchi automata. To appear in Proceedings of CONCUR’2000, 2000.
M.C.W. Geilen and J.P.M. Voeten. Object-oriented modelling and specification using SHE. In R.C. Backhouse and J.C.M. Baeten, editors, Proceedings of the First International Symposium on Visual Formal Methods VFM’99, pages 16–24. Computing Science Reports 99/08 Department of Mathematics and Computer Science, Eindhoven University of Technology, 1999.
R. Gerth, D. Peled, M.Y. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In Proc. IFIP/WG6.1 Symp. Protocol Specification Testing and Verification (PSTV95), Warsaw Poland, pages 3–18. Chapman & Hall, June 1995.
T. Henzinger. It’s about time: real-time logics reviewed. In D. Sangiorgi and R. de Simone, editors, Proceedings of the 9th International Conference on Concurrency Theory (CONCUR 1998), pages 439–454, Berlin, 1998. Springer.
T. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. Information and Computation, 111(1):193–244, June 1994.
O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In Twelfth Annual ACM Symposium on Principles of Programming Languages, pages 97–107. ACM SIGACT/SIGPLAN, 1985.
A. Pnueli. The temporal logic of programs. In Proc. of the 18th Annual Symposium on Foundations of Computer Science, pages 46–57. IEEE Computer Society Press, 1977.
J.-F. Raskin. Logics, automata and classical theories for deciding real time. PhD thesis, Facultés Universitaires Notre-Dame de la Paix, Namur (Belgium), June 1999.
M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification (preliminary report). In Logic in Computer Science, pages 332–344. IEEE TC-MFC, IEEE Computer Society Press, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Geilen, M., Dams, D. (2000). An On-the-Fly Tableau Construction for a Real-Time Temporal Logic. In: Joseph, M. (eds) Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT 2000. Lecture Notes in Computer Science, vol 1926. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45352-0_23
Download citation
DOI: https://doi.org/10.1007/3-540-45352-0_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41055-3
Online ISBN: 978-3-540-45352-9
eBook Packages: Springer Book Archive