Abstract
This paper addresses the problem of discovering a sound Workflow net (WFN) from event traces representing the behavior of a discrete event process. A novel and efficient method for inferring the repetitive behaviour in a workflow log is proposed. It is based on an iterative search and filtering of cycles computed in each trace; a graph of causal relations is built for each cycle, which helps to find the supports of the t-invariants of an extended WFN. The t-invariants are used for determining causal and concurrent relations between events, allowing building the WFN efficiently in a complete discovery technique.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
