Vol-1592
urn:nbn:de:0074-1592-9

Copyright © 2016 for the individual papers by the papers' authors. Copying permitted for private and academic purposes. This volume is published and copyrighted by its editors.

ATAED 2016
Algorithms & Theories for the Analysis of Event Data

Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data 2016

Satellite event of the conferences:
37th International Conference on Application and Theory of Petri Nets and Concurrency Petri Nets 2016 and
16th International Conference on Application of Concurrency to System Design ACSD 2016

Torun, Poland, June 20-21, 2016.

Edited by

Wil van der Aalst *
Robin Bergenthum
Josep Carmona *

* Eindhoven University of Technology,Department of Mathematics and Computer Science (MF 7.103), PO Box 513, NL-5600 MB Eindhoven, The Netherlands
** FernUniversität in Hagen, Lehrgebiet Softwaretechnik und Theorie der Programmierung, Universitätsstr. 1, 58097 Hagen, Germany
*** Universitat Politecnica de Catalunya, Department of Computer Science, C. Jordi Girona 1-3, 08034 Barcelona, Spain

Table of Contents

Determining the Number of Trace Clusters: a Stability-based Approach 1-15
Pieter De Koninck, Jochen De Weerdt
Process Mining in IT Service Management: A Case Study 16-30
Borja Vázquez-Barreiros, David Chapela, Manuel Mucientes, Manuel Lama, Diego Berea
Discovering Process Models from Incomplete Event Logs using Conjoint Occurrence Classes 31-46
Tonatiuh Tapia-Flores, Edelma Rodríguez-Pérez, Ernesto López-Mellado
Synthesis of Elementary Net Systems with Final Configurations 47-57
Benjamin Meis, Robin Bergenthum, Jörg Desel
Synthesis of bounded Petri Nets from Prime Event Structures with Cutting Context 58-77
Gabriel Juhás, Robert Lorenz
Transition Systems Reduction: Balancing between Precision and Simplicity 78-95
Sergey A. Shershakov, Anna A. Kalenkova, Irina A. Lomazova
Computing Alignments with Constraint Programming: The Acyclic Case 96-110
María Teresa Gómez-López, Diana Borrego, Josep Carmona, Rafael M. Gasca
Properties of Plain, Pure, and Safe Petri Nets - with some Applications to Petri Net Synthesis 111-125
Kamila Barylska, Eike Best
Security-Sensitive Tackling of Obstructed Workow Executions 126-137
Julius Holderer, Josep Carmona, Günter Müller
Calculating the Number of Unique Paths in a Block-Structured Process Model 138-152
Gert Janssenswillen, Benoît Depaire, Toon Jouck
Identification of Timed Discrete Event Processes. Building Input-Output Petri Net Models 153-167
Edelma Rodríguez-Pérez, Tonatiuh Tapia-Flores, Ernesto López-Mellado

2016-06-16: submitted by Robin Bergenthum
2016-06-17: published on CEUR-WS.org |valid HTML5|