scientific article; zbMATH DE number 3997155
From MaRDI portal
Publication:4723291
Recommendations
Cited in
(26)- Automatic construction of CSP programs from sequential non-deterministic programs
- The probe: An addition to communication primitives
- A shared memory algorithm and proof for the generalized alternative construct in CSP
- Control machines: A new model of parallelism for compositional specifications and their effective compilation
- A model of reconfiguration in communicating sequential processes with a notion of transactions
- Arbiters: An exercise in specifying and decomposing asynchronously communicating components
- On an effective hierarchy of communicating processes: Separation principle and testing
- Communicating sequential processes. The first 25 years. Symposium on the occasion of 25 years of CSP, London, UK, July 7--8, 2004. Revised invited papers
- Simulating truly concurrent CSP
- scientific article; zbMATH DE number 3881859 (Why is no real title available?)
- scientific article; zbMATH DE number 3846849 (Why is no real title available?)
- Communicating Sequential Processes for Centralized and Distributed Operating System Design
- SPECIFICATION AND VERIFICATION OF CONURRENT SYSTEMS IN CESAR
- scientific article; zbMATH DE number 3926218 (Why is no real title available?)
- scientific article; zbMATH DE number 3967902 (Why is no real title available?)
- Transaction processing primitives and CSP
- scientific article; zbMATH DE number 4050975 (Why is no real title available?)
- scientific article; zbMATH DE number 4062561 (Why is no real title available?)
- A LISP implementation of the model for ‘communicating sequential processes’
- scientific article; zbMATH DE number 45145 (Why is no real title available?)
- scientific article; zbMATH DE number 1290992 (Why is no real title available?)
- scientific article; zbMATH DE number 1088214 (Why is no real title available?)
- A case study in transformational design of concurrent systems
- Proof principles of CSP -- CSP-prover in practice
- Philosophers May Dine - Definitively!
- Concurrency without toil: A systematic method for parallel program design
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4723291)