Efficient Strategies to Compute Invariants, Bounds and Stable Places of Petri nets - Archive ouverte HAL Access content directly
Conference Papers Year : 2023

Efficient Strategies to Compute Invariants, Bounds and Stable Places of Petri nets

Yann Thierry-Mieg

Abstract

This paper presents a set of strategies to solve global behavioral properties of Petri nets. We introduce efficient methods to compute structural invariants and bounds, and to decide presence of stable places for both PT nets and colored nets. Our focus is on proposing strategies that scale to very large nets, even if precision is degraded or the test is only a semi-decision (e.g. a sufficient condition). These strategies form the decision procedures of ITS-Tools, that has won the annual model-checking competition MCC in these categories in both 2021 and 2022.
Fichier principal
Vignette du fichier
PNSE2023_camera.pdf (713.85 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04142675 , version 1 (27-06-2023)

Identifiers

  • HAL Id : hal-04142675 , version 1

Cite

Yann Thierry-Mieg. Efficient Strategies to Compute Invariants, Bounds and Stable Places of Petri nets. Petri Nets and Software Engineering PNSE'23, Jun 2023, Lisbon, Portugal. ⟨hal-04142675⟩
28 View
16 Download

Share

Gmail Facebook X LinkedIn More