A singleton failures semantics for communicating sequential processes
DOI10.1007/S00165-005-0081-XzbMATH Open1110.68067OpenAlexW2085383457MaRDI QIDQ2432234FDOQ2432234
Authors: Christie Bolton, Jim Davies 
Publication date: 25 October 2006
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00165-005-0081-x
Recommendations
Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (18)
- Title not available (Why is that?)
- Contexts, refinement and determinism
- Reducing complex CSP models to traces via priority
- Verifying data refinements using a model checker
- On using data abstractions for model checking refinements
- Introducing extra operations in refinement
- Relational concurrent refinement. III: Traces, partial relations and automata
- General refinement. I: Interfaces, determinism and special refinement
- Relational concurrent refinement: automata
- Model transformations across views
- Data refinement and singleton failures refinement are not equivalent
- Relational concurrent refinement. II: Internal operations and outputs
- A hierarchy of failures-based models: theory and application
- Title not available (Why is that?)
- More relational concurrent refinement: traces and partial relations
- Generic tools via general refinement
- Temporal-logic property preservation under Z refinement
- Title not available (Why is that?)
This page was built for publication: A singleton failures semantics for communicating sequential processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2432234)
