111 citations · 528 across the 50 of their papers we have counts for
7 papers · 1 filter
On Series-Parallel Pomset Languages: Rationality, Context-Freeness and Automata
Tobias Kappé, Paul Brunet, Bas Luttik +2
Concurrent Kleene Algebra (CKA) is a formalism to study concurrent programs. Like previous Kleene Algebra extensions, developing a correspondence between denotational and operation…
Kleene Algebra with Observations
Tobias Kappé, Paul Brunet, Jurriaan Rot +3
Kleene algebra with tests (KAT) is an algebraic framework for reasoning about the control flow of sequential programs. Generalising KAT to reason about concurrent programs is not s…
Symbolic Register Automata
Loris D'Antoni, Tiago Ferreira, Matteo Sammartino +1
Symbolic Finite Automata and Register Automata are two orthogonal extensions of finite automata motivated by real-world problems where data may have unbounded domains. These automa…
Equivalence checking for weak bi-Kleene algebra
Tobias Kappé, Paul Brunet, Bas Luttik +2
Pomset automata are an operational model of weak bi-Kleene algebra, which describes programs that can fork an execution into parallel threads, upon completion of which execution ca…
Convex Language Semantics for Nondeterministic Probabilistic Automata
Gerco van Heerdt, Justin Hsu, Joël Ouaknine +1
We explore language semantics for automata combining probabilistic and nondeterministic behavior. We first show that there are precisely two natural semantics for probabilistic aut…
Borel Kernels and their Approximation, Categorically
Fredrik Dahlqvist, Vincent Danos, Ilias Garnier +1
This paper introduces a categorical framework to study the exact and approximate semantics of probabilistic programs. We construct a dagger symmetric monoidal category of Borel ker…