Lazy Kleene Algebra

@inproceedings{Mller2004LazyKA,
  title={Lazy Kleene Algebra},
  author={Bernhard M{\"o}ller},
  booktitle={MPC},
  year={2004}
}
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 predicate transformers form lazy Kleene algebras again, the disjunctive and conjunctive ones even lazy Kleene algebras with an omega operation. 

Citations

Publications citing this paper.
Showing 1-10 of 25 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 31 references

Computation calculus bridging a formalization gap

Sci. Comput. Program. • 2000
View 7 Excerpts
Highly Influenced

Kleene algebra with domain

ACM Trans. Comput. Log. • 2006
View 5 Excerpts

Struth : Termination in modal Kleene algebra

B. Möller J. Desharnais, G.
Technical Report • 2004

Struth : Kleene algebra with domain

J. Desharnais, B. Möller, G.
Technical Report • 2003

Struth : Modal Kleene algebra and partial correctness

I. K.
Tech - nical Report • 2003

Separation and Reduction

MPC • 2000
View 2 Excerpts

Similar Papers

Loading similar papers…