Taking Complete Finite Prefixes To High Level, Symbolically (Full Version) - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Taking Complete Finite Prefixes To High Level, Symbolically (Full Version)

Résumé

Unfoldings are a well known partial-order semantics of P/T Petri nets that can be applied to various model checking or verification problems. For high-level Petri nets, the so-called symbolic unfolding generalizes this notion. A complete finite prefix of the unfolding of a P/T Petri net contains all information to verify, e.g., reachability of markings. We unite these two concepts and define complete finite prefixes of the symbolic unfolding of high-level Petri nets. For a class of safe high-level Petri nets, we generalize the well-known algorithm by Esparza et al. for constructing small such prefixes. Additionally, we identify a more general class of nets with infinitely many reachable markings, for which an approach with an adapted cutoff criterion extends the complete prefix methodology, in the sense that the original algorithm cannot be applied to the P/T net represented by a high-level net.
Fichier principal
Vignette du fichier
FinCompPrefSymb-full.pdf (761.28 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04029490 , version 1 (15-03-2023)

Identifiants

  • HAL Id : hal-04029490 , version 1

Citer

Nick Würdemann, Thomas Chatain, Stefan Haar. Taking Complete Finite Prefixes To High Level, Symbolically (Full Version). Petri Nets 2023 - 44TH International Conference on Applications and Theory of Petri Nets and Concurrency, R&D Group on Reconfigurable and Embedded Systems at NOVA School of Science and Technology, Mar 2023, Caparica (Lisbonne), Portugal. ⟨hal-04029490⟩
76 Consultations
34 Téléchargements

Partager

Gmail Facebook X LinkedIn More