Results 1  10
of
17
Extending BPMN for Modeling Complex Choreographies
"... Capturing the interaction behavior between two or more business parties has major importance in the context of businesstobusiness (B2B) process integration. The Business Process Modeling Notation (BPMN), being the defacto standard for modeling intraorganizational processes, also includes capabili ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
Capturing the interaction behavior between two or more business parties has major importance in the context of businesstobusiness (B2B) process integration. The Business Process Modeling Notation (BPMN), being the defacto standard for modeling intraorganizational processes, also includes capabilities for describing crossorganizational collaboration. However, as this paper will show, BPMN fails to capture advanced choreography scenarios. Therefore, this paper proposes extensions to broaden the applicability of BPMN. The proposal is validated using the Service Interaction Patterns.
Instance Isolation Analysis for ServiceOriented Architectures
 in: Proceedings of the IEEE 2008 International Conference on Services Computing (SCC), IEEE Computer Society
, 2008
"... When a service engages in multiple conversations concurrently, incoming messages must be correlated with messages previously sent or received. Languages such as BPEL incorporate correlation as firstclass citizen. However, current verification and testing techniques for service implementations large ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
(Show Context)
When a service engages in multiple conversations concurrently, incoming messages must be correlated with messages previously sent or received. Languages such as BPEL incorporate correlation as firstclass citizen. However, current verification and testing techniques for service implementations largely ignore possible correlation anomalies as they typically focus on isolated conversations. This paper defines the notion of instance isolation and shows how to check this property. For doing so it introduces ν∗nets, a Petri net extension with name creation and name passing. 1
Decidability and Complexity of Petri Nets with Unordered Data
, 2011
"... 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 s ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
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 encode νPN into Petri Data Nets, so that coverability, termination and boundedness are decidable. Moreover, we obtain Ackermannhardness results for all our decidable decision problems. Then we consider two properties, widthboundedness and depthboundedness, that factorize boundedness. Widthboundedness has already been proven to be decidable. Here we prove that its complexity is also non primitive recursive. Then we prove undecidability of depthboundedness. Finally, we prove that the corresponding “place version” of all the boundedness problems are undecidable for νPN. These results carry over to Petri Data Nets.
F.: Towards Efficient Verification of Systems with Dynamic Process Creation
"... Abstract. Modelling and analysis of dynamic multithreaded state systems often encounters obstacles when one wants to use automated verification methods, such as model checking. Our aim in this paper is to develop a technical device for coping with one such obstacle, namely that caused by dynamic pr ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
Abstract. Modelling and analysis of dynamic multithreaded state systems often encounters obstacles when one wants to use automated verification methods, such as model checking. Our aim in this paper is to develop a technical device for coping with one such obstacle, namely that caused by dynamic process creation. We first introduce a general class of coloured Petri nets—not tied to any particular syntax or approach—allowing one to capture systems with dynamic (and concurrent) process creation as well as capable of manipulating data. Following this, we introduce the central notion of our method which is a marking equivalence that can be efficiently computed and then used, for instance, to aggregate markings in a reachability graph. In some situations, such an aggregation may produce a finite representation of an infinite state system which still allows one to establish the relevant behavioural properties. We show feasibility of the method on an example and provide initial experimental results.
Languagebased Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data
"... We apply language theory to compare the expressive power of models that extend Petri nets with features like colored tokens and/or whole place operations. Specifically, we consider extensions of Petri nets with transfer and reset operations defined for black indistinguishable tokens (Affine WellSt ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
(Show Context)
We apply language theory to compare the expressive power of models that extend Petri nets with features like colored tokens and/or whole place operations. Specifically, we consider extensions of Petri nets with transfer and reset operations defined for black indistinguishable tokens (Affine WellStructured Nets), extensions in which tokens carry pure names dynamically generated with special νtransitions (νAPN), and extensions in which tokens carry data taken from a linearly ordered domain (Data nets and CMRS). These models are wellstructured transitions systems. In order to compare these models we consider the families of languages they recognize, using coverability as accepting condition. With this criterion, we prove that νAPNs are in between AWNs and Data Nets/CMRS. Moreover, we prove that the family of languages recognized by νAPNs satisfies a good number of closure properties, being a semifull AFL. These results extend the currently known classification of the expressive power of wellstructured transition systems with new closure properties and new relations between extensions of Petri nets.
Ordinal Theory for Expressiveness of Well Structured Transition Systems
"... Abstract. To the best of our knowledge, we characterize for the first time the importance of resources (counters, channels, alphabets) when measuring expressiveness of WSTS. We establish, for usual classes of wpos, the equivalence between the existence of order reflections (nonmonotonic order embedd ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
Abstract. To the best of our knowledge, we characterize for the first time the importance of resources (counters, channels, alphabets) when measuring expressiveness of WSTS. We establish, for usual classes of wpos, the equivalence between the existence of order reflections (nonmonotonic order embeddings) and the simulations with respect to coverability languages. We show that the nonexistence of order reflections can be proved by the computation of order types. This allows us to solve some open problems and to unify the existing proofs of the WSTS classification.
Extending the Rackoff technique to affine nets
, 2012
"... We study the possibility of extending the Rackoff technique to Affine nets, which are Petri nets extended with affine functions. The Rackoff technique has been used for establishing Expspace upper bounds for the coverability and boundedness problems for Petri nets. We show that this technique can be ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
We study the possibility of extending the Rackoff technique to Affine nets, which are Petri nets extended with affine functions. The Rackoff technique has been used for establishing Expspace upper bounds for the coverability and boundedness problems for Petri nets. We show that this technique can be extended to strongly increasing Affine nets, obtaining better upper bounds compared to known results. The possible copies between places of a strongly increasing Affine net make this extension nontrivial. One cannot expect similar results for the entire class of Affine nets since coverability is Ackermannhard and boundedness is undecidable. Moreover, it can be proved that model checking a logic expressing generalized coverability properties is undecidable for strongly increasing Affine nets, while it is known to be Expspacecomplete for Petri nets.
Dynamic soundness in ResourceConstrained Workflow Nets
"... Workflow Petri nets (wfnets) are an important formalism for the modeling of business processes. For them we are typically interested in the soundness problem, that intuitively consists in deciding whether several concurrent executions can always terminate properly. ResourceConstrained Workflow Net ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Workflow Petri nets (wfnets) are an important formalism for the modeling of business processes. For them we are typically interested in the soundness problem, that intuitively consists in deciding whether several concurrent executions can always terminate properly. ResourceConstrained Workflow Nets (rcfwnets) are wfnets enriched with static places, that model global resources. In this paper we prove the undecidability of soundness for rcwfnets when there may be several static places and in which instances are allowed to terminate having created or consumed resources. In order to have a clearer presentation of the proof, we define an asynchronous version of a class of Petri nets with dynamic name creation. Then, we prove that reachability is undecidable for them, and reduce it to dynamic soundness in rcwfnets. Finally, we prove that if we restrict our class of rcwfnets, assuming in particular that a single instance is sound when it is given infinitely many global resources, then dynamic soundness is decidable by reducing it to the home space problem in P/T nets for a linear set of markings.
Decidability results for restricted models of Petri nets with name creation and replication
, 2009
"... In previous works we defined νAPNs, an extension of P/T nets with the capability of creating and managing pure names. We proved that, though reachability is undecidable, coverability remains decidable for them. We also extended P/T nets with the capability of nets to replicate themselves, creatin ..."
Abstract
 Add to MetaCart
(Show Context)
In previous works we defined νAPNs, an extension of P/T nets with the capability of creating and managing pure names. We proved that, though reachability is undecidable, coverability remains decidable for them. We also extended P/T nets with the capability of nets to replicate themselves, creating a new component, initially marked in some fixed way, obtaining gRN systems. We proved that these two extensions of P/T nets are equivalent, so that gRN systems have undecidable reachability and decidable coverability. Finally, for the class of the so called νRN systems, P/T nets with both name creation and replication, we proved that they are Turing complete, so that also coverability turns out to be undecidable. In this paper we study how can we restrict the models of νAPNs (and, therefore, gRN systems) and νRN systems in order to keep decidability of reachability and coverability, respectively. We prove that if we forbid synchronizations between the different components in a gRN system, then reachability is still decidable. The proof is done by reducing it to reachability in a class of multiset rewriting systems, similar to Recursive Petri Nets. Analogously, if we forbid name communication between the different components in a νRN system, or restrict communication to happen only for a given finite set of names, we obtain decidability of coverability.
Forward analysis for Petri nets with name creation
"... Pure names are identifiers with no relation between them, except equality and inequality. In previous works we have extended P/T nets with the capability of creating and managing pure names, obtaining νAPNs and proved that they are strictly well structured (WSTS), so that coverability and boundedn ..."
Abstract
 Add to MetaCart
(Show Context)
Pure names are identifiers with no relation between them, except equality and inequality. In previous works we have extended P/T nets with the capability of creating and managing pure names, obtaining νAPNs and proved that they are strictly well structured (WSTS), so that coverability and boundedness are decidable. Here we use the framework recently developed by Finkel and GoubaultLarrecq for forward analysis for WSTS, in the case of νAPNs, to compute the cover, that gives a good over approximation of the set of reachable markings. We prove that the least complete domain containing the set of markings is effectively representable. Moreover, we prove that in the completion we can compute least upper bounds of simple loops. Therefore, a forward KarpMiller procedure that computes the cover is applicable. However, we prove that in general the cover is not computable, so that the procedure is nonterminating in general. As a corollary, we obtain the analogous result for Transfer Data nets and Data Nets. Finally, we show that a slight modification of the forward analysis yields decidability of a weak form of boundedness called widthboundedness.