The Three Platonic Models of Divergence-Strict CSP

DOI10.1007/978-3-540-85762-4_3zbMath1161.68629OpenAlexW2172048144MaRDI QIDQ5505592

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)

Related Items (3)

A semantics for behavior trees using CSP with specification commands ⋮ Failure-divergence semantics and refinement of long running transactions ⋮ Revivals, stuckness and the hierarchy of CSP models

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