Solving Petri Net Recursions through Finite Representation
Raymond Devillers, Hanna Klaudel, S. Sahn · Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) · 2004
In this paper, we propose a finite representation of recur sively defined Petri nets in the framework of the Petri Box Calculus. This is achieved by using higher level nets to gether with an equivalence on markings in order to enter in or return from recursive calls.