Decidability of bisimulation equivalence for process generating context-free languages
Journal of the ACM (JACM)
Agent theories, architectures, and languages: a survey
ECAI-94 Proceedings of the workshop on agent theories, architectures, and languages on Intelligent agents
A Formal Framework for the Analysis of Recursive-Parallel Programs
PaCT '97 Proceedings of the 4th International Conference on Parallel Computing Technologies
Reset Nets Between Decidability and Undecidability
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Multi-Agent-Systems Based on Coloured Petri Nets
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Petri Nets as Token Objects: An Introduction to Elementary Object Nets
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
Theoretical Aspects of Recursive Petri Nets
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Some Decidability Results for Nested Petri Nets
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Relating Different Semantics for Object Petri Nets
Relating Different Semantics for Object Petri Nets
Comparing Concepts of Object Petri Net Formalisms
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Nested Petri Nets: Multi-level and Recursive Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
A Linear Logic View of Object Petri Nets
Fundamenta Informaticae
Adaptive workflow nets for grid computing
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
Agent-based cloud workflow execution
Integrated Computer-Aided Engineering - Anniversary Volume: Celebrating 20 Years of Excellence
| Hi-index | 0.00 |
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.