Discovering directly-follows complete Petri nets from event data

DOI10.1007/978-3-031-15629-8_29MaRDI QIDQ6163901zbMATH OpenOpenAlexFDO

Authors W. 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 discoveryprocess models

Mathematics Subject Classification ID

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

Recommendations

• Discovering Petri nets from event logs
• Process discovery and Petri nets
• Discovering the ``glue connecting activities. Exploiting monotonicity to learn places faster
• Discovering block-structured process models from event logs -- a constructive approach
• Incremental process discovery

Cites work

• A theory of history dependent abstractions for learning interface automata
• Automata Learning through Counterexample Guided Abstraction Refinement
• Discovering block-structured process models from event logs -- a constructive approach
• Discovering workflow nets using integer linear programming
• Finding Complex Process-Structures by Exploiting the Token-Game
• Free Choice Petri Nets
• scientific article; zbMATH DE number 1302043 (Why is no real title available?)
• Partial (set) 2-structures. I: Basic notions and the representation problems
• Process Discovery Using Integer Linear Programming
• Process mining from a basis of state regions

Cited in

(1)

• Modelling data-aware stochastic processes -- discovery and conformance checking

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6163901)