Some consequences of the decidability of the reachability problem for Petri nets
Advances in Petri Nets 1988
A unified approach for deciding the existence of certain Petri net paths
Information and Computation
Self-Modifying Nets, a Natural Extension of Petri Nets
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Reset Nets Between Decidability and Undecidability
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Decidability of reachability in vector addition systems (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
An algorithm for the general Petri net reachability problem
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Reachability in Petri Nets with Inhibitor Arcs
Electronic Notes in Theoretical Computer Science (ENTCS)
Transactions on Petri Nets and Other Models of Concurrency I
Hornets: Nets within Nets Combined with Net Algebra
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
On the Expressiveness of Communication Channels for Object Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
P- and t-systems in the nets-within-nets-formalism
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Modeling Dynamic Objects in Distributed Systems with Nested Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)
Nested Petri Nets: Multi-level and Recursive Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
| Hi-index | 0.00 |
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.