Nested-unit Petri nets

Branching Processes of Conservative Nested Petri Nets

Nested Petri nets (NP-nets) is an extension of the Petri nets formalism within the “nets-within-nets” approach, when tokens in a marking are themselves Petri nets which have autonomous behavior and synchronize with the system net. The formalism of NP-nets allows modeling multi-level multi-agent systems with a dynamic structure in a natural way. In this paper we define branching processes and un...

Some Decidability Results for Nested Petri Nets

NPNtool: Modelling and Analysis Toolset for Nested Petri Nets

Nested Petri nets is an extension of Petri net formalism with net tokens for modelling multi-agent distributed systems with complex structure. While having a number of interesting properties, NP-nets have been lacking tool support. In this paper we present the NPNtool toolset for NP-nets which can be used to edit NP-nets models and check liveness in a compositional way. An algorithm to check m-...

A Coloured Nested Petri Nets Model for Discussing MANET Properties

Predicting behavior and assuring quality of service of complex multimedia systems is very hard. Techniques based on tests, inspections or simulations are not always effective. Conversely, rigorous adoption of formal approaches in entire system lifecycle is very costly, and does not provide evidence about run-time performance. Our research proposes a tool, which allows both formally modeling and...

On Compositionality of Boundedness and Liveness for Nested Petri Nets

Nested Petri nets (NP-nets) are Petri nets with net tokens. The liveness and boundedness problems are undecidable for two-level NP-nets [10]. Boundedness is EXPSPACE and liveness is EXPSPACE or worse for plain Petri nets [4]. However, for some restricted classes, e.g. for plain free-choice Petri nets, problems become more amenable to analysis. There is the polynomial time algorithm to check if ...