par Finkel, Alain;Raskin, Jean-François 
;Samuelides, Mathias;Van Begin, Laurent
Référence Electronic Notes in Theoretical Computer Science, 68, 6, page (89-100)
Publication Publié, 2003-02
;Samuelides, Mathias;Van Begin, Laurent Référence Electronic Notes in Theoretical Computer Science, 68, 6, page (89-100)
Publication Publié, 2003-02
Article révisé par les pairs
| Résumé : | 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. |
