![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
ATAED@Petri Nets 2022: Bergen, Norway
- Robert Lorenz, Jan Martijn E. M. van der Werf, Sebastiaan J. van Zelst:
Proceedings of the Workshop on Algorithms & Theories for the Analysis of Event Data co-located with the 43rd International Conference on Application and Theory of Petri Nets and Concurrency (Petri Nets 2022), Bergen, Norway, June 19-24, 2022. CEUR Workshop Proceedings 3167, CEUR-WS.org 2022
Session 1: Invited Talk
- Sander J. J. Leemans:
Leveraging Frequencies in Event Data a Pledge for Stochastic Process Mining. 1-8
Session 2: Stochastics & Statistics
- Jarne Vandenabeele, Gilles Vermaut, Jari Peeperkorn, Jochen De Weerdt:
Enhancing Stochastic Petri Net-based Remaining Time Prediction using k-Nearest Neighbors. 9-24 - Patrizia Schalk, Lisa Petrak:
Taking on Infrequent Behavior in Event Logs using Hypothesis Tests. 25-42
Session 3: Region Theory
- Aishah Ahmed, Marta Pietkiewicz-Koutny:
Minimising the Synthesised ENL-Systems. 43-59 - Robin Bergenthum, Jakub Kovár:
A First Glimpse at Petri Net Regions. 60-68
Session 4: Strategies for Behavioral Analysis
- Federica Adobbati, Luca Bernardinello, Lucia Pomello, Riccardo Stramare:
Implementable Strategies for a Two-Player Asynchronous Game on Petri Nets. 69-75 - Gabriel Juhás, Ana Juhásová, Tomás Kovácik:
Deadlocks and Livelocks in Resource Constrained Workflow Nets. 76-100
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.