Simulating truly concurrent CSP

DOI10.1007/978-3-642-19829-8_9MaRDI QIDQ2999314zbMATH OpenOpenAlexFDO

Authors

Publication date 12 May 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-19829-8_9

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 4094831
• scientific article; zbMATH DE number 3997155
• Understanding concurrent systems
• FM 2005: Formal Methods
• Capturing Conflict and Confusion in CSP

Cites work

• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• Simulating truly concurrent CSP
• Step failures semantics and a complete proof system
• Tools and Algorithms for the Construction and Analysis of Systems

Cited in

(4)

• Simulating truly concurrent CSP
• Simulation-Based Concurrent Non-malleable Commitments and Decommitments
• Implementations of the CSP Notation for Concurrent Systems
• scientific article; zbMATH DE number 4094831 (Why is no real title available?)

Describes a project that uses

Uses Software

• CSP-prover
• FDR2

This page was built for publication: Simulating truly concurrent CSP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999314)