Taking Complete Finite Prefixes To High Level, Symbolically - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2023

Taking Complete Finite Prefixes To High Level, Symbolically

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 a P/T Petri net's unfolding 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. We evaluate this extended algorithm through a prototype implementation on four novel benchmark families. Additionally, we identify a more general class of nets with infinitely many reachable markings, for which an approach with an adapted cut-off 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
2311.11443.pdf (1.16 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04297773 , version 1 (21-11-2023)

Licence

Paternité

Identifiants

Citer

Nick Würdemann, Thomas Chatain, Stefan Haar, Lukas Panneke. Taking Complete Finite Prefixes To High Level, Symbolically. 2023. ⟨hal-04297773⟩
34 Consultations
7 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More