30 citations · 66 across the 10 of their papers we have counts for
3 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…
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…