Bibliographic Details
| Title: |
Incremental Process Discovery using Petri Net Synthesis. |
| Authors: |
Badouel, Eric1 eric.badouel@inria.fr, Schlachter, Uli2 uli.schlachter@informatik.uni-oldenburg.de |
| Source: |
Fundamenta Informaticae. 2017, Vol. 154 Issue 1-4, p1-13. 13p. |
| Subjects: |
Petri nets, Execution traces (Computer program testing), Linear algebra, Ehrenfeucht, A., Rozenberg, G. |
| Abstract: |
Process discovery aims at constructing a model from a set of observations given by execution traces (a log). Petri nets are a preferred target model in that they produce a compact description of the system by exhibiting its concurrency. This article presents a process discovery algorithm using Petri net synthesis, based on the notion of region introduced by A. Ehrenfeucht and G. Rozenberg and using techniques from linear algebra. The algorithm proceeds in three successive phases which make it possible to find a compromise between the ability to infer behaviours of the system from the set of observations while ensuring a parsimonious model, in terms of fitness, precision and simplicity. All used algorithms are incremental which means that one can modify the produced model when new observations are reported without reconstructing the model from scratch. [ABSTRACT FROM AUTHOR] |
|
Copyright of Fundamenta Informaticae is the property of Polskie Towarzystwo Matematyczne and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
