Discovering process models with long-term dependencies while providing guarantees and handling infrequent behavior

DOI10.1007/978-3-031-06653-5_16zbMath1499.68231OpenAlexW4285106015MaRDI QIDQ2165244

Lisa L. Mannel, Wil M. P. van der Aalst

Publication date: 19 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-06653-5_16

zbMATH Keywords

Petri netsprocess discoveryeST-miner

Mathematics Subject Classification ID

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

Related Items (1)

Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Petri net synthesis
• Partial (set) 2-structures. II: State spaces of concurrent systems
• Discovering the ``glue connecting activities. Exploiting monotonicity to learn places faster
• A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
• Process Discovery Using Integer Linear Programming
• Free Choice Petri Nets
• Understanding Petri Nets
• Automated Repair of Process Models Using Non-local Constraints
• Discovering Block-Structured Process Models from Event Logs - A Constructive Approach
• Applications and Theory of Petri Nets 2005
• Finding Complex Process-Structures by Exploiting the Token-Game

This page was built for publication: Discovering process models with long-term dependencies while providing guarantees and handling infrequent behavior