Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Free choice Petri nets
The Synthesis Problem of Petri Nets
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
An introduction to event structures
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Workflow Mining: Discovering Process Models from Event Logs
IEEE Transactions on Knowledge and Data Engineering
Characterizing Workflow Nets Using Regions
SYNASC '06 Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Process discovery and petri nets†
Mathematical Structures in Computer Science
Process Mining: Discovery, Conformance and Enhancement of Business Processes
Process Mining: Discovery, Conformance and Enhancement of Business Processes
Discovering block-structured process models from event logs - a constructive approach
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
| Hi-index | 0.00 |
The process mining algorithm α was introduced by van der Aalst et al. for the discovery of workflow nets from event logs. This algorithm was presented in the context of structured workflow nets even though it was recognized that more wokflow nets should be reconstructible. In this paper we assess α algorithm and provide a more precise description of the class of workflow nets reconstructible by α.