Revivals, stuckness and the hierarchy of CSP models
DOI10.1016/J.JLAP.2008.10.002zbMATH Open1171.68025OpenAlexW2167354623MaRDI QIDQ1007236FDOQ1007236
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
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Statecharts: a visual formalism for complex systems
- The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
- A theory for nondeterminism, parallelism, communication, and concurrency
- Testing equivalences for processes
- Unbounded Non-determinism in CSP
- The fixed point theory of unbounded non-determinism
- Confluence Thanks to Extensional Determinism
- Specification-oriented semantics for communicating processes
- Computer Aided Verification
- Responsiveness and stable revivals
- Responsiveness of interoperating components
- The Three Platonic Models of Divergence-Strict CSP
- Refusal testing
- A hierarchy of failures-based models
- The Stable Revivals Model in CSP-Prover
- An Alternative Order for the Failures Model
- Communicating Sequential Processes. The First 25 Years
Cited In (7)
- Title not available (Why is that?)
- On the unification of process semantics: equational semantics
- Translating between models of concurrency
- Reducing complex CSP models to traces via priority
- Models for CSP with availability information
- Process equivalence problems as energy games
- On the limits of refinement-testing for model-checking CSP
Uses Software
Recommendations
- Consistency restoration and explanations in dynamic CSPs---Application to configuration 👍 👎
- A CSP model with flexible parallel termination semantics 👍 👎
- Communicating Sequential Processes. The First 25 Years 👍 👎
- Non-binary quantified CSP: Algorithms and modelling 👍 👎
- A branching time model of CSP 👍 👎
- The Stable Revivals Model in CSP-Prover 👍 👎
- Retracing CSP 👍 👎
This page was built for publication: Revivals, stuckness and the hierarchy of CSP models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007236)
