scholarly journals Research of Workflow nets Application Based on the Petri nets

2012 ◽  
Author(s):  
Dabin Qi ◽  
Jun Yao ◽  
Qiuju Li
Keyword(s):  
Petri Nets ◽  
Workflow Nets

Assigning Ontological Meaning to Workflow Nets

2012 ◽  
pp. 209-244
Author(s):  
Pnina Soffer ◽  
Maya Kaner ◽  
Yair Wand
Keyword(s):  
Petri Nets ◽  
Business Process ◽  
Business Processes ◽  
Process Models ◽  
Actual Process ◽  
Workflow Nets ◽  
Business Process Models ◽  
Business Goals ◽  
General Constraints ◽  
Process Behavior

A common way to represent organizational domains is the use of business process models. A Workflow-net (WF-net) is an application of Petri Nets (with additional rules) that model business process behavior. However, the use of WF-nets to model business processes has some shortcomings. In particular, no rules exist beyond the general constraints of WF-nets to guide the mapping of an actual process into a net. Syntactically correct WF-nets may provide meaningful models of how organizations conduct their business processes. Moreover, the processes represented by these nets may not be feasible to execute or reach their business goals when executed. In this paper, the authors propose a set of rules for mapping the domain in which a process operates into a WF-net, which they derived by attaching ontological semantics to WF-nets. The rules guide the construction of WF-nets, which are meaningful in that their nodes and transitions are directly related to the modeled (business) domains. Furthermore, the proposed semantics imposes on the process models constraints that guide the development of valid process models, namely, models that assure that the process can accomplish its goal when executed.

scholarly journals The Equivalency between Logic Petri Workflow Nets and Workflow Nets

2015 ◽  
Vol 2015 ◽  
pp. 1-7
Author(s):  
Jing Wang ◽  
ShuXia Yu ◽  
YuYue Du
Keyword(s):  
Data Mining ◽  
Electronic Commerce ◽  
Petri Nets ◽  
Business Process ◽  
Process Mining ◽  
Batch Processing ◽  
Cooperative Systems ◽  
Modeling And Analysis ◽  
Workflow Nets

Logic Petri nets (LPNs) can describe and analyze batch processing functions and passing value indeterminacy in cooperative systems. Logic Petri workflow nets (LPWNs) are proposed based on LPNs in this paper. Process mining is regarded as an important bridge between modeling and analysis of data mining and business process. Workflow nets (WF-nets) are the extension to Petri nets (PNs), and have successfully been used to process mining. Some shortcomings cannot be avoided in process mining, such as duplicate tasks, invisible tasks, and the noise of logs. The online shop in electronic commerce in this paper is modeled to prove the equivalence between LPWNs and WF-nets, and advantages of LPWNs are presented.

Assigning Ontological Meaning to Workflow Nets

2010 ◽  
Vol 21 (3) ◽  
pp. 1-35 ◽  
Author(s):  
Pnina Soffer ◽  
Maya Kaner ◽  
Yair Wand
Keyword(s):  
Petri Nets ◽  
Business Process ◽  
Business Processes ◽  
Process Models ◽  
Actual Process ◽  
Workflow Nets ◽  
Business Process Models ◽  
Business Goals ◽  
General Constraints ◽  
Process Behavior

A common way to represent organizational domains is the use of business process models. A Workflow-net (WF-net) is an application of Petri Nets (with additional rules) that model business process behavior. However, the use of WF-nets to model business processes has some shortcomings. In particular, no rules exist beyond the general constraints of WF-nets to guide the mapping of an actual process into a net. Syntactically correct WF-nets may provide meaningful models of how organizations conduct their business processes. Moreover, the processes represented by these nets may not be feasible to execute or reach their business goals when executed. In this paper, the authors propose a set of rules for mapping the domain in which a process operates into a WF-net, which they derived by attaching ontological semantics to WF-nets. The rules guide the construction of WF-nets, which are meaningful in that their nodes and transitions are directly related to the modeled (business) domains. Furthermore, the proposed semantics imposes on the process models constraints that guide the development of valid process models, namely, models that assure that the process can accomplish its goal when executed.

scholarly journals An analytical method for well-formed workflow/Petri net verification of classical soundness

2014 ◽  
Vol 24 (4) ◽  
pp. 931-939 ◽  
Author(s):  
Julio Clempner
Keyword(s):  
Dynamical Systems ◽  
Petri Nets ◽  
Petri Net ◽  
Difference Equations ◽  
Analytical Method ◽  
Business Processes ◽  
Formal Model ◽  
Lyapunov Theory ◽  
Workflow Nets ◽  
Workflow Net

Abstract In this paper we consider workflow nets as dynamical systems governed by ordinary difference equations described by a particular class of Petri nets. Workflow nets are a formal model of business processes. Well-formed business processes correspond to sound workflow nets. Even if it seems necessary to require the soundness of workflow nets, there exist business processes with conditional behavior that will not necessarily satisfy the soundness property. In this sense, we propose an analytical method for showing that a workflow net satisfies the classical soundness property using a Petri net. To present our statement, we use Lyapunov stability theory to tackle the classical soundness verification problem for a class of dynamical systems described by Petri nets. This class of Petri nets allows a dynamical model representation that can be expressed in terms of difference equations. As a result, by applying Lyapunov theory, the classical soundness property for workflow nets is solved proving that the Petri net representation is stable. We show that a finite and non-blocking workflow net satisfies the sound property if and only if its corresponding PN is stable, i.e., given the incidence matrix A of the corresponding PN, there exists a Փ strictly positive m vector such that AՓ≤ 0. The key contribution of the paper is the analytical method itself that satisfies part of the definition of the classical soundness requirements. The method is designed for practical applications, guarantees that anomalies can be detected without domain knowledge, and can be easily implemented into existing commercial systems that do not support the verification of workflows. The validity of the proposed method is successfully demonstrated by application examples.

COMPOSITIONAL VERIFICATION FOR WORKFLOW NETS

2006 ◽  
Vol 15 (04) ◽  
pp. 551-570 ◽  
Author(s):  
LI JIAO ◽  
TO-YAT CHEUNG
Keyword(s):  
Petri Nets ◽  
Business Processes ◽  
Extended Model ◽  
Workflow Modeling ◽  
Compositional Verification ◽  
Workflow Nets ◽  
Business Context ◽  
Correctness Criterion ◽  
The Relationship ◽  
Compositional Method

A workflow is the automation of business processes that describe activities in a business context. Petri nets have been widely used as a workflow modeling technique. Workflow nets (WF-nets), introduced by van der Aalst [LNCS1248 (1997) 407–426], are a class of Petri nets tailored towards workflow analysis. Soundness is used as the least correctness criterion for WF-nets in order to ensure that a process can terminate properly. This paper extends WF-nets by considering resources and allowing for multi-cases in a process. For the extended model, the relationship between soundness and standard behavior properties of Petri nets is investigated. A compositional method to construct and verify sound WF-nets is introduced.

A Formal Representation of Collaborative Electronic Commerce Systems by Workflow Nets

2012 ◽  
Vol 170-173 ◽  
pp. 3570-3574
Author(s):  
Wei Liu ◽  
Yu Yue Du ◽  
You Fu ◽  
Chun Yan
Keyword(s):  
Electronic Commerce ◽  
Petri Nets ◽  
Batch Processing ◽  
Colored Petri Nets ◽  
Formal Representation ◽  
Workflow Nets ◽  
Processing Function ◽  
Data Objects

Combining the advantages of logical workflow nets and colored Petri nets, logical and colored workflow nets and collaborative logical and colored workflow nets are presented to facilitate the modeling of cooperative electronic commerce systems. The formal representation presented in this paper can not only describe the data objects, but also represent passing value indeterminacy and batch processing function of cooperative electronic commerce systems.

Modeling Human-Robot Interaction with Petri-Nets

2009 ◽  
Author(s):  
Rosemarie Yagoda ◽  
Michael D. Coovert
Keyword(s):  
Petri Nets ◽  
Human Robot Interaction ◽  
Robot Interaction
Sign in / Sign up

Export Citation Format

Share Document