Dual choice and iteration in an abstract algebra of action
From MaRDI portal
Publication:694489
DOI10.1007/s11225-012-9416-9zbMath1280.03039MaRDI QIDQ694489
Publication date: 12 December 2012
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11225-012-9416-9
03B70: Logic in computer science
68Q60: Specification and verification (program logics, model checking, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
03G27: Abstract algebraic logic
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enabledness and termination in refinement algebra
- A sketch of a dynamic epistemic semiring
- Automated verification of refinement laws
- Application of modal logic to programming
- Applying modal logic
- A completeness theorem for Kleene algebras and the algebra of regular events
- Towards a refinement algebra
- Relations and Kleene algebra in computer science. 9th international conference on relational methods in computer science and 4th international workshop on applications of Kleene algebra, RelMiCS/AKA 2006, Manchester, UK, August 29-September 2, 2006. Proceedings
- A lattice-theoretical fixpoint theorem and its applications
- Automated Reasoning in Kleene Algebra
- Refinement Calculus
- Omega Algebra, Demonic Refinement Algebra and Commands
- On Two Dually Nondeterministic Refinement Algebras
- An axiomatic basis for computer programming