Monotonic Extensions of Petri Nets: Foward and Backward Search Revisited

A. Finkel, J.-F. Raskin, M. Samuelides, L. Van Begin


Abstract

In this paper, we revisite the forward and backward approaches to the verification of extensions of infinite state Petri Nets. As contributions, we propose an adaptation of the Covering Sharing Trees 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.