Synchronous and asynchronous experiments on processes
Information and Control
Communicating sequential processes
Communicating sequential processes
Introduction to the ISO specification language LOTOS
Computer Networks and ISDN Systems - Special Issue: Protocol Specification and Testing
Communication and concurrency
Failures semantics and deadlocking of modular Petri nets
Acta Informatica
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
Strong fairness and full abstraction for communicating processes
Information and Computation
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
A Hierarchy of Equivalences for Asynchronous Calculi
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Weakest-Congruence Results for Livelock-Preserving Equivalences
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Liveness and Fairness in Process-Algebraic Verification
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
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
The Three Platonic Models of Divergence-Strict CSP
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
All linear-time congruences for familiar operators part 2: infinite LTSs
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
| Hi-index | 0.00 |
In process algebras the weakest congruences that preserve interesting properties of systems are of theoretical and practical importance. A system can stop executing visible actions in two ways: by deadlocking or livelocking. The weakest deadlock-preserving congruence was published in [20]. The weakest livelock-preserving congruence and the weakest congruence that preserves all traces of visible actions leading to a livelock were published in [17]. In this paper we will equate deadlock and livelock. We introduce the weakest congruence that preserves the predicate "any-lock" which distinguishes those systems that can stop executing visible actions from those that cannot. We also present the weakest congruence that preserves all traces after which the system can stop executing visible actions. Finally, we give two simple weakest-congruence characterisations for the CSP failures-divergences equivalence, one of which is a minimal characterisation in a well-defined sense. However, we also show that there is no minimum (least) characterisation.