Adding A/Sync Places to the Synthesis Procedure for Whole-Place Operations Nets with Localities

Algorithms and the Foundations of Software technolog

Partial-order-based process mining: a survey and outlook

The field of process mining focuses on distilling knowledge of the (historical) execution of a process based on the operational event data generated and stored during its execution. Most existing process mining techniques assume that the event data describe activity executions as degenerate time intervals, i.e., intervals of the form [t, t], yielding a strict total order on the observed activity instances. However, for various practical use cases, e.g., the logging of activity executions with a nonzero duration and uncertainty on the correctness of the recorded timestamps of the activity executions, assuming a partial order on the observed activity instances is more appropriate. Using partial orders to represent process executions, i.e., based on recorded event data, allows for new classes of process mining algorithms, i.e., aware of parallelism and robust to uncertainty. Yet, interestingly, only a limited number of studies consider using intermediate data abstractions that explicitly assume a partial order over a collection of observed activity instances. Considering recent developments in process mining, e.g., the prevalence of high-quality event data and techniques for event data abstraction, the need for algorithms designed to handle partially ordered event data is expected to grow in the upcoming years. Therefore, this paper presents a survey of process mining techniques that explicitly use partial orders to represent recorded process behavior. We performed a keyword search, followed by a snowball sampling strategy, yielding 68 relevant articles in the field. We observe a recent uptake in works covering partial-order-based process mining, e.g., due to the current trend of process mining based on uncertain event data. Furthermore, we outline promising novel research directions for the use of partial orders in the context of process mining algorithms

Recent advances in petri nets and concurrency

CEUR Workshop Proceeding

Formal analysis of executions of organizational scenarios based on process-oriented specifications

Abstract This paper presents various formal techniques for analysis of executions of organizational scenarios based on specifications of organizations. Organizational specifications describe (prescribe) ordering and timing relations on organizational processes, modes of use of resources, allocations of actors to processes, etc. The actual execution may diverge from scenarios (pre)defined by a specification. A part of techniques proposed in this paper is dedicated to establishing the correspondence between a formalized execution (i.e., a trace) and the corresponding specification. Other techniques proposed in this paper provide the analyst with wide possibilities to evaluate organizational performance and to identify bottlenecks and other inefficiencies in the organizational operation. For the proposed formal analysis the order-sorted predicate Temporal Trace Language (TTL) is used and it is supported by the dedicated software tool TTL Checker. The analysis approaches considered in this paper are illustrated by a case study in the context of an organization from the security domain. © Springer Science+Business Media, LLC 2009