For the most recent entries see the Petri Nets Newsletter.

Theoretical Aspects of Recursive Petri Nets.

Haddad, Serge; Poitrenaud, Denis

In: Donatelli, Susanna; Kleijn, Jetty: Lecture Notes in Computer Science, Vol. 1630: Application and Theory of Petri Nets 1999, 20th International Conference, ICATPN'99, Williamsburg, Virginia, USA, pages 228-247. Springer-Verlag, June 1999.

Abstract: The model of recursive Petri nets (RPNs) has been introduced in the field of multi-agent systems in order to model flexible plans for agents. In this paper we focus on some theoretical aspects of RPNs. More precisely, we show that this model is a strict extension of the model of Petri nets in the following sense: the family of languages of RPNs strictly includes the union of Petri net and Context Free languages. Then we prove the main result of this work, the decidability of the reachability problem for RPNS.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography