Communicating sequential processes
Communicating sequential processes
Step failures semantics and a complete proof system
Acta Informatica
CSP-OZ: a combination of object-Z and CSP
FMOODS '97 Proceedings of the IFIP TC6 WG6.1 international workshop on Formal methods for open object-based distributed systems
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Bridging CSP and C++ with Selective Formalism and Executable Specifications
MEMOCODE '03 Proceedings of the First ACM and IEEE International Conference on Formal Methods and Models for Co-Design
Probing the Depths of CSP-M: A New fdr-Compliant Validation Tool
ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
A generic theorem prover of CSP refinement
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
CSP as a coordination language
COORDINATION'11 Proceedings of the 13th international conference on Coordination models and languages
| Hi-index | 0.00 |
Process algebras like CSP provide a convenient intermediatelevel formalism for the design of concurrent systems by allowing processes to be combined in parallel in such a way that the designer abstracts synchronization mechanisms and simultaneity of events. However some purposes require potential simultaneity to be made explicit. One approach is to produce new semantics models encapsulating that information. The approach taken here is to use the standard models and the CSP tool, FDR, to simulate a process in such a way to reveal potentially-simultaneous events. The simulation is achieved by a construction that splits events into start and end events and monitors the result in a manner faithful to the original process. The method is applied to determine pairs of possibly concurrent events and to compute maximal simultaneity in a CSP design.