Acceleration for Petri Nets - Archive ouverte HAL
Communication Dans Un Congrès Année : 2013

Acceleration for Petri Nets

Résumé

The reachability problem for Petri nets is a central problem of net theory. The problem is known to be decidable by inductive invariants definable in the Presburger arithmetic. When the reachability set is definable in the Presburger arithmetic, the existence of such an inductive invariant is immediate. However, in this case, the computation of a Presburger formula denoting the reachability set is an open problem. Recently this problem got closed by proving that if the reachability set of a Petri net is definable in the Presburger arithmetic, then the Petri net is flat, i.e. its reachability set can be obtained by runs labeled by words in a bounded language. As a direct consequence, classical algorithms based on acceleration techniques effectively compute a formula in the Presburger arithmetic denoting the reachability set.
Fichier principal
Vignette du fichier
ATVA.pdf (93.98 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00959698 , version 1 (15-03-2014)

Identifiants

Citer

Jérôme Leroux. Acceleration for Petri Nets. ATVA, 2013, Hanoi, Vietnam. pp.1-4, ⟨10.1007/978-3-319-02444-8_1⟩. ⟨hal-00959698⟩

Collections

CNRS TDS-MACS
69 Consultations
288 Téléchargements

Altmetric

Partager

More