Weighted GKAT: Completeness and Complexity

April 29, 2025 ยท The Ethereal ยท ๐Ÿ› International Colloquium on Automata, Languages and Programming

๐Ÿ”ฎ THE ETHEREAL: The Ethereal
Pure theory โ€” exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Spencer Van Koevering, Wojciech Rรณลผowski, Alexandra Silva arXiv ID 2504.20385 Category cs.LO: Logic in CS Cross-listed cs.FL, cs.PL Citations 0 Venue International Colloquium on Automata, Languages and Programming Last Checked 5 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Logic in CS