An Algebraic Approach to Refinement with Fair Choice
From MaRDI portal
Publication:5403463
DOI10.1016/j.entcs.2008.06.004zbMath1283.68256MaRDI QIDQ5403463
Publication date: 26 March 2014
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2008.06.004
68Q60: Specification and verification (program logics, model checking, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fixed-point calculus
- Temporal predicate transformers and fair termination
- Reasoning algebraically about loops
- Program refinement in fair transition systems
- Refinement of fair action systems
- Stepwise development of fair distributed systems
- Action systems, unbounded nondeterminism, and infinite traces
- Refinement Calculus