Abstract
The paper presents a new method for the synthesis of Petri nets from event logs in the area of Process Mining. The method derives a bounded Petri net that over-approximates the behavior of an event log. The most important property is that it produces a net with the smallest behavior that still contains the behavior of the event log. The methods described in this paper have been implemented in a tool and tested on a set of examples. © 2008 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Carmona, J., Cortadella, J., & Kishinevsky, M. (2008). A region-based algorithm for discovering Petri nets from event logs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5240 LNCS, pp. 358–373). Springer Verlag. https://doi.org/10.1007/978-3-540-85758-7_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
