Communicating sequential processes
Communicating sequential processes
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
The weakest deadlock-preserving congruence
Information Processing Letters
Failure-based congruences, unfair divergences and new testing theory
PSTV '94 Proceedings of the fourteenth of a series of annual meetings on Protocol specification, testing and verification XIV
Communication and Concurrency
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
An Improved Failures Model for Communicating Processes
Seminar on Concurrency, Carnegie-Mellon University
The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear temporal Logic
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Weakest Congruence Results Concerning "Any-Lock"
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
A Semantic Theory for Heterogeneous System Design
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
MC-SOG: An LTL Model Checker Based on Symbolic Observation Graphs
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Modelling Divergence in Relational Concurrent Refinement
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
Guaranteeing Weak Termination in Service Discovery
Fundamenta Informaticae - Application of Concurrency to System Design, the Eighth Special Issue
All linear-time congruences for familiar operators part 2: infinite LTSs
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
A counterexample-based incremental and modular verification approach
Proceedings of the 17th Monterey conference on Large-Scale Complex IT Systems: development, operation and management
| Hi-index | 0.00 |
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.