Theoretical Aspects of Recursive Petri Nets
Haddad, Serge; Poitrenaud, Denis (1999), Theoretical Aspects of Recursive Petri Nets, in Donatelli, Susanna; Kleijn, Jetty, Application and Theory of Petri Nets 1999 20th International Conference, ICATPN'99, Williamsburg, Virginia, USA, June 21-25, 1999 Proceedings, Springer : Berlin, p. 228-247. http://dx.doi.org/10.1007/3-540-48745-X_14
TypeCommunication / Conférence
Conference title20th International Conference on Application and Theory of Petri Nets, ICATPN 1999
Conference cityWilliamsburg, VA
Book titleApplication and Theory of Petri Nets 1999 20th International Conference, ICATPN'99, Williamsburg, Virginia, USA, June 21-25, 1999 Proceedings
Book authorDonatelli, Susanna; Kleijn, Jetty
Series titleLecture Notes in Computer Science
Number of pages425
MetadataShow full item record
Abstract (EN)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.
Subjects / Keywordspetri nets; recursive petri nets
Showing items related by title and author.