• Citer

Solving Petri Net Recursions through Finite Representation

par Devillers, Raymond ;Klaudel, Hanna
Editeur scientifique Sahn, S.
Référence (November 22 – 24, 2004: St. Thomas, US Virgin Islands), Advances in Computer Science and Technology, (ACST 2004), Acta Press, page (145-150)
Publication Publié, 2004-11

Publication dans des actes

• Détails
• Contenu

Résumé :

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.