Branching Processes of Conservative Nested Petri Nets

17 pages•Published: July 28, 2014

Abstract

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 dynamic structure in a natural way. In this paper we define branching processes and unfoldings for conservative NP- nets, i.e. for NP-nets with a persistent set of agents. We prove that NP-nets unfoldings satisfy the fundamental property of unfoldings, and thus can be used for verification of conservative NP-nets in line with classical unfolding methods.

Keyphrases: nested petri nets, petri nets, true concurrency, unfoldings

In: Alexei Lisitsa and Andrei Nemytykh (editors). VPT 2014. Second International Workshop on Verification and Program Transformation, vol 28, pages 19-35.

Links:	https://easychair.org/publications/paper/cjLR
	https://doi.org/10.29007/6ntb

BibTeX entry

@inproceedings{VPT2014:Branching_Processes_Conservative_Nested,
  author    = {Daniil Frumin and Irina Lomazova},
  title     = {Branching Processes of Conservative Nested Petri Nets},
  booktitle = {VPT 2014. Second International Workshop on Verification and Program Transformation},
  editor    = {Alexei Lisitsa and Andrei Nemytykh},
  series    = {EPiC Series in Computing},
  volume    = {28},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/cjLR},
  doi       = {10.29007/6ntb},
  pages     = {19-35},
  year      = {2014}}

Download PDF Open PDF in browser