Algebraic reasoning for probabilistic action systems and while-loops

DOI10.1007/s00236-008-0073-4zbMath1161.68014MaRDI 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

zbMATH Keywords

algebraic laws for reasoning

Mathematics Subject Classification ID

68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)

Related Items

Refinement algebra for probabilistic programs, Probabilistic Choice in Refinement Algebra

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