Dual choice and iteration in an abstract algebra of action
From MaRDI portal
(Redirected from Publication:694489)
Recommendations
Cites work
- scientific article; zbMATH DE number 1612485 (Why is no real title available?)
- scientific article; zbMATH DE number 3574936 (Why is no real title available?)
- scientific article; zbMATH DE number 1086671 (Why is no real title available?)
- scientific article; zbMATH DE number 1487497 (Why is no real title available?)
- scientific article; zbMATH DE number 789390 (Why is no real title available?)
- A completeness theorem for Kleene algebras and the algebra of regular events
- A lattice-theoretical fixpoint theorem and its applications
- A sketch of a dynamic epistemic semiring
- An axiomatic basis for computer programming
- Application of modal logic to programming
- Applying modal logic
- Automated Reasoning in Kleene Algebra
- Automated verification of refinement laws
- Enabledness and termination in refinement algebra
- Omega Algebra, Demonic Refinement Algebra and Commands
- On Two Dually Nondeterministic Refinement Algebras
- Refinement Calculus
- 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
- Towards a refinement algebra
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)