Cited By
View all- Sedlár I(2023)Kleene Algebra of Weighted Programs with DomainDynamic Logic. New Trends and Applications10.1007/978-3-031-51777-8_4(52-67)Online publication date: 15-Sep-2023
On the Complexity of Kleene Algebra with Domain
Author: 
Igor SedlárAuthors Info & Claims
Igor SedlárAuthors Info & ClaimsPages 208 - 223
Abstract
We prove that the equational theory of Kleene algebra with domain is EXPTIME-complete. Our proof makes essential use of Hollenberg’s equational axiomatization of program equations valid in relational test algebra. We also show that the equational theory of Kleene algebra with domain coincides with the equational theory of *-continuous Kleene algebra with domain.
References
[1]
Armstrong A, Gomes VBF, and Struth G Building program construction and verification tools from algebraic principles Form. Aspects Comput. 2016 28 2 265-293
[2]
Cohen, E., Kozen, D., Smith, F.: The complexity of Kleene algebra with tests. Technical report TR96-1598, Computer Science Department, Cornell University, July 1996
[3]
Desharnais J, Möller B, and Struth G Kleene algebra with domain ACM Trans. Comput. Log. 2006 7 4 798-833
[4]
Desharnais J and Struth G Audebaud P and Paulin-Mohring C Modal semirings revisited Mathematics of Program Construction 2008 Heidelberg Springer 360-387
[5]
Desharnais, J., Struth, G.: Internal axioms for domain semirings. Sci. Comput. Program. 76(3), 181–203 (2011). Special issue on the Mathematics of Program Construction (MPC 2008)
[6]
Fischer MJ and Ladner RE Propositional dynamic logic of regular programs J. Comput. Syst. Sci. 1979 18 194-211
[7]
Groenendijk J and Stokhof M Dynamic predicate logic Linguist. Philos. 1991 14 1 39-100
[8]
Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press, Cambridge (2000)
[9]
Hirsch R and Mikulás S Axiomatizability of representable domain algebras J. Log. Algebr. Program. 2011 80 2 75-91
[10]
Hollenberg M Nielsen M and Thomas W Equational axioms of test algebra Computer Science Logic 1998 Heidelberg Springer 295-310
[11]
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley Publishing Company, Boston (1979)
[12]
Kozen D de Bakker J and van Leeuwen J A representation theorem for models of *-free PDL Automata, Languages and Programming 1980 Heidelberg Springer 351-362
[13]
Kozen D Rovan B On Kleene algebras and closed semirings Mathematical Foundations of Computer Science 1990 1990 Heidelberg Springer 26-47
[14]
Kozen, D.: The Design and Analysis of Algorithms. Springer, New York (1992).
[15]
Kozen D A completeness theorem for Kleene algebras and the algebra of regular events Inf. Comput. 1994 110 2 366-390
[16]
Kozen D Kleene algebra with tests ACM Trans. Program. Lang. Syst. 1997 19 3 427-443
[17]
Kozen D and Parikh R An elementary proof of the completeness of PDL Theor. Comput. Sci. 1981 14 113-118
[18]
Kozen D and Smith F van Dalen D and Bezem M Kleene algebra with tests: completeness and decidability Computer Science Logic 1997 Heidelberg Springer 244-259
[19]
Mbacke, S.D.: Completeness for Domain Semirings and Star-continuous Kleene Algebras with Domain. mathesis, Université Laval (2018)
[20]
McLean, B.: Free Kleene algebras with domain. J. Log. Algebr. Methods Program. 117, 100606 (2020)
[21]
Möller, B., Struth, G.: Algebras of modal operators and partial correctness. Theor. Comput. Sci. 351(2):221–239 (2006). Algebraic Methodology and Software Technology
[22]
Pratt V Dynamic algebras: examples, constructions, applications Stud. Log. 1991 50 3 571-605
[23]
Pratt, V.R.: Models of program logics. In: Proceedings of the 20th Annual Symposium on Foundations of Computer Science, FOCS 1979, pp. 115–122. IEEE Computer Society, USA (1979)
[24]
Struth G On the expressive power of Kleene algebra with domain Inf. Process. Lett. 2016 116 4 284-288
[25]
Trnková V and Reiterman J Dynamic algebras with test J. Comput. Syst. Sci. 1987 35 2 229-242
Recommendations
Kleene algebra with domain
We propose Kleene algebra with domain (KAD), an extension of Kleene algebra by simple equational axioms for a domain and a codomain operation. KAD considerably augments the expressiveness of Kleene algebra, in particular for the specification and ...
The equational theory of Kleene lattices
Languages and families of binary relations are standard interpretations of Kleene algebras. It is known that the equational theories of these interpretations coincide and that the free Kleene algebra is representable both as a relation and as a language ...
Kleene algebra with tests
We introduce Kleene algebra with tests, an equational system for manipulating programs. We give a purely equational proof, using Kleene algebra with tests and commutativity conditions, of the following classical result: every while program can be ...
Comments
Information & Contributors
Information
Published In
Apr 2023
308 pages
ISBN:978-3-031-28082-5
DOI:10.1007/978-3-031-28083-2
- Editors:
- Roland Glück,
- Luigi Santocanale,
- Michael Winter
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 03 April 2023
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 08 Feb 2025
Other Metrics
Citations
Cited By
View all- Sedlár I(2023)Kleene Algebra of Weighted Programs with DomainDynamic Logic. New Trends and Applications10.1007/978-3-031-51777-8_4(52-67)Online publication date: 15-Sep-2023