z-logo
open-access-imgOpen Access
Workflow Mining: Discovering Loops in Process Models
Author(s) -
V. R. Kavitha,
R. Kavitha,
Naveen Kumar
Publication year - 2011
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/2591-3591
Subject(s) - computer science , workflow , process (computing) , data science , data mining , information retrieval , database , programming language
The growing complexity of processes in many organizations stimulates the adoption of business process management techniques. Process models typically lie at the basis of these techniques and generally, the assumption is made that the operational business processes as they are taking place in practice confirm to these models. Technologies such as workflow management, Enterprise Resource Planning (ERP) etc., typically focus on the realization of it [1], [2], [8]. The current research in process mining still has problems in mining some common constructs in workflow models. Among these constructs are loops. Because loops are the major concern for boundedness of any process model. This paper discusses about representing workflow model using Petri Nets and a method to identify loops. For identifying loops topological sorting is used. In the literature process logs are used to identify short loops of length two but the proposed algorithm identify loops of any length.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom