Automated Polyhedral Abstraction Proving - LAAS - Laboratoire d'Analyse et d'Architecture des Systèmes Access content directly
Conference Papers Year : 2023

Automated Polyhedral Abstraction Proving


We propose an automated procedure to prove polyhedral abstractions for Petri nets. Polyhedral abstraction is a new type of state-space equivalence based on the use of linear integer constraints. Our approach relies on an encoding into a set of SMT formulas whose satisfaction implies that the equivalence holds. The difficulty, in this context, arises from the fact that we need to handle infinite-state systems. For completeness, we exploit a connection with a class of Petri nets that have Presburger-definable reachability sets. We have implemented our procedure, and we illustrate its use on several examples.
Fichier principal
Vignette du fichier
paper.pdf (574.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04115006 , version 1 (02-06-2023)





Nicolas Amat, Silvano Dal Zilio, Didier Le Botlan. Automated Polyhedral Abstraction Proving. 44th International Conference on Application and Theory of Petri Nets and Concurrency (Petri Nets 2023), Jun 2023, Lisbon, Portugal. pp.324-345, ⟨10.1007/978-3-031-33620-1_18⟩. ⟨hal-04115006⟩
4 View
6 Download



Gmail Facebook X LinkedIn More