Abstract
This paper proposes an expressive extension to Propositional Linear Temporal Logic dealing with real time correctness properties and gives an automata-theoretic model checking algorithm for the extension. The algorithm has been implemented and applied to examples.
This work was supported in part by NSF grant CCR9415496 and SRC contract 95-DP-388.
Chapter PDF
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
Alur, R., and Henzinger, T. A., A Really Temporal Logic. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, New York, pp. 164–169, 1989.
Alur, R. and Henzinger, T. A., Logics and Models of Real Time: A Survey. In Real Time: Theory in Practice. J. W. de Bakker, K. Huizing, W.-P. de Roever, and G. Rozenberg, eds. Lecture Notes in Computer Science, Vol. 600. Springer-Verlag, New York, pp. 74–106, 1982.
Alur, R. and Henzinger, T. A., A Really Temporal Logic. In Journal of the Association for Computing Machinery. Vol. 41, No. 1, January 1994, pp. 181–204, 1994.
Arnold, A., Finite Transition Systems: Semantics of Communicating Systems. Translated by John Plaice, Prentice Hall, 1994.
Bouajjani, A., Echahed, R. and Habermehl, P., Verifying Infinite State Processes with Sequential and Parallel Composition. In ACM POPL95 pp 95–106.
Bouajjani, A., Echahed, R. and Habermehl, P., On The Verification Problem of Nonregular Properties for Nonregular Processes. In IEEE LICS95 pp 123–133.
Buchi, J. R., On a Decision Method in restricted Second Order Arithmetic, Proc. 1960 Inter. Congress on Logic, Methodology, and Philosophy of Science, pp. 1–11.
Clarke, E. M., and Emerson, E. A., Design and Verification of Synchronization Skeletons using Branching Time Temporal Logic, Logics of Programs Workshop, IBM Yorktown Heights, New York, Springer LNCS no. 131, pp. 52–71, May 1981.
Emerson, E. A., Automated Temporal Reasoning about Reactive Systems. In Logics for Concurrency, Faron Moller and Graham Birtwistle, Eds., Springer Verlag, Berlin, 1996, pp. 41–101.
Emerson, E. A., Mok, A. K., Sistla, A. P., and Srinivasan, J., Quantitative Temporal Reasoning. In CAV 90: Computer-aided Verification. E. M. Clarke and R.P. Kurshan Eds. Lecture Notes in Computer Science, Vol. 531. Springer-Verlag, New York, pp. 136–145, 1990.
Emerson, E. A. and Trefler, Richard J., Generalized Quantitative Temporal Reasoning. Dept. of Computer Sciences, University of Texas at Austin, technical report TR-96-20, 1996.
Heitmeyer, C. L., Jeffords, R.D., Labaw, B.G., A Benchmark for Comparing Different Approaches for Specifying and Verifying Real-Time Systems. In Proc. 10th Intern. Workshop on Real-Time Operating Systems and Software, May, 1993.
Harel, D. and Pnueli, A., On the Development of Reactive Systems. In Logics and Models of Concurrent Systems. K. Apt Ed. NATO Advanced Summer Institutes, Vol. F-13. Springer-Verlag, pp. 477–498, 1985.
Litchtenstein, O., and Pnueli, A., Checking That Finite State Concurrent Programs Satisfy Their Linear Specifications, POPL85, pp. 97–107, Jan. 85.
McMillan, K.L., Symbolic Model Checking: An approach to the state explosion problem. Ph.D. Thesis, Department of Computer Science, Carnegie Mellon University, 1992.
Nivat, M., and Perrin, D., Eds. Automata on Infinite Words. Springer-Verlag, Berlin, 1985.
Pnueli, A., The Temporal Logic of Programs, 18th annual IEEE-CS Symp. on Foundations of Computer Science, pp. 46–57, 1977.
Pnueli, A., Applications of Temporal Logic to the Specification and Verification of Reactive Systems: A Survey of Current Trends, in Current Trends in Concurrency: Overviews and Tutorials, ed. J. W. de Bakker, W.P. de Roever, and G. Rozenberg, Springer LNCS no. 224, 1986.
Queille, J. P., and Sifakis, J., Specification and verification of concurrent programs in CESAR, Proc. 5th Int. Symp. Prog., Springer LNCS no. 137, pp. 195–220, 1982.
Vardi, M., and Wolper, P., An Automata-theoretic Approach to Automatic Program Verification, Proc. IEEE LICS, pp. 332–344, 1986.
Wolper, P., Temporal Logic Can Be More Expressive Information and Control, Vol. 56, 1983, pp. 72–99.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Emerson, E.A., Trefler, R.J. (1997). Generalized quantitative temporal reasoning: An automata-theoretic approach. In: Bidoit, M., Dauchet, M. (eds) TAPSOFT '97: Theory and Practice of Software Development. CAAP 1997. Lecture Notes in Computer Science, vol 1214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030596
Download citation
DOI: https://doi.org/10.1007/BFb0030596
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62781-4
Online ISBN: 978-3-540-68517-3
eBook Packages: Springer Book Archive