<!DOCTYPE html>
<!-- CEURVERSION=2015-12-02 -->
<html lang="en">
<head>
<meta http-equiv="Content-type" content="text/html;charset=utf-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<link rel="stylesheet" type="text/css" href="../ceur-ws.css">
<title>CEUR-WS.org/Vol-2371 - Workshop on Algorithms &amp; Theories for the Analysis of Event Data 2019</title>
</head>
<!--CEURLANG=eng -->
<body>

<table style="border: 0; border-spacing: 0; border-collapse: collapse; width: 95%">
<tbody><tr>
<td style="text-align: left; vertical-align: middle">
<a href="http://ceur-ws.org/"><div id="CEURWSLOGO"></div></a>
</td>
<td style="text-align: right; vertical-align: middle">

<span class="CEURVOLNR">Vol-2371</span> <br>
<span class="CEURURN">urn:nbn:de:0074-2371-0</span>
<p class="unobtrusive copyright" style="text-align: justify">Copyright &copy; 
<span class="CEURPUBYEAR">2019</span> for the individual papers
by the papers' authors. Copying permitted for private and academic purposes.
This volume is published and copyrighted by its editors.</p>
</td>
</tr>
</tbody></table>

<hr>

<br><br><br>

<h1><a href="http://www.fernuni-hagen.de/ataed2019/"><span class="CEURVOLACRONYM">ATAED 2019</span></a><br>
<span class="CEURVOLTITLE">Algorithms &amp; Theories for the Analysis of Event Data 2019</span></h1>
<br>

<h3>
<span class="CEURFULLTITLE">Proceedings of the International Workshop on Algorithms &amp; Theories for the Analysis of Event Data 2019</span><br>
<br/>
Satellite event of the conferences:<br/>
        40th International Conference on Application and Theory of Petri Nets and Concurrency
        <a href="http://www.petrinets2019.de/"><span class="CEURCOLOCATED">Petri Nets 2019</span></a> and <br>
        19th International Conference on Application of Concurrency to System Design
        <a href="http://www.petrinets2019.de/acsd-2019/"><span class="CEURCOLOCATED">ACSD 2019</span></a>
<br>
</h3>
<h3><span class="CEURLOCTIME">Aachen, Germany, June 25, 2019</span>.</h3> 
<br>
<b> Edited by </b>
<p>

</p><h3>
   <a href="http://www.padsweb.rwth-aachen.de/wvdaalst/"><span class="CEURVOLEDITOR">Wil van der Aalst</span></a> *<br>
   <a href="https://www.fernuni-hagen.de/mi/fakultaet/lehrende/bergenthum/index.shtml"><span class="CEURVOLEDITOR">Robin Bergenthum</span></a> **<br>
   <a href="http://www.cs.upc.edu/~jcarmona/"><span class="CEURVOLEDITOR">Josep Carmona</span></a> ***<br>

</h3>

* RWTH Aachen University, Lehrstuhl für Informatik 9 / Process and Data Science, Ahornstr. 55, 52074 Aachen, Germany<br>
** FernUniversit&auml;t in Hagen, Fakult&auml;t f&uuml;r Mathematik und Informatik, Universit&auml;tsstr. 1, 58097 Hagen, Germany<br>
*** Universitat Politecnica de Catalunya, Department of Computer Science, C. Jordi Girona 1-3, 08034 Barcelona, Spain<br>
  <br>

<hr>

<br><br><br>

<div class="CEURTOC">
<h2> Table of Contents </h2>

<ul>
<li id="frontmatter">
<a href="ATAED2019-1-5.pdf">Frontmatter</a><BR><BR>
</li>
</ul>

<ul>
<li id="paper01"><a href="ATAED2019-6-22.pdf">
<span class="CEURTITLE">Synthesis of Weighted Marked Graphs from Circular Labelled Transition Systems</span></a>
<span class="CEURPAGES">6-22</span> <br>
<span class="CEURAUTHOR">Raymond Devillers</span>, 
<span class="CEURAUTHOR">Evgeny Erofeev</span>,
<span class="CEURAUTHOR">Thomas Hujsa</span>
</li>

<li id="paper02"><a href="ATAED2019-23-35.pdf">
<span class="CEURTITLE">Can a Single Transition Stop an Entire Net?</span></a>
<span class="CEURPAGES">23-35</span> <br>
<span class="CEURAUTHOR">J&ouml;rg Desel</span>
</li>

<li id="paper04"><a href="ATAED2019-36-53.pdf">
<span class="CEURTITLE">Two Operations for Stable Structures of Elementary Regions</span></a>
<span class="CEURPAGES">36-53</span> <br>
<span class="CEURAUTHOR">Federica Adobbati</span>,
<span class="CEURAUTHOR">Carlo Ferigato</span>,
<span class="CEURAUTHOR">Stefano Gandelli</span>, 
<span class="CEURAUTHOR">Adri&aacute;n Puerto Aubel</span>
</li>

<li id="paper05"><a href="ATAED2019-54-70.pdf">
<span class="CEURTITLE">Emails Analysis for Business Process Discovery</span></a>
<span class="CEURPAGES">54-70</span> <br>
<span class="CEURAUTHOR">Nassim Laga</span>,
<span class="CEURAUTHOR">Marwa Elleuch</span>,
<span class="CEURAUTHOR">Walid Gaaloul</span>,
<span class="CEURAUTHOR">Oumaima Alaoui Ismaili</span>
</li>

<li id="paper06"><a href="ATAED2019-71-86.pdf">
<span class="CEURTITLE">On the Hardness of Synthesizing Boolean Nets</span></a>
<span class="CEURPAGES">71-86</span> <br>
<span class="CEURAUTHOR">Ronny Tredup</span>,
<span class="CEURAUTHOR">Christian Rosenke</span>
</li>

<li id="paper07"><a href="ATAED2019-87-103.pdf">
<span class="CEURTITLE">Reviving Token-based Replay: Increasing Speed While Improving Diagnostics</span></a>
<span class="CEURPAGES">87-103</span> <br>
<span class="CEURAUTHOR">Alessandro Berti</span>,
<span class="CEURAUTHOR">Wil van der Aalst</span>
</li>

</ul>
</div>

<br>
<ul>
<li>
<a href="ftp://SunSITE.Informatik.RWTH-Aachen.DE/pub/publications/CEUR-WS/Vol-2371.zip">Download the proceedings in a zip file</a><BR><BR>
</li>
</ul>

<hr>
<span class="unobtrusive">
2019-06-06: submitted by Robin Bergenthum<br>
<span class="CEURPUBDATE">2019-06-07</span>: published on CEUR-WS.org 
	|<A HREF="https://validator.w3.org/nu/?doc=http%3A%2F%2Fceur-ws.org%2FVol-2371%2F">valid HTML5</A>|
</span>
</body></html>
