Discovering directly-follows complete Petri nets from event data

DOI10.1007/978-3-031-15629-8_29zbMath1524.68222OpenAlexW4297922704MaRDI QIDQ6163901

Wil M. P. van der Aalst

Publication date: 26 July 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-15629-8_29

zbMATH Keywords

Petri netsprocess modelsprocess discovery

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Partial (set) 2-structures. I: Basic notions and the representation problems
• Discovering workflow nets using integer linear programming
• A Theory of History Dependent Abstractions for Learning Interface Automata
• Process Discovery Using Integer Linear Programming
• Process Mining from a Basis of State Regions
• Automata Learning through Counterexample Guided Abstraction Refinement
• Free Choice Petri Nets
• Discovering Block-Structured Process Models from Event Logs - A Constructive Approach
• Finding Complex Process-Structures by Exploiting the Token-Game

This page was built for publication: Discovering directly-follows complete Petri nets from event data