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.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01558108
Contributor : Damien Pous <>
Submitted on : Friday, July 7, 2017 - 10:08:06 AM
Last modification on : Wednesday, November 20, 2019 - 2:34:27 AM
Document(s) archivé(s) le : Wednesday, January 24, 2018 - 8:09:11 AM

File

cka.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01558108, version 1

Citation

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

Share

Metrics

Record views

269

Files downloads

354