Discovering object-centric Petri nets
From MaRDI portal
Publication:4988950
Abstract: Techniques to discover Petri nets from event data assume precisely one case identifier per event. These case identifiers are used to correlate events, and the resulting discovered Petri net aims to describe the life-cycle of individual cases. In reality, there is not one possible case notion, but multiple intertwined case notions. For example, events may refer to mixtures of orders, items, packages, customers, and products. A package may refer to multiple items, multiple products, one order, and one customer. Therefore, we need to assume that each event refers to a collection of objects, each having a type (instead of a single case identifier). Such object-centric event logs are closer to data in real-life information systems. From an object-centric event log, we want to discover an object-centric Petri net with places that correspond to object types and transitions that may consume and produce collections of objects of different types. Object-centric Petri nets visualize the complex relationships among objects from different types. This paper discusses a novel process discovery approach implemented in PM4Py. As will be demonstrated, it is indeed feasible to discover holistic process models that can be used to drill-down into specific viewpoints if needed.
Recommendations
Cites work
- scientific article; zbMATH DE number 1302048 (Why is no real title available?)
- scientific article; zbMATH DE number 713962 (Why is no real title available?)
- A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
- Aggregating causal runs into workflow nets
- Applying regions
- Coloured Petri Nets
- Deriving Petri nets from finite transition systems
- Discovering block-structured process models from event logs -- a constructive approach
- Discovering workflow nets using integer linear programming
- Modeling business processes. A Petri net-oriented approach
- Models from scenarios
- New Region-Based Algorithms for Deriving Bounded Petri Nets
- On the Synthesis of Zero-Safe Nets
- Petri net synthesis
- Process mining from a basis of state regions
- Regions of Petri nets with a/sync connections
- Soundness of workflow nets: classification, decidability, and analysis
- Synthesis of Petri Nets from Term Based Representations of Infinite Partial Languages
- Synthesis of Petri nets from finite partial languages
- The synthesis problem of Petri nets
- Towards Synthesis of Petri Nets from Scenarios
Cited in
(10)- Concurrency and objects matter! Disentangling the fabric of real operational processes to create digital twins
- Object-Centric Replay-Based Conformance Checking: Unveiling Desire Lines and Local Deviations
- Comparing concepts of object Petri net formalisms
- Object-Centric Process Mining: Dealing with Divergence and Convergence in Event Data
- Correctness Notions for Petri Nets with Identifiers
- Improving the non‐compensatory trace‐clustering decision process
- Data and process resonance. Identifier soundness for models of information systems
- Exact and approximated log alignments for processes with inter-case dependencies
- There and back again. On the reconstructability and rediscoverability of typed Jackson nets
- Inferring unobserved events in systems with shared resources and queues
This page was built for publication: Discovering object-centric Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4988950)
