Dual choice and iteration in an abstract algebra of action
DOI10.1007/S11225-012-9416-9zbMATH Open1280.03039OpenAlexW1988459354MaRDI QIDQ694489FDOQ694489
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
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Abstract algebraic logic (03G27)
Cites Work
- A lattice-theoretical fixpoint theorem and its applications
- Title not available (Why is that?)
- Refinement Calculus
- An axiomatic basis for computer programming
- Title not available (Why is that?)
- Automated verification of refinement laws
- A completeness theorem for Kleene algebras and the algebra of regular events
- Towards a refinement algebra
- Title not available (Why is that?)
- Automated Reasoning in Kleene Algebra
- Title not available (Why is that?)
- Enabledness and termination in refinement algebra
- Omega Algebra, Demonic Refinement Algebra and Commands
- On Two Dually Nondeterministic Refinement Algebras
- Application of modal logic to programming
- Applying modal logic
- 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
- Title not available (Why is that?)
- A sketch of a dynamic epistemic semiring
Uses Software
This page was built for publication: Dual choice and iteration in an abstract algebra of action
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q694489)
