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.
Type de document :
Communication dans un congrès
CONCUR, Sep 2017, Berlin, Germany. 2017
Liste complète des métadonnées

Littérature citée [19 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01558108
Contributeur : Damien Pous <>
Soumis le : vendredi 7 juillet 2017 - 10:08:06
Dernière modification le : mercredi 21 novembre 2018 - 01:13:55
Document(s) archivé(s) le : mercredi 24 janvier 2018 - 08:09:11

Fichier

cka.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01558108, version 1

Citation

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

Partager

Métriques

Consultations de la notice

239

Téléchargements de fichiers

264