A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Extensional equivalence for transition systems
Acta Informatica
Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Proving entailment between conceptual state specifications
Theoretical Computer Science - First European Symposium on Programming, Saarbru:9Aicken, W. Germany, March 17:8
Communication and concurrency
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
Process algebra
The existence of refinement mappings
Theoretical Computer Science
Compositional specification and verification of distributed systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Towards action-refinement in process algebras
Information and Computation
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Information and Computation
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)
An Improved Failures Model for Communicating Processes
Seminar on Concurrency, Carnegie-Mellon University
Trace-Based Compositional Reasoning about Fault Tolerant Systems
PARLE '93 Proceedings of the 5th International PARLE Conference on Parallel Architectures and Languages Europe
Implementing Communicating Processes in the Event of Interface Difference
ACSD '01 Proceedings of the Second International Conference on Application of Concurrency to System Design
A model of behaviour abstraction for communicating processes
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
| Hi-index | 0.00 |
We investigate the notion that a system is an acceptable implementation of another base or target system, in the case that the two systems (or processes) have different interfaces. For instance, the base processes can be thought of as specifications, or ideal processes operating in an error-free environment, while the implementations model their actual realisations, operating in an error-prone environment and possibly employing a variety of fault-tolerant techniques. Using the CSP model, we relate implementations and base systems in terms of their observable behaviours. We obtain two fundamental results, viz. realisability and compositionality. The former ensures that implementations may be put to good use, while the latter guarantees that a target composed of several connected subsystems may be implemented by connecting their respective implementations.