A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
A theory for nondeterminism, parallelism, communication, and concurrency
Theoretical Computer Science
The weakest deadlock-preserving congruence
Information Processing Letters
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Weakest Congruence Results Concerning "Any-Lock"
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
An Improved Failures Equivalence for Finite-State Systems with a Reduction Algorithm
Proceedings of the IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XI
Weakest-Congruence Results for Livelock-Preserving Equivalences
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
A fixpoint theory for non-monotonic parallelism
Theoretical Computer Science
Compositional State Space Reduction Using Untangled Actions
Electronic Notes in Theoretical Computer Science (ENTCS)
On Process-algebraic Verification of Asynchronous Circuits
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
The Three Platonic Models of Divergence-Strict CSP
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Modelling Divergence in Relational Concurrent Refinement
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
On Process-algebraic Verification of Asynchronous Circuits
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
| Hi-index | 0.00 |
A long-standing complaint about the theory of CSP has been that all theories which encompass divergence are divergence-strict, meaning that nothing beyond the first divergence can be seen. In this paper we show that a congruence previously identified as the weakest one to predict divergence over labelled transition systems (LTS's) can be given a non-standard fixed-point theory, which we term reflected fixed points and thereby turned into a full CSP model which is congruent to the operational semantics over LTS's.