Algebraic reasoning for probabilistic action systems and while-loops
From MaRDI portal
Publication:938297
DOI10.1007/s00236-008-0073-4zbMath1161.68014OpenAlexW2104717253MaRDI QIDQ938297
Ian J. Hayes, Larissa A. Meinicke
Publication date: 19 August 2008
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-008-0073-4
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reasoning about real-time repetitions: Terminating and nonterminating
- Reasoning algebraically about loops
- Towards a refinement algebra
- Superposition refinement of reactive systems
- Refinement Algebra with Operators for Enabledness and Termination
- Distributed cooperation with action systems
- Refinement Calculus
- Abstraction, Refinement and Proof for Probabilistic Systems
- Mathematics of Program Construction
- Towards Automated Proof Support for Probabilistic Distributed Systems
- Using Probabilistic Kleene Algebra for Protocol Verification
- FM 2005: Formal Methods
- Demonic, angelic and unbounded probabilistic choices in sequential programs