Selected papers of the Second Workshop on Concurrency and compositionality
Concurrent hardware: the theory and practice of self-timed design
Concurrent hardware: the theory and practice of self-timed design
Finite transition systems: semantics of communicating systems
Finite transition systems: semantics of communicating systems
The synthesis problem of Petri nets
Acta Informatica
Deriving Petri Nets from Finite Transition Systems
IEEE Transactions on Computers
Polynomial Algorithms for the Synthesis of Bounded Nets
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Workflow mining: a survey of issues and approaches
Data & Knowledge Engineering
Workflow Mining: Discovering Process Models from Event Logs
IEEE Transactions on Knowledge and Data Engineering
Finding Structure in Unstructured Processes: The Case for Process Mining
ACSD '07 Proceedings of the Seventh International Conference on Application of Concurrency to System Design
A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
ProM 4.0: comprehensive support for real process analysis
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Process mining based on regions of languages
BPM'07 Proceedings of the 5th international conference on Business process management
Divide-and-Conquer Strategies for Process Mining
BPM '09 Proceedings of the 7th International Conference on Business Process Management
A fresh look at precision in process conformance
BPM'10 Proceedings of the 8th international conference on Business process management
Projection approaches to process mining using region-based techniques
Data Mining and Knowledge Discovery
Process mining from a basis of state regions
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Distributed process discovery and conformance checking
FASE'12 Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering
Compact Representations and Efficient Algorithms for Operating Guidelines
Fundamenta Informaticae - Application of Concurrency to System Design, the Eighth Special Issue
Light Region-based Techniques for Process Discovery
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010
Process Discovery using Integer Linear Programming
Fundamenta Informaticae - Petri Nets 2008
Decomposing process mining problems using passages
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Mixing paradigms for more comprehensible models
BPM'13 Proceedings of the 11th international conference on Business Process Management
DPMine/P: modeling and process mining language and ProM plug-ins
Proceedings of the 9th Central & Eastern European Software Engineering Conference in Russia
Decomposing Petri nets for process mining: A generic approach
Distributed and Parallel Databases
Process Discovery and Conformance Checking Using Passages
Fundamenta Informaticae - Application and Theory of Petri Nets and Concurrency, 2012
| Hi-index | 0.00 |
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.