Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

On Decidability of Concurrent Kleene Algebra

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Damien Pous Connect in order to contact the contributor
Submitted on : Friday, July 7, 2017 - 10:08:06 AM
Last modification on : Saturday, September 11, 2021 - 3:18:35 AM
Long-term archiving on: : Wednesday, January 24, 2018 - 8:09:11 AM


Files produced by the author(s)


  • 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⟩



Record views


Files downloads