Thumbnail - Request a copy

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

Type
Communication / Conférence
Date
1999
Conference title
20th International Conference on Application and Theory of Petri Nets, ICATPN 1999
Conference date
1999-06
Conference city
Williamsburg, VA
Conference country
États-Unis
Book title
Application and Theory of Petri Nets 1999 20th International Conference, ICATPN'99, Williamsburg, Virginia, USA, June 21-25, 1999 Proceedings
Book author
Donatelli, Susanna; Kleijn, Jetty
Publisher
Springer
Series title
Lecture Notes in Computer Science
Series number
1639
Published in
Berlin
ISBN
978-3-540-66132-0
Number of pages
425
Pages
228-247
Publication identifier
Metadata
Show full item record
Author(s)
Haddad, Serge
Poitrenaud, Denis
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 / Keywords
petri nets; recursive petri nets