Release 6.13.62 of DiSCover

Today, version 6.13.62 of the DiSCover package has been released. This release introduces a wizard that guides you through the configuration of the DiSCover algorithm. The wizard consists of 8 steps, which are introduced next. As working example we use the example event log from the following paper:

Release 6.13.54 of DiSCover

Today, version 6.13.54 of the DiSCover package has been released. This release fixes an issue when replaying an event log on a net that does not contain a transition for some event. Earlier releases will then throw a null pointer exception as the transition corresponding to the event cannot be found.

Release 6.13.52 of DiSCover

Today, version 6.13.52 of the DiSCover package has been released. This release contains two updates to the DiSCover algorithm: Consistent subgraphs and less spurious silent transitions. 1. Consistent subgraphs The subgraphs as generated by 6.13.52 are now consistent, meaning that they all originate from one and the same filtered directly-follows graph. In 6.12.50, every subgraph Read More …

Discovering an S-Coverable WF-net using DiSCover

Presented at the ICPM 2022 International Conference on Process Mining in Bolzano, Italy, on October 25, 2022 Citation Slides Downloads Both algorithms use an absolute threshold that equals 1, a relative threshold that equals 3, and default values for all other parameters. These thresholds are set in the “Scripts/Discover.txt” file, lines 31 and 32. After Read More …

New Plug-in: DiSCover

ProM 6.12 will contain a new discovery algorithm called DiSCover. This algorithm discovers an accepting Petri net from an event log using a collection of DFGs (Directly Follows Graphs). From every DFG, a state machine WF-net will be discovered which will then be merged by synchronizing them on the visible transitions (that is, on the Read More …