Nested Petri nets for adaptive process modeling

Authors:
Irina A. Lomazova
Affiliations:
Program Systems Institute of the Russian Academy of Science, Pereslavl-Zalessky, Russia
Venue:
Pillars of computer science
Year:
2008

Citing 11
Cited 8

Nets in computer organization

Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Nested petri nets - a formalism for specification and verification of multi-agent distributed systems

Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
Well-structured transition systems everywhere!

Theoretical Computer Science
Modeling dynamic objects in distributed systems with nested Petri nets

Fundamenta Informaticae
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
Nested Petri Nets: Multi-level and Recursive Systems

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Nested nets for adaptive systems

ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
High-level nets with nets and rules as tokens

ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Reference and value semantics are equivalent for ordinary object petri nets

ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets

A Hierarchical Methodology to Specify and Simulate Complex Computational Systems

ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
Interacting Workflow Nets for Workflow Process Re-Engineering

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Boundedness of adaptive nets is decidable

Information Processing Letters
Resource Driven Automata Nets

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Complexity results for elementary hornets

PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
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
On the Complexity of the Reachability Problem for Safe, Elementary Hornets

Fundamenta Informaticae - Dedicated to the Memory of Professor Manfred Kudlek

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider Nested Petri nets (NP-nets), i.e. Petri nets in which tokens can be Petri nets themselves. To increase flexibility and give tools for modeling adaptive processes we extend this formalism by allowing operations on net tokens. We prove decidability of some crucial for verification problems and thus show that, in spite of very flexible structure, NP-nets maintain "good" properties of ordinary Petri nets.