Provisional Program of Petri Nets 2017

Petri Nets 2017

Wednesday, 28 June 2017

09:15-09:45 Opening session:

09:45-10:45 Distinguished Carl Adam Petri Lecture

  • Thomas Henzinger. Promises and Challenges of Reactive Modeling: A Personal Perspective

10:45-11:15 Coffee Break

11:15-12:45 Session 1: Simulation of Colored Petri Nets

  • Franck Pommereau and Jordan de la Houssaye. Faster Simulation of (Coloured) Petri Nets Using Parallel Computing
  • Junxian Liu, Lin Liu, and Tao Chen. Evaluating and Improving SIP non-INVITE  Transaction to Alleviate the Losing Race Problem
  • Xiangdong Huang, Jianmin Wang, Jialin Qiao, Liangfan Zheng, Jinrui Zhang and Raymond K. Wong. Performance and Replica Consistency Simulation for Quorum-based NoSQL System Cassandra

12:45-14:15 Lunch

14:15-15:15 Invited Lecture 1

  • Josep Carmona. The Alignment of Formal, Structured and Unstructured Process Descriptions

15:15-15:45 Coffee Break

15:45-17:15 Session 2: Petri Net Tools

  • Benjamin Meis, Robin Bergenthum, and Jörg Desel. travis – An Online Tool for the Synthesis and Analysis of Petri Nets with Final States
  • Marisa Llorens, Javier Oliver, Josep Silva, and Salvador Tamarit. An Integrated Environment for Petri Net Slicing
  • Lom Messan Hillah and Fabrice Kordon. Petri Nets Repository: A tool to benchmark and debug Petri Net tools

Thursday, 29 June 2017

09:00-10:00 Invited Lecture 2

  • Bernhard Steffen. Property-Preserving Generation of Tailored Benchmark Petri Nets

10:00-10:30 Coffee Break

10:30-11:30 Session 3: Model Checking

  • Andreas E. Dalsgaard, Søren Enevoldsen, Peter Fogh, Lasse S. Jensen, Tobias S. Jepsen, Isabella Kaufmann, Kim G. Larsen, Søren M. Nielsen, Mads Chr. Olesen, Samuel Pastva, and Jiří Srba. Extended Dependency Graphs and Efficient Distributed Fixed-Point Computation
  • Karsten Wolf. Model Checking Concurrency and Causality

11:30-11:45 Coffee Break

11:45-12:45 Session 4: Liveness and Opacity

  • Luca Bernardinello, Görkem Kılınç,  and Lucia Pomello. Weak Observable Liveness and Infinite Games on Finite Graphs
  • Béatrice Bérard, Stefan Haar, Sylvain Schmitz, and Stefan Schwoon. The Complexity of Diagnosability and Opacity Verification for Petri Nets

12:45-14:15 Lunch

14:15-15:15 Tool session:

15:15-16:15 Invited Lecture 3

  • Irina A. Lomazova. Resource Equivalences in Petri Nets

16:15-16:45 Coffee Break

16:45-17:45 Session 5: Stochastic Petri Nets

  • Kristóf Marussy, Vince Molnár, András Vörös, and István Majzik. Getting the Priorities Right: Saturation for Prioritised Petri Nets
  • Elvio Gilberto Amparore, Susanna Donatelli and Elisa Landini. Modelling and Evaluation of a Control Room application

Friday, 30 June 2017

09:00-10:00 Invited Lecture 4

  • Christos G. Cassandras. Complexity Made Simple (at a small price)

10:00-10:30 Coffee Break

10:30-11:30 Session 6: Specific Net Classes

  • Thomas Hujsa and Raymond Devillers. On Liveness and Deadlockability in Subclasses of Weighted Petri Nets
  • Michael Köhler-Bußmeier. Restricting Hornets to Support Self-Adaptive Systems

11:30-11:45 Coffee Break

11:45-12:45 Session 7: Petri Nets for Pathways

  • Rozália Lakner, Ferenc Friedler, and Botond Bertók. Synthesis and Analysis of Process Networks by Joint Application of P-Graphs and Petri Nets
  • Dimitri Watel, Marc-Antoine Weisser, and Dominique Barth. Parameterized Complexity and Approximability of Coverability Problems in Weighted Petri Nets

12:45-13:15 Closing Session

13:15-14:15 Lunch