Abstract
A behavioural equivalence is a congruence, if a system is guaranteed to remain equivalent when any one of its component processes is replaced by an equivalent component processes. An equivalence is weaker than another equivalence if the latter makes at least the same distinctions between systems as the former. An equivalence preserves a property, if no equivalence class contains one system that has that property and another system that lacks the property. Congruences that preserve such properties as deadlocks or livelocks are important in automatic verification of systems, and knowledge of the weakest such congruences is useful for designing verification algorithms. A simple denotational characterisation of the weakest deadlock-preserving congruence has been published in 1995. In this article simple characterisations are given to the weakest livelock-preserving congruence, and to the weakest congruence that preserves all livelocking traces. The results are compared to Hoare’s failures-divergences equivalence in the CSP theory.
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
Bergstra, J. A., Klop, J. W. & Olderog, E.-R.: “Failures without Chaos: A New Process Semantics for Fair Abstraction”. Formal Description of Programming Concepts III, North-Holland 1987, pp. 77–103.
Brinksma, E., Rensink, A. & Vogler, W.: “Fair Testing”. Proc. CONCUR’ 95, Concurrency Theory, Lecture Notes in Computer Science 962, Springer-Verlag 1995, pp. 313–327.
Brookes, S. D. & Roscoe, A. W.: “An Improved Failures Model for Communicating Sequential Processes”. Proc. NSF-SERC Seminar on Concurrency, Lecture Notes in Computer Science 197, Springer-Verlag 1985, pp. 281–305.
Hoare, C. A. R.: Communicating Sequential Processes. Prentice-Hall 1985, 256 p.
Kaivola, R. & Valmari, A.: “The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear Temporal Logic”. Proc. CONCUR’ 92, Third International Conference on Concurrency Theory, Lecture Notes in Computer Science 630, Springer-Verlag 1992, pp. 207–221.
Leduc, G.: “Failure-based Congruences, Unfair Divergences and New Testing Theory”. Proc. Protocol Specification, Testing and Verification, XIV, Chapman & Hall, London (1995), pp. 252–267.
Manna, Z. & Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems, Volume I: Specification. Springer-Verlag 1992, 427 p.
Milner, R.: Communication and Concurrency. Prentice-Hall 1989, 260 p.
Roscoe, A. W.: The Theory and Practice of Concurrency.Prentice-Hall 1998, 565 p.
Valmari, A.: “The Weakest Deadlock-Preserving Congruence”. Information Processing Letters 53 (1995) 341–346.
Valmari, A.: “Failure-based Equivalences Are Faster Than Many Believe”. Proc. Structures in Concurrency Theory 1995, Springer-Verlag “Workshops in Computing” series, 1995, pp. 326–340.
Valmari, A.: “The State Explosion Problem”. Lectures on Petri Nets I: Basic Models, Lecture Notes in Computer Science 1491, Springer-Verlag 1998, pp. 429–528.
Valmari, A. & Tienari, M.: “Compositional Failure-Based Semantic Models for Basic LOTOS”. Formal Aspects of Computing (1995) 7: 440–468.
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
Puhakka, A., Valmari, A. (1999). Weakest-Congruence Results for Livelock-Preserving Equivalences. In: Baeten, J.C.M., Mauw, S. (eds) CONCUR’99 Concurrency Theory. CONCUR 1999. Lecture Notes in Computer Science, vol 1664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48320-9_35
Download citation
DOI: https://doi.org/10.1007/3-540-48320-9_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66425-3
Online ISBN: 978-3-540-48320-5
eBook Packages: Springer Book Archive