Synthesis of WFN from Reduced Event Logs Based on Event Precedence Structures

This paper presents a method to build workflow nets (WFN), a subclass of Petri nets, from sets of event traces (called event logs) based on event precedence structures. An event log <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\boldsymbol{\lambda}$</tex> is partitioned into sub-logs <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\boldsymbol{\lambda}_{\mathbf{i}}$</tex> containing few traces that have common sub-sequences of length two or more events. Event precedence structures are defined to represents the sub-logs; they are structures similar to partial order relations that are derived from event precedence relations drawn from traces. The method includes several steps regarding the building of the event structures and a technique for the synthesis of the WFN.