Petri nets in software engineering
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Reduction and covering of infinite reachability trees
Information and Computation
Proving termination with multiset orderings
Communications of the ACM
Well-structured transition systems everywhere!
Theoretical Computer Science
On Proving Large Distributed Systems: Petri Net Modules Verification
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
Principles of High-Level Net Theory
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
From Coloured Petri Nets to Object Petri Nets
Proceedings of the 16th International Conference on Application and Theory of Petri Nets
Multi-Agent-Systems Based on Coloured Petri Nets
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
On the Abstraction of 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
Towards a Modular Analysis of Coloured Petri Nets
Proceedings of the 13th International Conference on Application and Theory of Petri Nets
Petri Nets with Marking-Dependent Ar Cardinality: Properties and Analysis
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
Proceedings of the 15th 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
General decidability theorems for infinite-state systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
On the Expressiveness of Communication Channels for Object Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Checking Properties of Adaptive Workflow Nets
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Modelling Global and Local Name Spaces for Mobile Agents Using Object Nets
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Mobile Object-Net Systems and their Processes
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Communities of Interacting Automata for Modelling Distributed Systems with Dynamic Structure
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Some Considerations on Higher-Order Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1
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)
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)
Cellular Resource-Driven Automata
Fundamenta Informaticae - Concurrency Specification and Programming CS&P
On Compositionality of Boundedness and Liveness for Nested Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming CS&P
| Hi-index | 0.00 |
Nested Petri nets is a formalism for modeling hierarchical multi-agent systems. Tokens in nested Petri nets are elements represented by nets themselves. Decidability of some crucial for verification problems shows that, in spite of their ”unflat” structure, nested Petri nets maintain significant properties of ordinary Petri nets. A comparison with some other Petri net models is given. The formalism allows generalization to a recursive case, when a nested Petri net may generate its own copy as its element. Two simple examples illustrate the approach.