Guarded Kleene Algebra with Tests: Automata Learning

  title={Guarded Kleene Algebra with Tests: Automata Learning},
  author={Stefan Zetzsche and Alexandra Silva and Matteo Sammartino},
Guarded Kleene Algebra with Tests (GKAT) is the fragment of Kleene Algebra with Tests (KAT) that arises by replacing the union and iteration operations of KAT with predicate-guarded variants. GKAT is more efficiently decidable than KAT and expressive enough to model simple imperative programs, making it attractive for applications to e.g. network verification. In this paper, we further explore GKAT’s automata theory, and present GL ∗ , an algorithm for learning the GKAT automaton representation of… 

Figures from this paper


Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time
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.
Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness
This paper develops an operational (coal algebraic) and denotational (algebraic) semantics and shows that they coincide, and characterize the behaviors of GKAT expressions in this semantics, leading to a coequation that captures the covariety of automata corresponding to these behaviors.
Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests
  • D. Pous
  • Computer Science
    POPL 2015
  • 2014
This work considers Kleene algebra with tests (KAT), an algebraic theory that can be used for verification in various domains ranging from compiler optimisation to network programming analysis, and proposes several methods allowing to construct symbolic automata out of KAT expressions.
Learning Automata with Side-Effects
A general framework for automata learning based on category theory is developed and a class of optimizations and an accompanying correctness proof for learning algorithms are developed, which provides a rich algebraic structure to capture non-determinism and other side-effects.
Automata on Guarded Strings and Applications
  • D. Kozen
  • Mathematics, Computer Science
  • 2001
It is shown that a basic result of the theory of Boolean decision diagrams (BDDs), namely that minimal ordered BDDs are unique, is a special case of the Myhill-Nerode theorem for a class of automata on guarded strings.
On the Coalgebraic Theory of Kleene Algebra with Tests
  • D. Kozen
  • 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}\).
The TTT Algorithm: A Redundancy-Free Approach to Active Automata Learning
The distinguishing characteristic of TTT is its redundancy-free organization of observations, which can be exploited to achieve optimal (linear) space complexity, thanks to a thorough analysis of counterexamples, extracting and storing only the essential refining information.
On the learnability of infinitary regular sets
A polynomial algorithm for learning a sub-class of the ω-regular sets from membership queries and counter-examples based on the framework suggested by Angluin for learning regular subsets of Σ*.
Residual Finite State Automata
It is proved that every regular language is recognized by a unique (canonical) RFSA which has a minimal number of states and a maximal number of transitions.
A Coalgebraic Decision Procedure for NetKAT
The coalgebraic theory of NetKAT is developed, including a specialized version of the Brzozowski derivative, and a new efficient algorithm for deciding the equational theory using bisimulation is presented.