Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited

Alain Finkel (1) , Jean-François Raskin (2) , Mathias Samuelides (3) , Laurent van Begin (2)

1 LSV - Laboratoire Spécification et Vérification [Cachan]
2 ULB - Département d'Informatique [Bruxelles]
3 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

In this paper, we revisit the forward and backward approaches to the verification of extensions of infinite state Petri Nets. As contributions, we propose an efficient data structure to represent infinite downward closed sets of markings and to compute symbolically the minimal coverability set of Petri Nets, we identify a subclass of Transfer Nets for which the forward approach generalizes and we propose a general strategy to use both the forward and the backward approach for the efficient verification of general Transfer Nets.

Mots clés: Extended Petri Nets; Symbolic Verification; Efficient Data Structure; Safety Property

Domaines: Modélisation et simulation

Alain Finkel, Jean-François Raskin, Mathias Samuelides, Laurent van Begin. Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited. Electronic Notes in Theoretical Computer Science, 2002, 68 (6), pp.85-106. ⟨10.1016/S1571-0661(04)80535-8⟩. ⟨hal-00158709⟩