Kleene Algebra with Dynamic Tests: Completeness and Complexity
Logic in Computer Science
2023-11-14 v1
Abstract
We study versions of Kleene algebra with dynamic tests, that is, extensions of Kleene algebra with domain and antidomain operators. We show that Kleene algebras with tests and Propositional dynamic logic correspond to special cases of the dynamic test framework. In particular, we establish completeness results with respect to relational models and guarded-language models, and we show that two prominent classes of Kleene algebras with dynamic tests have an EXPTIME-complete equational theory.
Keywords
Cite
@article{arxiv.2311.06937,
title = {Kleene Algebra with Dynamic Tests: Completeness and Complexity},
author = {Igor Sedlár},
journal= {arXiv preprint arXiv:2311.06937},
year = {2023}
}