111 citations · 528 across the 50 of their papers we have counts for
6 papers · 1 filter
Learning Weighted Automata over Principal Ideal Domains
Gerco van Heerdt, Clemens Kupke, Jurriaan Rot +1
In this paper, we study active learning algorithms for weighted automata over a semiring. We show that a variant of Angluin's seminal \LStar\ algorithm works when the semiring is a…
Guarded Kleene Algebra with Tests: Verification of Uninterpreted Programs in Nearly Linear Time
Steffen Smolka, Nate Foster, Justin Hsu +3
Guarded Kleene Algebra with Tests (GKAT) is a variation on Kleene Algebra with Tests (KAT) that arises by restricting the union () and iteration () operations from KAT to pre…
A (co)algebraic theory of succinct automata
Gerco van Heerdt, Joshua Moerman, Matteo Sammartino +1
The classical subset construction for non-deterministic automata can be generalized to other side-effects captured by a monad. The key insight is that both the state space of the d…
Completeness and Incompleteness of Synchronous Kleene Algebra
Jana Wagemaker, Marcello Bonsangue, Tobias Kappé +2
Synchronous Kleene algebra (SKA), an extension of Kleene algebra (KA), was proposed by Prisacariu as a tool for reasoning about programs that may execute synchronously, i.e., in lo…
Scalable Verification of Probabilistic Networks
Steffen Smolka, Praveen Kumar, David M Kahn +4
This paper presents McNetKAT, a scalable tool for verifying probabilistic network programs. McNetKAT is based on a new semantics for the guarded and history-free fragment of Probab…
Tree Automata as Algebras: Minimisation and Determinisation
Gerco van Heerdt, Tobias Kappé, Jurriaan Rot +2
We study a categorical generalisation of tree automata, as -algebras for a fixed endofunctor endowed with initial and final states. Under mild assumptions about the base cat…