Discovering Queues from Event Logs with Varying Levels of Information

@inproceedings{Senderovich2015DiscoveringQF,
  title={Discovering Queues from Event Logs with Varying Levels of Information},
  author={Arik Senderovich and Sander J. J. Leemans and Shahar Harel and Avigdor Gal and Avishai Mandelbaum and Wil M.P. van der Aalst},
  booktitle={Business Process Management Workshops},
  year={2015}
}
Detecting and measuring resource queues is central to business process optimization. Queue mining techniques allow for the identification of bottlenecks and other process inefficiencies, based on event data. This work focuses on the discovery of resource queues. In particular, we investigate the impact of available information in an event log on the ability to accurately discover queue lengths, i.e. the number of cases waiting for an activity. Full queueing information, i.e. timestamps of… 
Queueing Inference for Process Performance Analysis with Missing Life-Cycle Data
TLDR
This paper proposes a methodology to address missing life-cycle data by incorporating predicted information in business processes performance analysis and builds upon techniques from queueing theory and leverages supervised learning to accurately predict performance indicators based on an event log with missing data.
Temporal Network Representation of Event Logs for Improved Performance Modelling in Business Processes
TLDR
This paper introduces the Temporal Network Representation of a log, based on Allen’s interval algebra, as a complete temporal representation of aLog, which enables simultaneous discovery of control-flow and performance information and shows that the TNR yields an improvement in performance fitness over state-of-the-art algorithms.
Using Life Cycle Information in Process Discovery
TLDR
This paper investigates the automatic discovery of process models from event logs, such that performance can be measured more accurately and introduces a process discovery technique that is able to handle life cycle data and that distinguishes concurrency and interleaving.
Business Process Management
TLDR
This paper introduces the Temporal Network Representation of a log, based on Allen’s interval algebra, as a complete temporal representation of aLog, which enables simultaneous discovery of control-flow and performance information and shows that the TNR yields an improvement in performance fitness over state-of-the-art algorithms.
Stochastic Process Discovery by Weight Estimation
TLDR
A framework for automatic discovery of stochastic process models, given a control-flow model and an event log is introduced and the resulting models have comparable conformance to existing approaches and are shown to be calculated more efficiently.
Parameter and State Estimation in Queues and Related Stochastic Models: A Bibliography
TLDR
This is an annotated bibliography on estimation and inference results for queues and related stochastic models, allowing for researchers and practitioners to explore the various types of results that exist.
Challenge Paper
TLDR
Queue mining enables bottleneck detection and delay prediction, and is the process of revealing queue information from data logs for the purpose of discovering queueing models, conformance checking, and optimization.
Hierarchical performance analysis for process mining
TLDR
A framework for establishing precise relationships between events and submodels, taking into account execution semantics; and a novel formalization of existing and novel performance metrics are presented.
Hierarchical process mining for scalable software analysis
TLDR
This thesis shows how process mining can be used for analyzing software systems, and addresses the lack of support for hierarchical subprocesses, recursive behavior, and cancelation behavior, which is commonly found in software behavior.
...
1
2
3
...

References

SHOWING 1-10 OF 16 REFERENCES
Queue mining for delay prediction in multi-class service processes
Discovering Block-Structured Process Models from Event Logs - A Constructive Approach
TLDR
This work provides an extensible framework to discover from any given log a set of block-structured process models that are sound and fit the observed behaviour, and gives sufficient conditions on the log for which the algorithm returns a model that is language-equivalent to the process model underlying the log, including unseen behaviour.
Estimating characteristics of queueing networks using transactional data
TLDR
This work considers an open queueing network with Poisson external arrivals, multi‐server stations, general service times and Markovian switches of customers between stations, and estimates the evolution of the queues in the network, given the collected data.
Discovering Block-Structured Process Models from Event Logs Containing Infrequent Behaviour
TLDR
This work presents a technique able to cope with infrequent behaviour and large event logs, while ensuring soundness, and compares the technique with existing approaches in terms of quality and performance.
Aligning observed and modeled behavior
Aligning Observed and Modeled Behavior The availability of process models and event logs is rapidly increasing as more and more business processes are supported by IT. On the one hand, most
Repairing Event Logs Using Timed Process Models
Process mining aims to infer meaningful insights from process-related data and attracted the attention of practitioners, tool-vendors, and researchers in recent years. Traditionally, event logs are
On Queues in Heavy Traffic
SUMMARY We say that a single server queue is in "heavy traffic" when the traffic intensity p is less than, but very near, unity. Then the equilibrium waiting time w will be large, and it is proved
Service Engineering in Action: The Palm/Erlang-A Queue, with Applications to Call Centers
TLDR
Computations of performance measures, both theoretical and software-based (via the 4CallCenter software) and several examples of Palm/ErlangA applications are presented, mostly motivated by and based on real call center data.
Markov chain Monte Carlo for Inference on Phase-type Models
TLDR
This work builds on the Markov chain Monte Carlo (MCMC) algorithm developed by Bladt et al. (2003) in a number of directions and the conjugacy properties are shown to hold when constraints are imposed on the structure of the underlying Markov process.
A genetic algorithm for discovering process trees
TLDR
This paper proposes a new genetic process mining algorithm that discovers process models from event logs that is the first algorithm where the search process can be guided by preferences of the user while ensuring correctness.
...
1
2
...