Skip to main content
SpringerLink
Log in

Lazy Kleene Algebra

  • Conference paper
Mathematics of Program Construction (MPC 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3125))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Back, R., von Wright, J.: Refinement calculus – a systematic introduction. Springer, Heidelberg (1998)

    MATH  Google Scholar 

  2. Backhouse, R.C., et al.: Fixed point calculus. Inform. Proc. Letters 53, 131–136 (1995)

    Article  MathSciNet  Google Scholar 

  3. Bergstra, J.A., Bethke, I., Ponse, A.: Process algebra with iteration and nesting. The Computer Journal 37(4), 243–258 (1994)

    Article  Google Scholar 

  4. Cohen, E.: Separation and reduction. In: Backhouse, R., Oliveira, J.N. (eds.) MPC 2000. LNCS, vol. 1837, pp. 45–59. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  5. Conway, J.H.: Regular algebra and finite machines. Chapman and Hall, London (1971)

    MATH  Google Scholar 

  6. Desharnais, J., Möller, B., Struth, G.: Kleene algebra with domain. Technical Report 2003-07, Universität Augsburg, Institut für Informatik (June 2003)

    Google Scholar 

  7. Desharnais, J., Möller, B., Struth, G.: Termination in modal Kleene algebra. Technical Report 2004-04, Universität Augsburg, Institut für Informatik (January 2004), Revised version: Proc. IFIP World Computer Congress 2004, Toulouse, August 22–27, 2004, Subconference TCS-Logic (to appear)

    Google Scholar 

  8. Dijkstra, R.M.: Computation calculus – bridging a formalization gap. In: Jeuring, J. (ed.) MPC 1998. LNCS, vol. 1422, pp. 151–174. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  9. Dijkstra, R.M.: Computation calculus bridging a formalization gap. Science of Computer Programming 37, 3–36 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  10. Elgot, C.C.: Matricial theories. Journal of Algebra 42, 391–422 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  11. von Karger, B., Hoare, C.A.R.: Sequential calculus. Information Processing Letters 53, 123–130 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  12. Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation 110(2), 366–390 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  13. Kozen, D.: Kleene algebras with tests. ACM TOPLAS 19, 427–443 (1997)

    Article  Google Scholar 

  14. Kozen, D.: Kleene Algebra with Tests and the Static Analysis of Programs. Cornell University, Department of Computer Science, Technical Report TR2003-1915 (2003)

    Google Scholar 

  15. Lukkien, J.J.: An operational semantics for the guarded command language. In: Bird, R.S., Woodcock, J.C.P., Morgan, C.C. (eds.) MPC 1992. LNCS, vol. 669, pp. 233–249. Springer, Heidelberg (1993)

    Google Scholar 

  16. Lukkien, J.J.: Operational semantics and generalized weakest preconditions. Science of Computer Programming 22, 137–155 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  17. Möller, B.: Ideal stream algebra. In: Möller, B., Tucker, J.V. (eds.) NADA 1997. LNCS, vol. 1546, pp. 69–116. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  18. Möller, B., Struth, G.: Modal Kleene algebra and partial correctness. Technical Report 2003-08, Universität Augsburg, Institut für Informatik (May 2003), Revised version: Proc. AMAST 2004, Stirling, July 12–16, 2004 (to appear)

    Google Scholar 

  19. Rosenthal, K.I.: Quantales and their applications. Pitman Research Notes in Mathematics Series, vol. 234. Longman Scientific&Technical (1990)

    Google Scholar 

  20. Staiger, L.: Omega languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of formal languages, vol. 3, pp. 339–387. Springer, Heidelberg (1997)

    Google Scholar 

  21. von Wright, J.: From Kleene algebra to refinement algebra. In: Boiten, E.A., Möller, B. (eds.) MPC 2002. LNCS, vol. 2386, pp. 233–262. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  22. von Wright, J.: Towards a refinement algebra. Science of Computer Programming 51, 23–45 (2004)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Augsburg, Universitätsstr. 14, D-86135, Augsburg, Germany

    Bernhard Möller

Authors
  1. Bernhard Möller
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Cornell University, 14853-7501, Ithaca, New York, USA

    Dexter Kozen

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Möller, B. (2004). Lazy Kleene Algebra. In: Kozen, D. (eds) Mathematics of Program Construction. MPC 2004. Lecture Notes in Computer Science, vol 3125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27764-4_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27764-4_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22380-1

  • Online ISBN: 978-3-540-27764-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation