Communicating sequential processes
Communicating sequential processes
The mutual exclusion problem: part I—a theory of interprocess communication
Journal of the ACM (JACM)
Petri net models for algebraic theories of concurrency
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Introduction to the ISO specification language LOTOS
Computer Networks and ISDN Systems - Special Issue: Protocol Specification and Testing
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Process algebra
Towards action-refinement in process algebras
Information and Computation
Adding action refinement to a finite process algebra
Information and Computation
Split and ST bisimulation semantics
Information and Computation
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
The difference between splitting in n and n + 1
Information and Computation
Refinement with global equivalence proofs in temporal logic
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
Communication and Concurrency
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Information and Computation
The Complete Axiomatization of Cs-congruence
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Refining Interfaces of Communicating Systems
TAPSOFT '91 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advances in Distributed Computing (ADC) and Colloquium on Combining Paradigms for Software Developmemnt (CCPSD)
Multiway Synchrinizaton Verified with Coupled Simulation
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Interface Refinement in Reactive Systems (Extended Abstract)
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Non-atomic refinement in z and CSP
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
| Hi-index | 0.00 |
The question we consider in this paper is: "When can a combination of fine-grain execution steps be contracted into an atomic action execution"? Our answer is basically: "When no observer can see the difference." This is worked out in detail by defining a notion of coupled split/atomic simulation refinement between systems which differ in the atomicity of their actions, and proving that this collapses to Parrow and Sjödin's coupled similarity when the systems are composed with an observer.