Flat Petri Nets (Invited Talk) - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

Flat Petri Nets (Invited Talk)

Résumé

Vector addition systems with states (VASS for short), or equivalently Petri nets are one of the most popular formal methods for the representation and the analysis of parallel processes. The central algorithmic problem is reachability: whether from a given initial configuration there exists a sequence of valid execution steps that reaches a given final configuration. This paper provides an overview of results about the reachability problem for VASS related to Presburger arithmetic, by presenting 1) a simple algorithm for deciding the reachability problem based on invariants definable in Presburger arithmetic, 2) the class of flat VASS for computing reachability sets in Presburger arithmetic, and 3) complexity results about the reachability problem for flat VASS.
Fichier principal
Vignette du fichier
main.pdf (296.19 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03436231 , version 1 (19-11-2021)

Identifiants

Citer

Jérôme Leroux. Flat Petri Nets (Invited Talk). Application and Theory of Petri Nets and Concurrency - 42nd International Conference, {PETRI} {NETS} 2021, Jun 2021, Virtual Event, France. ⟨10.1007/978-3-030-76983-3_2⟩. ⟨hal-03436231⟩

Collections

CNRS ANR
20 Consultations
52 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More