arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.00167cs.DCcs.AIcs.FLcs.PF
收藏

推断具有共享资源和队列的系统中未观测事件

Inferring Unobserved Events in Systems With Shared Resources and Queues

Eindhoven University of Technology(埃因霍温理工大学);RWTH Aachen University(亚琛工业大学)

Dirk Fahland, Vadim Denisov, Wil. M. P. van der Aalst

AI总结:

针对共享资源系统中事件记录不完整的问题,提出基于多实体过程模型和PQR系统的方法,通过线性规划推断未观测事件的时间戳边界,并在ProM中实现验证。

摘要:

为了识别性能问题的原因或预测过程行为,拥有正确且完整的事件数据至关重要。这对于具有共享资源的分布式系统尤其重要,例如,一个案例可能会阻塞另一个竞争同一机器的案例,从而导致性能上的案例间依赖。然而,由于各种原因,现实系统往往只记录所有发生事件中的一部分。为了理解和分析具有共享资源的过程的行为与性能,我们旨在通过推断系统中其他案例的事件,重建某个案例中必然发生但未被记录的事件的时间戳边界。我们通过系统性地在事件日志和过程模型中引入多实体概念来表述并解决该问题。我们引入了一种基于偏序的多实体事件日志模型,以及相应的多实体过程组合模型。我们将PQR系统定义为具有共享资源和队列的一类特殊多实体过程。然后,我们研究从不完备事件日志中推断与PQR系统全局一致的未观测事件及其时间戳的问题。我们通过根据PQR模型重建资源和队列的未观测轨迹,并使用线性规划推导其时间戳边界来解决该问题。虽然该问题以机场行李处理系统等物料处理系统为例进行说明,但该方法可应用于其他记录不完备的场景。相关思想已在ProM中实现,并使用合成和真实事件日志进行了评估。

英文摘要:

To identify the causes of performance problems or to predict process behavior, it is essential to have correct and complete event data. This is particularly important for distributed systems with shared resources, e.g., one case can block another case competing for the same machine, leading to inter-case dependencies in performance. However, due to a variety of reasons, real-life systems often record only a subset of all events taking place. To understand and analyze the behavior and performance of processes with shared resources, we aim to reconstruct bounds for timestamps of events in a case that must have happened but were not recorded by inference over events in other cases in the system. We formulate and solve the problem by systematically introducing multi-entity concepts in event logs and process models. We introduce a partial-order based model of a multi-entity event log and a corresponding compositional model for multi-entity processes. We define PQR-systems as a special class of multi-entity processes with shared resources and queues. We then study the problem of inferring from an incomplete event log unobserved events and their timestamps that are globally consistent with a PQR-system. We solve the problem by reconstructing unobserved traces of resources and queues according to the PQR-model and derive bounds for their timestamps using a linear program. While the problem is illustrated for material handling systems like baggage handling systems in airports, the approach can be applied to other settings where recording is incomplete. The ideas have been implemented in ProM and were evaluated using both synthetic and real-life event logs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑