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 like compositional minimisation based on semantic congruences are essential in making the verification task manageable. In this paper we show that the so-called CFFD-equivalence defined by initial stability, infinite traces, divergence traces and stable failures is exactly the weakest compositional equivalence preserving nexttimeless linear temporal logic with an extra operator distinguishing deadlocks from divergences. Furthermore, a slight modification of CFFD, called the NDFD-equivalence, is exactly the weakest compositional equivalence preserving standard nexttimeless linear temporal logic.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Bolognesi, T. & Brinksma, E.: Introduction to the ISO Specification Language LOTOS, in The Formal Description Technique LOTOS, North-Holland, 1989, pp. 23–73
Bolognesi, T. & Caneve, M.: Equivalence Verification: Theory, Algorithms and a Tool, in The Formal Description Technique LOTOS, North-Holland, 1989, pp. 303–326
Browne, M. C. & Clarke, E. M. & Grümberg, O.: Characterizing Kripke Structures in Temporal Logic, in Ehrig, H. & Kowalski, R. & Levi, G. & Montanari, U. (eds.): TAPSOFT '87, vol. I, LNCS, vol. 249, Springer-Verlag, 1987, pp. 256–270
Clarke, E. M. & Long, D. & McMillan, K. L.: Compositional Model Checking, in Proceedings of the Fourth IEEE Symposium on Logic in Computer Science, 1989, pp. 353–362
Cleaveland, R. & Hennessy, M.: Testing Equivalence as a Bisimulation Equivalence, in Proceedings of the Workshop on Automatic Verification Methods for Finite State Systems, LNCS, vol. 407, Springer-Verlag, 1990, pp. 11–23
Cleaveland, R. & Parrow, J. & Steffen, B.: The Concurrency Workbench, in Proceedings of the Workshop on Automatic Verification Methods for Finite State Systems, LNCS, vol. 407, Springer-Verlag, 1990, pp. 24–37
Emerson, E. A. & Clarke, E. M.: Characterising Correctness Properties of Parallel Programs Using Fixpoints, in Proceedings of the 7th ICALP, LNCS, vol. 85, Springer-Verlag, 1980, pp. 169–181
Graf, S. & Steffen, B.: Compositional Minimization of Finite-State Processes, in Kurshan, R. P. & Clarke, E. M. (eds.): Proceedings of CAV'90, LNCS, vol. 531, Springer-Verlag, 1990, pp. 186–196
Kaivola, R. & Valmari, A.: Using Truth-Preserving Reductions to Improve the Clarity of Kripke-Models, in Baeten, J. C. M. & Groote, J. F. (eds.): Proceedings of CONCUR'91, LNCS, vol. 527, Springer-Verlag, 1991, pp. 361–375
Kemppainen, J. & Levanto, M. & Valmari, A. & Clegg, M.: ”ARA” Puts Advanced Reachability Analysis Techniques Together, in Proceedings of the Fifth Nordic Workshop in Programming Environment Research, Tampere University of Technology, Software Systems Laboratory Report 14, 1992
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
Milner, R.: Communication and Concurrency, Prentice Hall, 1989
Olderog, E.-R. & Hoare, C. A. R.: Specification-Oriented Semantics for Communicating Processes, in Acta Informatica, vol. 23, 1986, pp. 9–66
Stirling, C.: Comparing Linear and Branching Time Temporal Logics, University of Edinburgh, LFCS Report Series ECS-LFCS-87-24, 1987
Valmari, A.: Compositional State Space Generation, in Proceedings of the 11th International Conference on Application and Theory of Petri Nets, 1990, pp. 43–62, to appear also in Advances in Petri Nets 92, LNCS, Springer-Verlag, 1992
Valmari, A. & Tienari, M.: An Improved Failures Equivalence for Finite-State Systems with a Reduction Algorithm, in Protocol Specification, Testing and Verification XI, North-Holland, 1991, pp. 3–18
Valmari, A. & Tienari, M.: Compositional Failure-based Semantic Models for Basic LOTOS, A manuscript submitted for publication, 1992, 30 p.
Walker, D.: Bisimulation Equivalence and Divergence in CCS, University of Edinburgh, LFCS Report Series ECS-LFCS-87-29, 1987
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaivola, R., Valmari, A. (1992). The weakest compositional semantic equivalence preserving nexttime-less linear temporal logic. In: Cleaveland, W. (eds) CONCUR '92. CONCUR 1992. Lecture Notes in Computer Science, vol 630. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0084793
Download citation
DOI: https://doi.org/10.1007/BFb0084793
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55822-4
Online ISBN: 978-3-540-47293-3
eBook Packages: Springer Book Archive