Abstract
We propose axioms for Kleene modules (KM). These structures have a Kleene algebra and a Boolean algebra as sorts. The scalar products are mappings from the Kleene algebra and the Boolean algebra into the Boolean algebra that arise as algebraic abstractions of relational image and preimage operations. KM is the basis of algebraic variants of dynamic logics. We develop a calculus for KM and discuss its relation to Kleene algebra with domain and to dynamic and test algebras. As an example, we apply KM to the reachability analysis in digraphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Backhouse, R.C., van den Eijnde, J.P.H.W., van Gasteren, A.J.M.: Calculating path algorithms. Science of Computer Programming 22(1-2), 3–19 (1994)
Brink, C.: Boolean modules. Journal of Algebra 71, 291–313 (1981)
Brunn, T., Möller, B., Russling, M.: Layered graph traversals and hamiltonian path problems–an algebraic approach. In: Jeuring, J. (ed.) MPC 1998. LNCS, vol. 1422, pp. 96–121. Springer, Heidelberg (1998)
Clenaghan, K.: Calculational graph algorithmics: Reconciling two approaches with dynamic algebra. Technical Report CS-R9518, CWI, Amsterdam (1994)
Conway, J.H.: Regular Algebra and Finite State Machines. Chapman&Hall, Sydney (1971)
Desharnais, J., Möller, B., Struth, G.: Kleene algebra with domain. Technical Report 2003-07, Institut für Informatik, Universität Augsburg (2003)
Ehm, T.: Pointer Kleene algebra. Technical Report 2003-13, Institut für Informatik, Universität Augsburg (2003)
Ehm, T., Möller, B., Struth, G.: Kleene modules. Technical Report 2003-10, Institut für Informatik, Universität Augsburg (2003)
Harel, D., Kozen, D., Tiuryn, J.: AustraliaDynamic Logic. MIT Press, Cambridge (2000)
Hollenberg, M.: Equational axioms of test algebra. In: Nielsen, M. (ed.) CSL 1997. LNCS, vol. 1414, pp. 295–310. Springer, Heidelberg (1998)
Jacobson, N.: Basic Algebra, vol. I, II. Freeman, New York (1985)
Kozen, D.: A representation theorem for ∗-free PDL. Technical Report RC7864, IBM (1979)
Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation 110(2), 366–390 (1994)
Kozen, D.: Kleene algebra with tests. Trans. Programming Languages and Systems 19(3), 427–443 (1997)
Leiß, H.: Kleenean semimodules and linear languages. In: Zoltán Ésik and Anna Ingólfsdóttir, editors, FICS’02 Preliminary Proceedings, number NS-02-2 in BRICS Notes Series, pp. 51–53. Univ. of Aarhus (2002)
Möller, B., Struth, G.: Greedy-like algorithms in Kleene algebra. In: Berghammer, R., Möller, B., Struth, G. (eds.) RelMiCS 2003. LNCS, vol. 3051, Springer, Heidelberg (2004)
Németi, I.: Dynamic algebras of programs. In: Gecseg, F. (ed.) FCT 1981. LNCS, vol. 117, pp. 281–291. Springer, Heidelberg (1981)
Pratt, V.: Dynamic logic as a well-behaved fragment of relation algebras. In: Bergman, C.H., Pigozzi, D.L., Maddux, R.D. (eds.) Algebraic Logic and Universal Algebra in Computer Science. LNCS, vol. 425, pp. 77–110. Springer, Heidelberg (1990)
Pratt, V.: Dynamic algebras: Examples, constructions, applications. Studia Logica 50, 571–605 (1991)
von Karger, B., Berghammer, R., Wolf, A.: Relation-algebraic derivation of spanning tree algorithms. In: Jeuring, J. (ed.) MPC 1998. LNCS, vol. 1422, pp. 23–43. Springer, Heidelberg (1998)
Ravelo, J.N.: Two graph algorithms derived. Acta Informatica 36, 489–510 (1999)
Trnkova, V., Reiterman, J.: Dynamic algebras with tests. J. Comput. System Sci. 35, 229–242 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ehm, T., Möller, B., Struth, G. (2004). Kleene Modules. In: Berghammer, R., Möller, B., Struth, G. (eds) Relational and Kleene-Algebraic Methods in Computer Science. RelMiCS 2003. Lecture Notes in Computer Science, vol 3051. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24771-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-24771-5_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22145-6
Online ISBN: 978-3-540-24771-5
eBook Packages: Springer Book Archive