Aggregating Causal Runs into Workflow Nets

DOI10.1007/978-3-642-35179-2_14zbMath1377.68154OpenAlexW2128947279WikidataQ57004999 ScholiaQ57004999MaRDI QIDQ4909355

Jörg Desel, Wil M. P. van der Aalst, Boudewijn van Dongen

Publication date: 13 March 2013

Published in: Transactions on Petri Nets and Other Models of Concurrency VI (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-35179-2_14

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of organizations, manpower planning in operations research (90B70)

Related Items (3)

Concurrency and objects matter! Disentangling the fabric of real operational processes to create digital twins ⋮ Process Mining Reloaded: Event Structures as a Unified Representation of Process Models and Event Logs ⋮ Discovering Object-centric Petri Nets

Cites Work

• Soundness of workflow nets: classification, decidability, and analysis
• Partial (set) 2-structures. I: Basic notions and the representation problems
• The synthesis problem of Petri nets
• Process Mining
• Synthesis of Petri Nets from Term Based Representations of Infinite Partial Languages
• Towards Synthesis of Petri Nets from Scenarios
• Process Discovery using Integer Linear Programming
• Formal Methods in Software and Systems Modeling
• Applications and Theory of Petri Nets 2005
• Unnamed Item
• Unnamed Item

This page was built for publication: Aggregating Causal Runs into Workflow Nets