Process Mining Reloaded: Event Structures as a Unified Representation of Process Models and Event Logs

DOI10.1007/978-3-319-19488-2_2zbMath1432.68304OpenAlexW1166744040MaRDI QIDQ2941141

Marlon Dumas, Luciano García-Bañuelos

Publication date: 27 August 2015

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-319-19488-2_2

Mathematics Subject Classification ID

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

Related Items (5)

Discovering unseen behaviour from event logs ⋮ Characterising spectra of equivalences for event structures, logically ⋮ Concurrent semantics for fusions: weak prime domains and connected event structures ⋮ Minimisation of event structures ⋮ Firing partial orders in a Petri net

Cites Work

• Petri nets, event structures and domains. I
• An improvement of McMillan's unfolding algorithm
• Contextual Petri nets, asymmetric event structures, and processes
• Process Mining
• Process Discovery using Integer Linear Programming
• Aggregating Causal Runs into Workflow Nets
• New Region-Based Algorithms for Deriving Bounded Petri Nets
• Discovering Block-Structured Process Models from Event Logs - A Constructive Approach

This page was built for publication: Process Mining Reloaded: Event Structures as a Unified Representation of Process Models and Event Logs