A hierarchy of failures-based models: theory and application

DOI10.1016/j.tcs.2004.10.004zbMath1078.68104OpenAlexW2093917590MaRDI QIDQ1763727

Christie Bolton, Gavin Lowe

Publication date: 22 February 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.10.004

zbMATH Keywords

CSPProcess algebraAutomatic verificationSemantic modelsStable failures

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

On using data abstractions for model checking refinements ⋮ Relational concurrent refinement. II: Internal operations and outputs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Specification-oriented semantics for communicating processes
• Extensional equivalences for transition systems
• A calculus of communicating systems
• Testing equivalences for processes
• Checking noninterference in timed CSP
• A singleton failures semantics for communicating sequential processes
• The expressiveness of CSP with priority
• “Sometimes” and “not never” revisited
• Data Refinement

This page was built for publication: A hierarchy of failures-based models: theory and application