activity
20172020
most citedConcurrent Kleene Algebra: Free Model and Completeness

30 citations · 66 across the 10 of their papers we have counts for

collaborators
Showing cs.LOShow all

6 papers · 1 filter

cs.LO2020★ 6 cited

Partially Observable Concurrent Kleene Algebra

Jana Wagemaker, Paul Brunet, Simon Docherty +3

We introduce partially observable concurrent Kleene algebra (POCKA), an algebraic framework to reason about concurrent programs with control structures, such as conditionals and lo…

cs.LO2020★ 4 cited

Concurrent Kleene Algebra with Observations: from Hypotheses to Completeness

Tobias Kappé, Paul Brunet, Alexandra Silva +2

Concurrent Kleene Algebra (CKA) extends basic Kleene algebra with a parallel composition operator, which enables reasoning about concurrent programs. However, CKA fundamentally mis…

cs.LO2019

Pomsets with Boxes: Protection, Separation, and Locality in Concurrent Kleene Algebra

Paul Brunet, David Pym

Concurrent Kleene Algebra is an elegant tool for equational reasoning about concurrent programs. An important feature of concurrent programs that is missing from CKA is the ability…

cs.LO2019

A complete axiomatisation of reversible Kleene lattices

Paul Brunet

We consider algebras of languages over the signature of reversible Kleene lattices, that is the regular operations (empty and unit languages, union, concatenation and Kleene star)…

cs.LO2018★ 9 cited

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…

cs.LO2017★ 2 cited

Petri Automata

Paul Brunet, Damien Pous

Kleene algebra axioms are complete with respect to both language models and binary relation models. In particular, two regular expressions recognise the same language if and only i…