Discovering workflow nets of concurrent iterative processes

A novel and efficient method for discovering concurrent workflow processes is presented. It allows building a suitable workflow net (WFN) from a large event log λ λ , which represents the behaviour of complex iterative processes involving concurrency. First, thet-invariants are determined from λ λ ; this allows computing the causal and concurrent relations between the events and the implicit causal relations between events that do not appear consecutively in λ λ . Then a 1-bounded WFN is built, which could be eventually adjusted if itst-invariants do not match with those computed from λ λ . The discovered model allows firing all the traces in λ λ . The procedures derived from the method are polynomial time on |λ | |λ| ; they have been implemented and tested on artificial logs.