A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Beauty is our business
The Z notation: a reference manual
The Z notation: a reference manual
Using CSP to Detect Errors in the TMN Protocol
IEEE Transactions on Software Engineering
The timed failures-stability model for CSP
Theoretical Computer Science
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Verifying End-to-End Protocols using Induction with CSP/FDR
Proceedings of the 11 IPPS/SPDP'99 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Refinement of State-Based Concurrent Systems
VDM '90 Proceedings of the Third International Symposium of VDM Europe on VDM and Z - Formal Methods in Software Development
csp2B: A Practical Approach to Combining CSP and B
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Using a Process Algebra to Control B Operations
IFM '99 Proceedings of the 1st International Conference on Integrated Formal Methods
Deductive Reasoning versus Model Checking: Two Formal Approaches for System Development
IFM '99 Proceedings of the 1st International Conference on Integrated Formal Methods
Decentralization of process nets with centralized control
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
A hierarchy of failures-based models: theory and application
Theoretical Computer Science - Expressiveness in concurrency
Machine-Verifiable Responsiveness
Electronic Notes in Theoretical Computer Science (ENTCS)
On the automatic verification of non-standard measures of consistency
IWFM'03 Proceedings of the 6th international conference on Formal Methods
| Hi-index | 0.00 |
We present a formal framework for characterising plug-in relationships between component specifications. A suitability requirement is defined based on the effect one component has on the other in terms of deadlock. Unlike monotonic operations such as parallel composition, not all such suitability requirements are preserved by refinement. Hence, we define the notion of a bicompositional relation between co-operating processes which is preserved by component-wise refinements. The approach is described in CSP using the failures semantic model. The aim is to underpin a mixed-paradigm approach combining different specification methods, including state-based deductive formalisms such as Action Systems, and event-based model checking formalisms such as CSP/FDR. The objective is to play to the strengths and overcome limitations of each technique, by treating different system aspects with individual tools and notations which are most appropriate.