Solving Petri Net Recursions through Finite Representation

R. Devillers (Belgium) and H. Klaudel (France)


Petri nets, recursion, process algebra, marking equivalence.


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.

Important Links:

Go Back