The Three Platonic Models of Divergence-Strict CSP

DOI10.1007/978-3-540-85762-4_3MaRDI QIDQ5505592zbMATH OpenOpenAlexFDO

Authors A. W. Roscoe

Publication date 27 January 2009

Published in Theoretical Aspects of Computing - ICTAC 2008 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85762-4_3

zbMATH Keywords

process algebra

Mathematics Subject Classification ID

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

Recommendations

• Communicating Sequential Processes. The First 25 Years
• Revivals, stuckness and the hierarchy of CSP models
• A branching time model of CSP
• An Alternative Order for the Failures Model
• Unbounded nondeterminism in CSP

Cited in

(4)

• A semantics for behavior trees using CSP with specification commands
• Communicating Sequential Processes. The First 25 Years
• Revivals, stuckness and the hierarchy of CSP models
• Failure-divergence semantics and refinement of long running transactions

This page was built for publication: The Three Platonic Models of Divergence-Strict CSP

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