Nested Petri Nets — a Formalism for Specification and Verification of Multi-Agent Distributed Systems

Lomazova, Irina A.

doi:10.3233/fi-2000-43123410

Cited by 68 publications

(32 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…There are several types of steps, defining the behaviour of nested Petri nets see [10]. In the case of DIWF-nets, there are two vertical synchronization steps: -If transition terminate is enabled in a marking M w.r.t.…”

Section: Definition 2 a Dynamic Interorganizational Workflow Net Diwmentioning

confidence: 99%

“…i by labelling all the transitions with the label l. We also write W F ′ i instead of W F ′ i (W F ′ i only appears in place q). The definition of the horizontal synchronization step is different from the one in [10], allowing the synchronization of arbitrarily many transitions from several objectnets. This change does not affect the general properties of nested nets:…”

Section: Definition 2 a Dynamic Interorganizational Workflow Net Diwmentioning

confidence: 99%

“…This paper presents a new approach on the modelling of interorganizational workflows, based on nested Petri nets. Nested Petri nets [10] are a special class of the Petri net model, in which tokens may be Petri nets (object-nets). The paper deals with…”

Section: Introductionmentioning

confidence: 99%

“…A partial order on the markings of nested Petri nets was defined in [10]. In the case of DIWF-nets we have that M 1 M 2 if and only if M 1 (I) ≤ M 2 (I), M 1 (O) ≤ M 2 (O) and there exists an embedding J p : M 1 (s) → M 2 (s) (s ∈ {p, q}), such that for any…”

mentioning

confidence: 99%

See 3 more Smart Citations

A Petri Net Based Approach for Modelling and Analyzing Interorganizational Workflows with Dynamic Structure

Prisecaru¹

2009

Proceedings of the 7th International Workshop on Modelling, Simulation, Verification and Validation of Enterprise Information S

View full text Add to dashboard Cite

Interorganizational workflows represent a special type of workflows that involve more than one organization. In this paper, an interorganizational workflow will be modelled using a special class of nested Petri nets, dynamic interorganizational workflow nets (DIWF-nets). DIWF-nets can model interorganizational workflows in which some of the local workflows can be removed, during the execution of the workflow, due to exceptional situations. Our approach permits a clear distinction between the component workflows and the communication structure. The paper defines a notion of behavioural correctness (soundness) and proves this property is decidable for DIWF-nets. loosely coupled interorganizational workflows: the component workflows behave independently, but need to interact in order to accomplish a global business goal. The interaction is made through asynchronous or synchronous communication. Dynamic interorganizational workflow nets (DIWF-nets) are introduced as a special case of nested Petri nets, in which every local workflow is modelled as a distinct object-net. For the modelling of a local workflow we use extended workflow nets, a version of the workflow nets introduced in [1]. The communication mechanisms between the local workflows are also described using an object-net. Thus, our approach offers a modular view over the components of an interorganizational workflow. In our model the structure of the interorganizational workflow can change during its execution, as the local workflows can be dynamically removed at certain points. The paper introduces a notion of behavioural correctness for DIWF-nets, soundness, and proves this property is decidable.In what follows we will give the basic terminology and notation concerning workflow nets, a Petri net formalism which has been used for the modelling of workflows [1]. We assume the reader is familiar with the Petri net terminology and notation details can be found in [12].A workflow net (WF-net) is a Petri net with two special places: a source place, i, and a sink place, o. In a WF-net, all places and transitions should be on a path from i to o. The two conditions are expressed formally as follows:A Petri net PN=(P,T,F) is a WF-net iff: (1) PN has a source place i and a sink place o such that • i = ∅ and o • = ∅.(2) If we add a new transition t * to PN such that • t * = {o} and t * • = {i}, then the resulted Petri net is strongly connected.A marking of a WF-net is a multiset m : P → IN (where IN denotes the set of natural numbers). We write m = 1 ′ p 1 +2 ′ p 2 for a marking m with m(p 1 ) = 1, m(p 2 ) = 2 and m(p) = 0, ∀p ∈ P − {p 1 , p 2 }. The marking 1 ′ i represents the initial marking of the net, and it is also denoted by i. The marking 1 ′ o, represents the end of the workflow process (and the final marking of the net, denoted by o).The rest of the paper is organized as follows: Section 2 presents an introductory example of a DIWF-net, Section 3 introduces DIWF-nets, Section 4 defines and studies the soundness property for DIWF-nets, Section 5 presents some...

show abstract

Section: Definition 2 a Dynamic Interorganizational Workflow Net Diwmentioning

confidence: 99%

Section: Definition 2 a Dynamic Interorganizational Workflow Net Diwmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

A Petri Net Based Approach for Modelling and Analyzing Interorganizational Workflows with Dynamic Structure

Prisecaru¹

2009

Proceedings of the 7th International Workshop on Modelling, Simulation, Verification and Validation of Enterprise Information S

View full text Add to dashboard Cite

show abstract

“…Nested Petri Nets [21] also have nets as tokens, that can evolve autonomously, move along the system net, synchronize with each other or synchronize with the system net (vertical synchronization steps). Nested nets are more expressive than ν-PN.…”

Section: Introductionmentioning

confidence: 99%

Decidability Problems in Petri Nets with Names and Replication

Rosa-Velardo

Frutos-Escrig²

2010

Fundamenta Informaticae

View full text Add to dashboard Cite

We prove several decidability and undecidability results for ν-PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of reachability, by reducing reachability in nets with inhibitor arcs to it. Thus, the expressive power of ν-PN strictly surpasses that of P/T nets. We prove that ν-PN are Well Structured Transition Systems. In particular, we obtain decidability of coverability and termination, so that the expressive power of Turing machines is not reached. Moreover, they are strictly Well Structured, so that the boundedness problem is also decidable. We consider two properties, width-boundedness and depth-boundedness, that factorize boundedness. Width-boundedness has already been proved to be decidable. We prove here undecidability of depth-boundedness. Finally, we obtain Ackermann-hardness results for all our decidable decision problems.

show abstract

Reference and Value Semantics Are Equivalent for Ordinary Object Petri Nets

Köhler

Rölke

2005

Applications and Theory of Petri Nets 2005

View full text Add to dashboard Cite

Nested Petri Nets — a Formalism for Specification and Verification of Multi-Agent Distributed Systems

Cited by 68 publications

References 16 publications

A Petri Net Based Approach for Modelling and Analyzing Interorganizational Workflows with Dynamic Structure

A Petri Net Based Approach for Modelling and Analyzing Interorganizational Workflows with Dynamic Structure

Decidability Problems in Petri Nets with Names and Replication

Reference and Value Semantics Are Equivalent for Ordinary Object Petri Nets

Contact Info

Product

Resources

About