Abstract
Temporal logic model checking is a useful method for verifying properties of finite-state concurrent systems. However, due to the state explosion problem modular methods are essential in making the verification task manageable. One such method is to verify that certain properties Φi are true of the submodules Mi of the system in all environments, and that the required property Φ is a logical implication of these. This paper presents an algorithm deciding whether a nexttimeless linear temporal logic formula Φ is true of a distributed variable module M in all environments. There are two versions of the algorithm: one allowing no fairness requirements and one for strongly fair concurrency. Both versions run in time O(¦M¦ · 2c·¦φ¦). In addition to presenting the algorithms it is shown that given some reasonable assumptions the method is complete in the sense that all formulas Φ true of M1∥M2 can be verified by it.
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
Barringer, H.: Using Temporal Logic in the Compositional Specification of Concurrent Systems, in Galton, A. (ed.): Temporal Logics and Their Applications, Academic Press, 1987, pp. 59–90
Barringer, H. & Kuiper, R. & Pnueli, A.: Now You May Compose Temporal Logic Specification, in Conference Record of the Sixteenth Annual ACM Symposium on Theory of Computing, 1984, pp. 51–63
Best, E. & Esparza, J.: Model Checking of Persistent Petri Nets, Hildesheimer Informatikberichtc 11/91, Universität Hildesheim, Institut für Informatik, 1991, also presented in Computer Science Logic '91
Clarke, E. M. & Long, D. E. & McMillan, K. L.: Compositional Model Checking, in Proceedings of the Fourth IEEE Symposium on Logic in Computer Science, 1989, pp. 353–362
Grümberg, O. & Long, D. E.: Model Checking and Modular Verification, in Baeten, J. C. M. & Groote, J. F. (eds.): Proceedings of CONCUR'91, the 2nd International Conference on Concurrency Theory, LNCS, vol. 527, Springer-Verlag, 1991, pp. 250–265
Josko, B.: Verifying the Correctness of AADL-modules Using Model Checking, in de Bakker, J.W. & de Roever, W.-P. & Rozenberg, G. (eds.): Proceedings of the REX Workshop on Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, LNCS, vol. 430, Springer-Verlag, 1989, pp. 386–400
Lamport, L.: What Good is Temporal Logic?, in Proceedings of the IFIP 9th World Computer Congress, 1983, pp. 657–668
Lichtenstein. O, & Pnueli, A.: Checking That Finite State Concurrent Programs Satisfy Their Linear Specification, in Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages, 1985, pp. 97–107
Lichtenstein. O, & Pnueli, A. & Zuck, L.: The Glory of The Past, in Parikh, R. (ed.): Logics of Programs, Proceedings, LNCS, vol. 193, Springer-Verlag, 1985, pp. 196–218
Manna, Z. & Pnueli. A.: Verification of Concurrent Programs: The Temporal Framework, in Boyer, R. S. & Moore, J. S. (eds.): The Correctness Problem in Computer Science, Academic Press, 1981, pp. 215–273
Manna, Z. & Pnueli. A.: The Temporal Logic of Reactive and Concurrent Systems, vol. 1, Specification, Springer-Verlag, 1991
Pnueli, A.: In Transition from Global to Modular Temporal Reasoning About Programs, in Apt, K. R. (ed.): Logics and Models of Concurrent Systems, NATO ASI Series, vol. F13, Springer-Verlag, 1985, pp. 123–146
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaivola, R. (1993). Compositional model checking for linear-time temporal logic. In: von Bochmann, G., Probst, D.K. (eds) Computer Aided Verification. CAV 1992. Lecture Notes in Computer Science, vol 663. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56496-9_20
Download citation
DOI: https://doi.org/10.1007/3-540-56496-9_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56496-6
Online ISBN: 978-3-540-47572-9
eBook Packages: Springer Book Archive