Finding Complex Process-Structures by Exploiting the Token-Game

DOI10.1007/978-3-030-21571-2_15OpenAlexW2949484632MaRDI QIDQ6144218

Wil M. P. van der Aalst, Unnamed Author

Publication date: 29 January 2024

Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-21571-2_15

zbMATH Keywords

Petri netsprocess discoverylanguage-based regions

Mathematics Subject Classification ID

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

Related Items (4)

Discovering process models with long-term dependencies while providing guarantees and handling infrequent behavior ⋮ From place nets to local process models ⋮ Discovering directly-follows complete Petri nets from event data ⋮ Firing partial orders in a Petri net

Cites Work

• Petri net synthesis
• Partial (set) 2-structures. II: State spaces of concurrent systems
• Discovering the ``glue connecting activities. Exploiting monotonicity to learn places faster
• Process Discovery Using Integer Linear Programming
• Discovering Block-Structured Process Models from Event Logs - A Constructive Approach
• Applications and Theory of Petri Nets 2005
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding Complex Process-Structures by Exploiting the Token-Game