# Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness

@inproceedings{Schmid2021GuardedKA, title={Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness}, author={Todd J. Schmid and Tobias Kapp'e and Dexter Kozen and Alexandra Silva}, booktitle={ICALP}, year={2021} }

Guarded Kleene Algebra with Tests (GKAT) is an efficient fragment of KAT, as it allows for almost linear decidability of equivalence. In this paper, we study the (co)algebraic properties of GKAT. Our initial focus is on the fragment that can distinguish between unsuccessful programs performing different actions, by omitting the so-called early termination axiom. We develop an operational (coalgebraic) and denotational (algebraic) semantics and show that they coincide. We then characterize the…

## Figures from this paper

## 5 Citations

On Star Expressions and Coalgebraic Completeness Theorems

- Mathematics, Computer ScienceMFPS
- 2021

This paper analyses Grabmayer and Fokkink’s proof of completeness from the perspective of universal coalgebra, and gives an abstract account of their proof method, and compares this proof method to another approach to completeness proofs from coalgebraic language theory.

How to write a coequation

- MathematicsArXiv
- 2021

It is argued that this is partly due to the multitude of syntaxes for writing down coequations, which seems to have led to some confusion about what coEquations are and what they are for.

Guarded Kleene Algebra with Tests: Automata Learning

- Computer ScienceArXiv
- 2022

A complexity analysis shows that it is more eﬃcient to learn a representation of a GKAT program with GL ∗ than with Angluin’s existing L ∗ algorithm.

Processes Parametrised by an Algebraic Theory

- Computer Science, Mathematics
- 2022

A (co)algebraic framework to study a family of process calculi with monadic branching structures and recursion operators that features a uniform semantics of process terms and a complete axiomatisation of semantic equivalence is developed.

On Star Expressions and Completeness Theorems

- Mathematics, Computer ScienceElectronic Proceedings in Theoretical Computer Science
- 2021

This paper analyse Grabmayer and Fokkink’s proof of completeness from the perspective of universal coalgebra, and thereby gives an abstract account of their proof method and compares this proof method to another approach to completeness proofs from coalgebraic language theory.

## References

SHOWING 1-10 OF 37 REFERENCES

Nonlocal Flow of Control and Kleene Algebra with Tests

- Mathematics2008 23rd Annual IEEE Symposium on Logic in Computer Science
- 2008

This paper shows how KAT can be used to give a rigorous equational treatment of control constructs involving nonlocal transfer of control such as unconditional jumps, loop statements with multi-level breaks, and exception handlers, and develops a compositional semantics and a complete equational axiomatization.

Guarded Kleene Algebra with Tests: Verification of Uninterpreted Programs in Nearly Linear Time

- MathematicsMFCS
- 2019

This work develops the (co)algebraic theory of GKAT and shows how it can be efficiently used to reason about imperative programs and provides a full Kleene theorem and proves completeness for an analogue of Salomaa's axiomatization of Kleene Algebra.

On the Coalgebraic Theory of Kleene Algebra with Tests

- Mathematics, Computer Science
- 2017

It follows that coinductive equivalence proofs can be generated automatically in PSPACE, and this matches the bound of Worthington (2008) for the automatic generation of equational proofs in \(\mathsf {KAT}\).

A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity

- Computer Science, MathematicsLICS
- 2020

It is proved that the adaptation of Milner's system over the subclass of regular expressions that arises by dropping the constant 1, and by changing to binary Kleene star iteration is complete.

The Böhm-Jacopini Theorem Is False, Propositionally

- MathematicsMPC
- 2008

A purely propositional account of the Bohm---Jacopini theorem, which states that any deterministic flowchart program is equivalent to a while program, and reformulate the problems at the propositional level in terms of automata on guarded strings, the automata-theoretic counterpart to Kleene algebra with tests.

Equational Theories of Abnormal Termination Based on Kleene Algebra

- Computer ScienceFoSSaCS
- 2017

This work investigates two equational theories in the abstract framework of Kleene algebra, and proposes two simple and intuitive equational axiomatizations, and proves very general conservativity results.

Kleene Algebra with Tests: Completeness and Decidability

- MathematicsCSL
- 1996

The completeness of the equational theory of Kleene algebras with tests and *-continuous Kleene algebra with tests over language-theoretic and relational models is proved.

Behavioural differential equations: a coinductive calculus of streams, automata, and power series

- MathematicsTheor. Comput. Sci.
- 2003

The Complexity of Kleene Algebra with Tests

- Mathematics, Computer Science
- 1996

The equational theory of Kleene algebras with tests has been shown to be decidable in at most exponential time by an efficient reduction to Propositional Dynamic Logic.