Communicating sequential processes
Communicating sequential processes
Algebraic theory of processes
Process algebra
Refinement in Z and object-Z: foundations and advanced applications
Refinement in Z and object-Z: foundations and advanced applications
Communication and Concurrency
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
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
The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear temporal Logic
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
A Semantic Integration of Object-Z and CSP for the Specification of Concurrent Systems
FME '97 Proceedings of the 4th International Symposium of Formal Methods Europe on Industrial Applications and Strengthened Foundations of Formal Methods
Refinement Semantics and Loop Rules
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
Merging State-Based and Action-Based Verification
ACSD '03 Proceedings of the Third International Conference on Application of Concurrency to System Design
A singleton failures semantics for communicating sequential processes
A singleton failures semantics for communicating sequential processes
ASM'03 Proceedings of the abstract state machines 10th international conference on Advances in theory and practice
General Refinement, Part One: Interfaces, Determinism and Special Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
The operational definition of observational congruence in CCS and ACP can be split into two parts: one, the definition of an observational semantics (ie abstraction); and two, the definition of a strong congruence. In both cases this “separation of concerns” has been applied with abstraction that is implicitly “fair”. We define a novel (if obvious) observational semantics with no implicit “fairness”. When combining this observational semantics with failure equality the resulting observational semantics is shown to be equal, other than for minor details, to NDFD semantics. We also combine our observational semantics with singleton failure semantics and we establish congruence results for this new observational equality.