Discovering Duplicate Tasks in Transition Systems for the Simplification of Process Models

Pedro, Javier de San; Cortadella, Jordi

doi:10.1007/978-3-319-45348-4_7

Cited by 11 publications

(26 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Furthermore, the use of new approaches and the combination of process mining with other types of analysis techniques to handle problems are other research goals. In addition, studies have so far been conducted in the context of information systems that only include information flows [1], [4], [6], [20], [50], [81], [92]. In this research, we intend to answer this question: Are the previous methods of process model discovery, applicable in other different domain which contains various flows?…”

Section: Introductionmentioning

confidence: 99%

Motivations for Obtaining and Redeeming Coupons from a Coupon App: Customer Value Perspective

Esmaeili¹,

Golpayegani²

2021

J. theor. appl. electron. commer. res.

View full text Add to dashboard Cite

Process mining in the context of information systems, which consists of information flows, has been one of the major research areas in the past decade. One of the most common objectives of process mining is the automated business process discovery. There are many challenges in the business process discovery, such as spaghetti models, same-name activities, and discovering loop structures. The researchers have presented a variety of methods that focus on one or more challenges. Due to the importance of commercial systems and the diversity of flows in them, in this research, the process mining problem in the context of social commerce systems is studied. Moreover, the research objective is to present a new method for commercial process discovery that has not been considered before. The proposed method is based on network analysis methods, multi-layered networks (networks with heterogeneous relations), and attributed networks. The results obtained from the proposed method are more precise and more comfortable to understand than the previous ones.

show abstract

Section: Introductionmentioning

confidence: 99%

Motivations for Obtaining and Redeeming Coupons from a Coupon App: Customer Value Perspective

Esmaeili¹,

Golpayegani²

2021

J. theor. appl. electron. commer. res.

View full text Add to dashboard Cite

show abstract

“…Other technologies [5,9,10,12,15,16] simplify process models through the activity level. [15] identifies and filters out chaotic activities that could happen at any stage within a trace from logs and [5] aggregates activities from different systems using the map-reduce algorithm.…”

Section: Introductionmentioning

confidence: 99%

“…[15] identifies and filters out chaotic activities that could happen at any stage within a trace from logs and [5] aggregates activities from different systems using the map-reduce algorithm. Duplicate tasks, which refer to different tasks that have been improperly tagged with the same label, are identified to reduce the complexity of models [12]. Event abstraction technology [9,10,16] abstracts low-level events (e.g.…”

Section: Introductionmentioning

confidence: 99%

Discovering Redundant Activities in Event Logs for the Simplification of Process Models

Chen,

Lu,

Poon

2021

Preprint

View full text Add to dashboard Cite

Process mining acts as a valuable tool to analyse the behaviour of an organisation by offering techniques to discover, monitor and enhance real processes. The key to process mining is to discovery understandable process models. However, real-life logs can be complex with redundant activities, which share similar behaviour but have different syntax. The existence of redundant activities heavily affects the quality of discovered process models. Existing approaches filter activities by frequency, which cannot solve problems caused by redundant activities. In this paper, we propose first to discover redundant activities in the log and, then, use the discovery results to simplify event logs. Two publicly available data sets are used to evaluate the usability of our approach in real-life processes. Our approach can be adopted as a preprocessing step before applying any discovery algorithms to produce simplify models.

show abstract

“…Label splitting [7,6,13,17], as indicated above, may lead to large Petri nets with as many transitions as there are edges in the LTS. We hope to avoid this by allowing over-approximations of behaviour, i.e.…”

Section: Introductionmentioning

confidence: 99%

Optimal Label Splitting for Embedding an LTS into an arbitrary Petri Net Reachability Graph is NP-complete

Schlachter,

Wimmel

2020

Preprint

View full text Add to dashboard Cite

For a given labelled transition system (LTS), synthesis is the task to find an unlabelled Petri net with an isomorphic reachability graph. Even when just demanding an embedding into a reachability graph instead of an isomorphism, a solution is not guaranteed. In such a case, label splitting is an option, i.e. relabelling edges of the LTS such that differently labelled edges remain different. With an appropriate label splitting, we can always obtain a solution for the synthesis or embedding problem. Using the label splitting, we can construct a labelled Petri net with the intended bahaviour (e.g. embedding the given LTS in its reachability graph). As the labelled Petri net can have a large number of transitions, an optimisation may be desired, limiting the number of labels produced by the label splitting. We show that such a limitation will turn the problem from being solvable in polynomial time into an NP-complete problem.

show abstract

Discovering Duplicate Tasks in Transition Systems for the Simplification of Process Models

Cited by 11 publications

References 19 publications

Motivations for Obtaining and Redeeming Coupons from a Coupon App: Customer Value Perspective

Motivations for Obtaining and Redeeming Coupons from a Coupon App: Customer Value Perspective

Discovering Redundant Activities in Event Logs for the Simplification of Process Models

Optimal Label Splitting for Embedding an LTS into an arbitrary Petri Net Reachability Graph is NP-complete

Contact Info

Product

Resources

About