Abstract
AbstractThe motivation for using demonic calculus for binary relations stems from the behaviour of demonic turing machines, when modelled relationally. Relational composition (; ) models sequential runs of two programs and demonic refinement ($$\sqsubseteq $$
⊑
) arises from the partial order given by modeling demonic choice ($$\sqcup $$
⊔
) of programs (see below for the formal relational definitions). We prove that the class $$R(\sqsubseteq , ;)$$
R
(
⊑
,
;
)
of abstract $$(\le , \circ )$$
(
≤
,
∘
)
structures isomorphic to a set of binary relations ordered by demonic refinement with composition cannot be axiomatised by any finite set of first-order $$(\le , \circ )$$
(
≤
,
∘
)
formulas. We provide a fairly simple, infinite, recursive axiomatisation that defines $$R(\sqsubseteq , ;)$$
R
(
⊑
,
;
)
. We prove that a finite representable $$(\le , \circ )$$
(
≤
,
∘
)
structure has a representation over a finite base. This appears to be the first example of a signature for binary relations with composition where the representation class is non-finitely axiomatisable, but where the finite representation property holds for finite structures.
Publisher
Springer Science and Business Media LLC
Subject
Algebra and Number Theory
Reference15 articles.
1. Berghammer, R., Zierer, H.: Relational algebraic semantics of deterministic and nondeterministic programs. Theor. Comput. Sci. 43, 123–147 (1986)
2. Bredikhin, D.: Abstract characteristic of some classes of algebras of relations. Algebra Theory Numbers 2, 3–19 (1977). (In Russian)
3. De Carufel, J., Desharnais, J.: Demonic algebra with domain, relations and Kleene algebra in computer science. Lect. Notes Comput. Sci. 4136, 120–134 (2006)
4. De Carufel, J.L., Desharnais, J.: On the structure of demonic refinement algebras with enabledness and termination. In: International conference on relational methods in computer science, pp. 69–83. Springer (2008)
5. Dijkstra, E.W., Scholten, C.S.: Predicate Calculus and Program Semantics. Springer, Berlin, Heidelberg (1990)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献