On Two Dually Nondeterministic Refinement Algebras

DOI10.1007/11828563_25zbMath1134.68353OpenAlexW1505969333MaRDI QIDQ5459194

Kim Solin

Publication date: 24 April 2008

Published in: Relations and Kleene Algebra in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11828563_25

Mathematics Subject Classification ID

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

Related Items (8)

Abstract representation theorems for demonic refinement algebras ⋮ On the Structure of Demonic Refinement Algebras with Enabledness and Termination ⋮ Reactive Probabilistic Programs and Refinement Algebra ⋮ Probabilistic Choice in Refinement Algebra ⋮ Enabledness and termination in refinement algebra ⋮ Modelling higher-order dual nondeterminacy ⋮ Dual choice and iteration in an abstract algebra of action ⋮ Refinement algebra for probabilistic programs

This page was built for publication: On Two Dually Nondeterministic Refinement Algebras