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

DOI10.3233/fi-242168arXiv2212.11047OpenAlexW4391362548WikidataQ129093943 ScholiaQ129093943MaRDI QIDQ6189320

Wil M. P. van der Aalst, Unnamed Author

Publication date: 8 February 2024

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2212.11047

zbMATH Keywords

Petri netsprocess discoverylong-term dependencieseST-Minernon-free choice

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Petri net synthesis
• Partial (set) 2-structures. II: State spaces of concurrent systems
• Discovering process models with long-term dependencies while providing guarantees and handling infrequent behavior
• A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
• Free Choice Petri Nets
• Understanding Petri Nets
• Automated Repair of Process Models Using Non-local Constraints
• Applications and Theory of Petri Nets 2005
• Petri Net Reductions for Counting Markings

This page was built for publication: Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns