On Decidability of Concurrent Kleene Algebra - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

On Decidability of Concurrent Kleene Algebra


Concurrent Kleene algebras support equational reasoning about computing systems with concurrent behaviours. Their natural semantics is given by series(parallel) rational pomset languages, a standard true concurrency semantics, which is often associated with processes of Petri nets. We use constructions on Petri nets to provide two decision procedures for such pomset languages motivated by the equational and the refinement theory of concurrent Kleene algebra. The contribution to the first problem lies in a much simpler algorithm and an ExpSpace complexity bound. Decidability of the second, more interesting problem is new and, in fact, ExpSpace-complete.
Fichier principal
Vignette du fichier
cka.pdf (549.06 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01558108 , version 1 (07-07-2017)


  • HAL Id : hal-01558108 , version 1


Paul Brunet, Damien Pous, Georg Struth. On Decidability of Concurrent Kleene Algebra. CONCUR, Sep 2017, Berlin, Germany. ⟨hal-01558108⟩
198 View
243 Download


Gmail Facebook Twitter LinkedIn More