On the complexity of Kleene algebra with domain
From MaRDI portal
Publication:6174424
DOI10.1007/978-3-031-28083-2_13OpenAlexW4323527483MaRDI QIDQ6174424
Publication date: 17 August 2023
Published in: Relational and Algebraic Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-28083-2_13
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Axiomatizability of representable domain algebras
- Internal axioms for domain semirings
- Building program construction and verification tools from algebraic principles
- Algebras of modal operators and partial correctness
- On the expressive power of Kleene algebra with domain
- Dynamic algebras with test
- An elementary proof of the completeness of PDL
- Dynamic algebras: Examples, constructions, applications
- Propositional dynamic logic of regular programs
- A completeness theorem for Kleene algebras and the algebra of regular events
- Free Kleene algebras with domain
- Modal Semirings Revisited
- Dynamic predicate logic
- Kleene algebra with domain
This page was built for publication: On the complexity of Kleene algebra with domain
