Nested Petri Nets: Multi-level and Recursive Systems

Authors:
Irina A. Lomazova
Affiliations:
Artificial Intelligence Center, Program Systems Institute of Russian Academy of Science, Pereslavl-Zalessky, 152140, Russia
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Year:
2001

Citing 11
Cited 6

Reduction and covering of infinite reachability trees

Information and Computation
Reset Nets Between Decidability and Undecidability

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Fundamental Structures in Well-Structured Infinite Transition Systems

LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
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
Structured Nets

Proceedings on Mathematical Foundations of Computer Science
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
Reachability in Petri Nets with Inhibitor Arcs

Electronic Notes in Theoretical Computer Science (ENTCS)
Nested Petri Nets — a Formalism for Specification and Verification of Multi-Agent Distributed Systems

Fundamenta Informaticae
A Linear Logic View of Object Petri Nets

Fundamenta Informaticae

Modeling dynamic objects in distributed systems with nested Petri nets

Fundamenta Informaticae
Petri nets and resource bisimulation

Fundamenta Informaticae - Concurrency specification and programming
Coding Mobile Synchronizing Petri Nets into Rewriting Logic

Electronic Notes in Theoretical Computer Science (ENTCS)
Checking Properties of Adaptive Workflow Nets

Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Petri nets and resource bisimulation

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 2
Modeling Dynamic Objects in Distributed Systems with Nested Petri Nets

Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Nested Petri nets (NP-nets) is a formalism for modeling hierarchical multi-agent systems. Tokens in nested Petri nets are elements represented by nets themselves. The paper continues investigating semantic properties of NP-nets, started in [10], where two-level NP-nets were studied. Here we consider multi-level and recursive NP-nets, for which decidability of termination and some other properties are proved. A comparison of NP-nets with other Petri net models is given.