79 citations · 365 across the 37 of their papers we have counts for
5 papers · 1 filter
A String Diagrammatic Axiomatisation of Finite-State Automata
Robin Piedeleu, Fabio Zanasi
We develop a fully diagrammatic approach to the theory of finite-state automata, based on reinterpreting their usual state-transition graphical representation as a two-dimensional…
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…
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…
Concurrent Kleene Algebra: Free Model and Completeness
Tobias Kappé, Paul Brunet, Alexandra Silva +1
Concurrent Kleene Algebra (CKA) was introduced by Hoare, Moeller, Struth and Wehrman in 2009 as a framework to reason about concurrent programs. We prove that the axioms for CKA wi…
Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages
Tobias Kappé, Paul Brunet, Bas Luttik +2
Concurrent Kleene Algebra (CKA) is a mathematical formalism to study programs that exhibit concurrent behaviour. As with previous extensions of Kleene Algebra, characterizing the f…