Modeling Dynamic Objects in Distributed Systems with Nested Petri Nets

Issue title: Concurrency Specification and Programming Workshop (CS&P'2001)

Article type: Research Article

Authors: Lomazova, Irina A.

Affiliations: Artificial Intelligence Research Center, Program System Institute of Russian Academy of Science, Pereslavl-Zalessky, 152140, Russia

Abstract: Nested Petri nets (NP-nets) is a Petri net extension, allowing tokens in a net marking to be represented by marked nets themselves. The paper discusses applicability of NP-nets for modeling task planning systems, multi-agent systems and recursive-parallel systems. A comparison of NP-nets with some other formalisms, such as OPNs of R. Valk, recursive parallel programs of O. Kushnarenko and Ph. Schnoebelen and process algebras is given. Some aspects of decidability for object-oriented Petri net extensions are also discussed.

Keywords: Petri nets, nested Petri nets, multi-agent systems, task planning systems, recursive-parallel programs, process algebras, decidability

Journal: Fundamenta Informaticae, vol. 51, no. 1-2, pp. 121-133, 2002