Coverability Trees for Petri Nets with Unordered Data - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Coverability Trees for Petri Nets with Unordered Data


We study an extension of classical Petri nets where tokens carry values from a countable data domain, that can be tested for equality upon firing transitions. These Unordered Data Petri Nets (UDPN) are well-structured and therefore allow generic decision procedures for several verification problems including coverability and boundedness. We show how to construct a finite representation of the coverability set in terms of its ideal decomposition. This not only provides an alternative method to decide coverability and boundedness, but is also an important step towards deciding the reachability problem. This also allows to answer more precise questions about the reachability set, for instance whether there is a bound on the number of tokens on a given place (place boundedness), or if such a bound exists for the number of different data values carried by tokens (place width boundedness). We provide matching Hyper-Ackermann bounds on the size of cover-ability trees and on the running time of the induced decision procedures.
Fichier principal
Vignette du fichier
main.pdf (536.8 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01252674 , version 1 (07-01-2016)



Piotr Hofman, Sławomir Lasota, Ranko Lazić, Jérôme Leroux, Sylvain Schmitz, et al.. Coverability Trees for Petri Nets with Unordered Data. FoSSaCS, 2016, Eindhoven, Netherlands. pp.445--461, ⟨10.1007/978-3-662-49630-5_26⟩. ⟨hal-01252674⟩
659 View
712 Download



Gmail Facebook X LinkedIn More