Demonic Algebra with Domain

We first recall the concept of Kleene algebra with domain (KAD). Then we explain how to use the operators of KAD to define a demonic refinement ordering and demonic operators (many of these definitions come from the literature). Then, taking the properties of the KAD-based demonic operators as a guideline, we axiomatise an algebra that we call Demonic algebra with domain (DAD). The laws of DAD not concerning the domain operator agree with those given in the 1987 CACM paper Laws of programming by Hoare et al. Finally, we investigate the relationship between demonic algebras with domain and KAD-based demonic algebras. The question is whether every DAD is isomorphic to a KAD-based demonic algebra. We show that it is not the case in general. However, if a DAD $\mathcal{D}$ is isomorphic to a demonic algebra based on a KAD $\mathcal{K}$, then it is possible to construct a KAD isomorphic to $\mathcal{K}$ using the operators of $\mathcal{D}$. We also describe a few open problems.

[1]  Jules Desharnais,et al.  Embedding a demonic semilattice in a relation algebra , 1995 .

[2]  Dexter Kozen.  A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events , 1994, Inf. Comput..

[3]  J. Conway.  Regular algebra and finite machines , 1971 .

[4]  Rudolf Berghammer,et al.  Relational Algebraic Semantics of Deterministic and Nondeterministic Programs , 1986, Theor. Comput. Sci..

[5]  Dexter Kozen,et al.  Kleene algebra with tests , 1997, TOPL.

[6]  Jules Desharnais,et al.  Modal Kleene algebra and applications - a survey , 2004 .

[7]  Jules Desharnais,et al.  Refinement and Demonic Semantics , 1997, Relational Methods in Computer Science.

[8]  Roland Carl Backhouse,et al.  Demonic operators and monotype factors , 1993, Mathematical Structures in Computer Science.

[9]  Joakim von Wright,et al.  Towards a refinement algebra , 2004, Sci. Comput. Program..

[10]  Wolfram Kahl.  Parallel composition and decomposition of specifications , 2001, Inf. Sci..

[11]  Jules Desharnais,et al.  Characterizing determinacy in Kleene algebras , 2001, Inf. Sci..

[12]  J. McCarthy.  A basis for a mathematical theory of computation, preliminary report , 1961, IRE-AIEE-ACM '61 (Western).

[13]  Joakim von Wright,et al.  Refinement Algebra with Operators for Enabledness and Termination , 2006, MPC.

[14]  C. A. R. Hoare,et al.  Laws of programming , 1987, CACM.

[15]  Ernie Cohen,et al.  Separation and Reduction , 2000, MPC.

[16]  Jules Desharnais,et al.  Kleene under a modal demonic star , 2006, J. Log. Algebraic Methods Program..

[17]  John McCarthy,et al.  A basis for a mathematical theory of computation, preliminary report , 1899, IRE-AIEE-ACM '61 (Western).

[18]  Jules Desharnais,et al.  Kleene under a Demonic Star , 2000, AMAST.

[19]  Bernhard Möller,et al.  Lazy Kleene Algebra , 2004, MPC.

[20]  J. Desharnais,et al.  Applying a generalization of a theorem of Mills to generalized looping structures , 1999, Proceedings. Science and Engineering for Software Development: A Recognition of Harlin D. Mills Legacy (Cat. No. PR00010).

[21]  Bernhard Möller,et al.  Omega Algebra, Demonic Refinement Algebra and Commands , 2006, RelMiCS.

[22]  Georg Struth,et al.  Kleene algebra with domain , 2003, TOCL.

[23]  Roger D. Maddux,et al.  Relation-Algebraic Semantics , 1996, Theor. Comput. Sci..

[24]  Gunther Schmidt,et al.  Relational Methods in Computer Science , 1999, Inf. Sci..

[25]  Dexter Kozen,et al.  On Kleene Algebras and Closed Semirings , 1990, MFCS.