On the Structure of Demonic Refinement Algebras with Enabledness and Termination

DOI10.1007/978-3-540-78913-0_7zbMath1140.68037OpenAlexW1535252952MaRDI QIDQ3498406

Jules Desharnais, Jean-Lou De Carufel

Publication date: 15 May 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/978-3-540-78913-0_7

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Finite representability of semigroups with demonic refinement ⋮ Latest News about Demonic Algebra with Domain

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Kleene getting lazy
• Relational algebraic semantics of deterministic and nondeterministic programs
• A completeness theorem for Kleene algebras and the algebra of regular events
• Towards a refinement algebra
• Algebraic Notions of Termination
• Latest News about Demonic Algebra with Domain
• Refinement Algebra with Operators for Enabledness and Termination
• A generalized control structure and its formal definition
• Kleene algebra with domain
• Demonic Algebra with Domain
• Omega Algebra, Demonic Refinement Algebra and Commands
• On Two Dually Nondeterministic Refinement Algebras

This page was built for publication: On the Structure of Demonic Refinement Algebras with Enabledness and Termination