Acceleration For Presburger Petri Nets - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Acceleration For Presburger 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 flatable, 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
VPT.pdf (91.78 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

  • HAL Id : hal-00959699 , version 1

Citer

Jérôme Leroux. Acceleration For Presburger Petri Nets. VPT@CAV, 2013, Saint Petersbourg, Russia. pp.10-12. ⟨hal-00959699⟩

Collections

CNRS TDS-MACS
152 Consultations
107 Téléchargements

Partager

Gmail Facebook X LinkedIn More