SearcharxivSearch

arXiv subjects

Anjo Seidel

Publications and source records attributed to Anjo Seidel.

2 recordsLinked to original sources

Detecting Dynamic Relationships in Object-Centric Event Logs

Object-centric process mining examines how processes interact with multiple co-evolving objects, and has gained great interest in recent years. However, object-centric event logs (OCELs) leave object relationships underspecified in several respects, especially if relationships are dynamic, i.e., they change over time. In this paper, we identify and formally define for the first time assumptions that allow to represent and manipulate dynamic relationships in OCELs in a semantically unambiguous way. We evaluate existing logs to show that our assumptions are often satisfied, ensuring full transparency of relationship semantics.

cs.DB

To bind or not to bind? Discovering Stable Relationships in Object-centric Processes (Extended Version)

Object-centric process mining investigates the intertwined behavior of multiple objects in business processes. From object-centric event logs, object-centric Petri nets (OCPN) can be discovered to replay the behavior of processes accessing different object types. Although they indicate how objects flow through the process and co-occur in events, OCPNs remain underspecified about the relationships of objects. Hence, they are not able to represent synchronization, i.e. executing objects only according to their intended relationships, and fail to identify violating executions. Existing formal modeling approaches, such as object-centric Petri nets with identifiers (OPID), represent object identities and relationships to synchronize them correctly. However, OPID discovery has not yet been studied. This paper uses explicit data models to bridge the gap between OCPNs and formal OPIDs. We identify the implicit assumptions of stable many-to-one relationships in object-centric event logs, which implies synchronization of related objects. To formally underpin this observation, we combine OCPNs with explicit stable many-to-one relationships in a rigorous mapping from OCPNs to OPIDs explicitly capturing the intended stable relationships and the synchronization of related objects. We prove that the original OCPNs and the resulting OPIDs coincide for those executions that satisfy the intended relationships. Moreover, we provide an implementation of the mapping from OCPN to OPID under stable relationships.

cs.LO