Simplifying spaghetti processes to find the frequent execution paths
dc.contributor.author | Manoj, Kumar, M.V. | |
dc.contributor.author | Thomas, L. | |
dc.contributor.author | Annappa, B. | |
dc.date.accessioned | 2020-03-30T09:46:34Z | |
dc.date.available | 2020-03-30T09:46:34Z | |
dc.date.issued | 2018 | |
dc.description.abstract | Control-flow discovery algorithms of Process Mining are capable of generating excellent process models until the process is structured (less number of activities and paths connecting between them). Otherwise, process model with Spaghetti structure will be generated. These models are unstructured, incomprehensible and cannot be used for operational support. This paper proposes the techniques for (1) converting Spaghetti (unstructured) process to Lasagna (structured) process, and (2) Identifying the frequent execution paths in the process under consideration. � 2018, Springer Nature Singapore Pte Ltd. | en_US |
dc.identifier.citation | Smart Innovation, Systems and Technologies, 2018, Vol.79, , pp.693-701 | en_US |
dc.identifier.uri | https://idr.nitk.ac.in/handle/123456789/6989 | |
dc.title | Simplifying spaghetti processes to find the frequent execution paths | en_US |
dc.type | Book chapter | en_US |