scholarly journals An Approach for Repairing Process Models Based on Logic Petri Nets

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 29926-29939 ◽  
Author(s):  
Xize Zhang ◽  
Yuyue Du ◽  
Liang Qi ◽  
Haichun Sun
Keyword(s):  
2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Cong Liu ◽  
Huiling Li ◽  
Qingtian Zeng ◽  
Ting Lu ◽  
Caihong Li

To support effective emergency disposal, organizations need to collaborate with each other to complete the emergency mission that cannot be handled by a single organization. In general, emergency disposal that involves multiple organizations is typically organized as a group of interactive processes, known as cross-organization emergency response processes (CERPs). The construction of CERPs is a time-consuming and error-prone task that requires practitioners to have extensive experience and business background. Process mining aims to construct process models by analyzing event logs. However, existing process mining techniques cannot be applied directly to discover CERPs since we have to consider the complexity of various collaborations among different organizations, e.g., message exchange and resource sharing patterns. To tackle this challenge, a CERP model mining method is proposed in this paper. More specifically, we first extend classical Petri nets with resource and message attributes, known as resource and message aware Petri nets (RMPNs). Then, intra-organization emergency response process (IERP) models that are represented as RMPNs are discovered from emergency drilling event logs. Next, collaboration patterns among emergency organizations are formally defined and discovered. Finally, CERP models are obtained by merging IERP models and collaboration patterns. Through comparative experimental evaluation using the fire emergency drilling event log, we illustrate that the proposed approach facilitates the discovery of high-quality CERP models than existing state-of-the-art approaches.


IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 53796-53810 ◽  
Author(s):  
Xize Zhang ◽  
Yuyue Du ◽  
Liang Qi ◽  
Haichun Sun
Keyword(s):  

Author(s):  
Pnina Soffer ◽  
Maya Kaner ◽  
Yair Wand

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.


IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 13106-13120 ◽  
Author(s):  
Wentai Zheng ◽  
Yuyue Du ◽  
Liang Qi ◽  
Lu Wang
Keyword(s):  

Author(s):  
Jens Lemcke ◽  
Andreas Friesen ◽  
Tirdad Rahmani

This chapter provides a formal specification of non-atomic, relaxed action refinement suited for component-based business process engineering. Engineering a business process involves multiple process models created by different people on different levels of abstractions. Keeping the models consistent during the engineering procedure—refinement validation—is one objective of this chapter. In component-based software engineering, the lowest abstraction of a business process is mapped on existing components that have a description of their behaviors. Checking the consistency of process and component behavior—grounding validation—is the second objective. Both refinement and grounding validation increase the robustness of business process implementations and the productivity of process engineers. Technically, the specification given in this chapter is in terms of deadlock analysis in safe Petri nets. The evaluation of this straight-forward implementation underlines the exponential complexity of deadlock analysis in safe Petri nets. For use cases with more than 30 activities per process or heavy parallelism, optimized implementations are needed.


1987 ◽  
Vol 10 (2) ◽  
pp. 161-211
Author(s):  
Eike Best ◽  
Agathe Merceron

A non-sequential process can be modelled by a partially ordered set. Conversely, one is led to study the properties to be fulfilled by a poset so that it can reasonably be viewed as the model of a non-sequential process. To this end, C.A. Petri has proposed a set of con currency axioms and a related property called D-continuity, a generalised version for partially ordered sets of Dedekind’s completeness property of the real numbers. In this paper we study Petri’s axioms of concurrency and some of their interdependencies. We also derive several characterisations of D-continuity and exhibit its relation with the axioms of concurrency. Furthermore we apply our work to Petri nets: we introduce occurrence nets, some special posets which model the processes of a system net and we present their relations to D-continuity and the axioms of con currency. Finally we identify the class of the system nets whose processes are D-continuous and satisfy the axioms of concurrency.


Sign in / Sign up

Export Citation Format

Share Document