A Complete Axiomatic Semantics for the CSP Stable-Failures Model
From MaRDI portal
Publication:5756603
DOI10.1007/11817949_11zbMath1151.68535OpenAlexW1566729015MaRDI QIDQ5756603
Markus Roggenbach, Yoshinao Isobe
Publication date: 4 September 2007
Published in: CONCUR 2006 – Concurrency Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11817949_11
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (3)
On the limits of refinement-testing for model-checking CSP ⋮ CSP-CASL-Prover: A Generic Tool for Process and Data Refinement ⋮ The Stable Revivals Model in CSP-Prover
Uses Software
This page was built for publication: A Complete Axiomatic Semantics for the CSP Stable-Failures Model