We propose a relaxation of Kleene algebra by giving up strictness and right-distributivity of composition. This allows the subsumption of Dijkstra's computation calculus, Cohen's omega algebra and von Wright's demonic refinement algebra. Moreover, by adding domain and codomain operators we can also incorporate modal operators. Finally, it is shown that the predicate transformers form lazy Kleene algebras again, the disjunctive and conjunctive ones even lazy Kleene algebras with an omega operation
Modal Kleene algebras are Kleene algebras enriched by forward and backward box and diamond operators...
We propose axioms for Kleene modules (KM). These structures have a Kleene algebra and a Boolean alge...
Modal Kleene algebra is Kleene algebra enriched by forward and backward box and diamond operators. W...
We propose a relaxation of Kleene algebra by giving up strictness and right-distributivity of compos...
We propose a relaxation of Kleene algebra by giving up strictness and right-distributivity of compos...
We propose a relaxation of Kleene algebra by giving up strictness and right-distributivity of compos...
We propose a relaxation of Kleene algebra by giving up strictness and right-distributivity of compos...
We propose a relaxation of Kleene algebra by giving up strictness and right-distributivity of compos...
We propose a relaxation of Kleene algebra by giving up strictness and right-distributivity of compos...
We propose a relaxation of Kleene algebra by giving up strictness and right-distributivity of compos...
Kleene algebras provide a convenient and powerful algebraic axiomatisation of a complete lattice tha...
Kleene algebras provide a convenient and powerful algebraic axiomatisation of a complete lattice tha...
Kleene algebras provide a convenient and powerful algebraic axiomatisation of a complete lattice tha...
This study provides an algebraic background for the formal derivation of greedy-like algorithms. We ...
This paper provides an algebraic background for the formal derivation of greedy-like algorithms. Suc...
Modal Kleene algebras are Kleene algebras enriched by forward and backward box and diamond operators...
We propose axioms for Kleene modules (KM). These structures have a Kleene algebra and a Boolean alge...
Modal Kleene algebra is Kleene algebra enriched by forward and backward box and diamond operators. W...
We propose a relaxation of Kleene algebra by giving up strictness and right-distributivity of compos...
We propose a relaxation of Kleene algebra by giving up strictness and right-distributivity of compos...
We propose a relaxation of Kleene algebra by giving up strictness and right-distributivity of compos...
We propose a relaxation of Kleene algebra by giving up strictness and right-distributivity of compos...
We propose a relaxation of Kleene algebra by giving up strictness and right-distributivity of compos...
We propose a relaxation of Kleene algebra by giving up strictness and right-distributivity of compos...
We propose a relaxation of Kleene algebra by giving up strictness and right-distributivity of compos...
Kleene algebras provide a convenient and powerful algebraic axiomatisation of a complete lattice tha...
Kleene algebras provide a convenient and powerful algebraic axiomatisation of a complete lattice tha...
Kleene algebras provide a convenient and powerful algebraic axiomatisation of a complete lattice tha...
This study provides an algebraic background for the formal derivation of greedy-like algorithms. We ...
This paper provides an algebraic background for the formal derivation of greedy-like algorithms. Suc...
Modal Kleene algebras are Kleene algebras enriched by forward and backward box and diamond operators...
We propose axioms for Kleene modules (KM). These structures have a Kleene algebra and a Boolean alge...
Modal Kleene algebra is Kleene algebra enriched by forward and backward box and diamond operators. W...