Revivals, stuckness and the hierarchy of CSP models

DOI10.1016/j.jlap.2008.10.002zbMath1171.68025OpenAlexW2167354623MaRDI QIDQ1007236

A. W. Roscoe

Publication date: 20 March 2009

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://ora.ox.ac.uk/objects/uuid:bd3c61e5-4d3b-45d6-8812-4f2612c10da5

zbMATH Keywords

full abstractionconcurrencyCSP models

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (6)

Translating between models of concurrency ⋮ On the limits of refinement-testing for model-checking CSP ⋮ Models for CSP with availability information ⋮ Reducing complex CSP models to traces via priority ⋮ Unnamed Item ⋮ On the Unification of Process Semantics: Equational Semantics

Uses Software

• FDR2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Refusal testing
• The fixed point theory of unbounded non-determinism
• Specification-oriented semantics for communicating processes
• A theory for nondeterminism, parallelism, communication, and concurrency
• Statecharts: a visual formalism for complex systems
• Testing equivalences for processes
• Responsiveness of interoperating components
• Responsiveness and stable revivals
• Unbounded Non-determinism in CSP
• The Stable Revivals Model in CSP-Prover
• Confluence Thanks to Extensional Determinism
• An Alternative Order for the Failures Model
• Computer Aided Verification
• The Three Platonic Models of Divergence-Strict CSP
• Communicating Sequential Processes. The First 25 Years

This page was built for publication: Revivals, stuckness and the hierarchy of CSP models