Communicating sequential processes
Communicating sequential processes
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Three logics for branching bisimulation
Journal of the ACM (JACM)
The weakest deadlock-preserving congruence
Information Processing Letters
Weakest Congruence Results Concerning "Any-Lock"
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Weakest-Congruence Results for Livelock-Preserving Equivalences
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear temporal Logic
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Understanding Concurrent Systems
Understanding Concurrent Systems
All Linear-Time Congruences for Finite LTSs and Familiar Operators
ACSD '12 Proceedings of the 2012 12th International Conference on Application of Concurrency to System Design
| Hi-index | 0.00 |
In a previous publication, we enumerated all stuttering-insensitive linear-time (in a well-defined sense) congruences with respect to action prefix, hiding, relational renaming, and parallel composition for finite labelled transition systems. There are 20 of them. They are built from the alphabet, traces, two kinds of divergence traces, and five kinds of failures. Now we remove the finiteness assumption. To re-establish the congruence property, four kinds of infinite traces are needed. Some congruences split to two and some to three, yielding altogether 40 congruences. Like its predecessor, because of lack of space, also this publication concentrates on proving the absence of more congruences.