Revivals, stuckness and the hierarchy of CSP models

DOI10.1016/J.JLAP.2008.10.002MaRDI QIDQ1007236zbMATH OpenOpenAlexFDO

Authors 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

concurrencyfull abstractionCSP 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)

Recommendations

• The stable revivals model in CSP-Prover
• Communicating Sequential Processes. The First 25 Years
• Retracing CSP
• A branching time model of CSP
• Non-binary quantified CSP: Algorithms and modelling
• A CSP model with flexible parallel termination semantics
• Consistency restoration and explanations in dynamic CSPs---Application to configuration

Cites work

• scientific article; zbMATH DE number 3902016 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 17696 (Why is no real title available?)
• scientific article; zbMATH DE number 1361140 (Why is no real title available?)
• scientific article; zbMATH DE number 2242598 (Why is no real title available?)
• A hierarchy of failures-based models
• A theory for nondeterminism, parallelism, communication, and concurrency
• An Alternative Order for the Failures Model
• Communicating Sequential Processes. The First 25 Years
• Computer Aided Verification
• Confluence thanks to extensional determinism
• Refusal testing
• Responsiveness and stable revivals
• Responsiveness of interoperating components
• Specification-oriented semantics for communicating processes
• Statecharts: a visual formalism for complex systems
• Testing equivalences for processes
• The Three Platonic Models of Divergence-Strict CSP
• The fixed point theory of unbounded non-determinism
• The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
• The stable revivals model in CSP-Prover
• Unbounded Non-determinism in CSP

Cited in

(10)

• Models for CSP with availability information
• Models for CSP with availability information
• The stable revivals model in CSP-Prover
• Translating between models of concurrency
• On the limits of refinement-testing for model-checking CSP
• scientific article; zbMATH DE number 7577583 (Why is no real title available?)
• Process equivalence problems as energy games
• On the unification of process semantics: equational semantics
• Reducing complex CSP models to traces via priority
• The Three Platonic Models of Divergence-Strict CSP

Describes a project that uses

Uses Software

• FDR2

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)