CSP is a retract of CCS
From MaRDI portal
Publication:960852
DOI10.1016/j.tcs.2009.12.012zbMath1191.68439OpenAlexW2167972869MaRDI QIDQ960852
Publication date: 29 March 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.12.012
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (3)
Translation of CCS into CSP, correct up to strong bisimulation ⋮ Jifeng He at Oxford and beyond: an appreciation ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Observation equivalence as a testing equivalence
- Verified software: Theories, tools, experiments. First IFIP TC 2/WG 2.3 conference, VSTTE 2005, Zurich, Switzerland, October 10--13, 2005. Revised selected papers and discussions
- Algebra of communicating processes with abstraction
- Bisimulation through probabilistic testing
- Structured operational semantics and bisimulation as a congruence
- Notes on the methodology of CCS and CSP
- Power simulation and its relation to traces and failures refinement
- Testing equivalence as a bisimulation equivalence
- Responsiveness and stable revivals
- A Theory of Communicating Sequential Processes
- Algebraic laws for nondeterminism and concurrency
- Data Types as Lattices
- Bisimulation can't be traced
- Barbed bisimulation
- Computer Aided Verification
This page was built for publication: CSP is a retract of CCS