Abstract is missing.
- Topics in Region Theory and Synthesis ProblemsLuca Bernardinello. 3-16 [doi]
- Flat Petri Nets (Invited Talk)Jérôme Leroux. 17-30 [doi]
- Cost and Quality in Crowdsourcing WorkflowsLoïc Hélouët, Zoltán Miklós 0001, Rituraj Singh. 33-54 [doi]
- Timed Petri Nets with Reset for Pipelined Synchronous Circuit DesignRémi Parrot, Mikaël Briday, Olivier H. Roux. 55-75 [doi]
- A Turn-Based Approach for Qualitative Time Concurrent GamesSerge Haddad, Didier Lime, Olivier H. Roux. 76-92 [doi]
- Canonical Representations for Direct Generation of Strategies in High-Level Petri GamesManuel Gieseking, Nick Würdemann. 95-117 [doi]
- Automatic Synthesis of Transiently Correct Network Updates via Petri GamesMartin Didriksen, Peter Gjøl Jensen, Jonathan F. Jønler, Andrei-Ioan Katona, Sangey D. L. Lama, Frederik B. Lottrup, Shahab Shajarat, Jirí Srba. 118-137 [doi]
- Computing Parameterized Invariants of Parameterized Petri NetsJavier Esparza, Mikhail A. Raskin, Christoph Welzel. 141-163 [doi]
- On the Combination of Polyhedral Abstraction and SMT-Based Model Checking for Petri NetsNicolas Amat, Bernard Berthomieu, Silvano Dal-Zilio. 164-185 [doi]
- Skeleton Abstraction for Universal Temporal PropertiesSophie Wallner, Karsten Wolf. 186-207 [doi]
- Reduction Using Induced Subnets to Systematically Prove Properties for Free-Choice NetsWil M. P. van der Aalst. 208-229 [doi]
- Model Checking of Synchronized Domain-Specific Multi-formalism Models Using High-Level Petri NetsMichael Haustermann, David Mosteller, Daniel Moldt. 230-249 [doi]
- Edge, Event and State Removal: The Complexity of Some Basic Techniques that Make Transition Systems Petri Net ImplementableRonny Tredup. 253-273 [doi]
- Synthesis of (Choice-Free) Reset NetsRaymond R. Devillers. 274-291 [doi]
- Synthesis of Petri Nets with Restricted Place-Environments: Classical and ParameterizedRonny Tredup. 292-311 [doi]
- Discovering Stochastic Process Models by Reduction and AbstractionAdam Burke, Sander J. J. Leemans, Moe Thandar Wynn. 312-336 [doi]
- Efficient Algorithms for Three Reachability Problems in Safe Petri NetsPierre Bouvier, Hubert Garavel. 339-359 [doi]
- A Lazy Query Scheme for Reachability Analysis in Petri NetsLoïg Jezequel, Didier Lime, Bastien Sérée. 360-378 [doi]
- Abstraction-Based Incremental Inductive Coverability for Petri NetsJiawen Kang, Yunjun Bai, Li Jiao. 379-398 [doi]
- Firing Partial Orders in a Petri NetRobin Bergenthum. 399-419 [doi]
- Deterministic Concurrent SystemsSamy Abbes. 423-442 [doi]
- Deciphering the Co-Car Anomaly of Circular Traffic Queues Using Petri NetsRüdiger Valk. 443-462 [doi]
- Cortado - An Interactive Tool for Data-Driven Process Discovery and ModelingDaniel Schuster, Sebastiaan J. van Zelst, Wil M. P. van der Aalst. 465-475 [doi]
- PROVED: A Tool for Graph Representation and Analysis of Uncertain Event DataMarco Pegoraro, Merih Seran Uysal, Wil M. P. van der Aalst. 476-486 [doi]