Weighted GKAT: Completeness and Complexity
Logic in Computer Science
2025-04-30 v1 Formal Languages and Automata Theory
Programming Languages
Abstract
We propose Weighted Guarded Kleene Algebra with Tests (wGKAT), an uninterpreted weighted programming language equipped with branching, conditionals, and loops. We provide an operational semantics for wGKAT using a variant of weighted automata and introduce a sound and complete axiomatization. We also provide a polynomial time decision procedure for bisimulation equivalence.
Cite
@article{arxiv.2504.20385,
title = {Weighted GKAT: Completeness and Complexity},
author = {Spencer Van Koevering and Wojciech Różowski and Alexandra Silva},
journal= {arXiv preprint arXiv:2504.20385},
year = {2025}
}
Comments
ICALP 2025. 51 pages, 2 figures