Accepted Papers
- Jerome Leroux and Philippe Schnoebelen. On Functions Weakly Computable by Petri Nets and Vector Addition Systems.
- Piotr Hofman and Patrick Totzke. Trace Inclusion for One-Counter Nets Revisited.
- Christoph Haase and Simon Halfon. Integer Vector Addition Systems with States.
- Arnaud Carayol and Matthew Hague. Regular Strategies In Pushdown Reachability Games.
- Serge Haddad and Benjamin Monmege. Reachability in MDPs: Refining Convergence of Value Iteration.
- Paul Hunter, Guillermo Perez and Jean-Francois Raskin. Mean-payoff Games with Partial-Observation .
- Hugo Bazille, Olivier Bournez, Walid Gomaa and Amaury Pouly. On The Complexity of Bounded Time Reachability for Piecewise Affine Systems.
- Hsi-Ming Ho. On the Expressiveness of Metric Temporal Logic over Bounded Timed Words.
- Ahmed Mahdi, Bernd Westphal and Martin Fränzle. Transformations for Compositional Verification of Assumption-Commitment Properties.
- Julian Rathke, Pawel Sobocinski and Owen Stephens. Compositional Reachability in Petri Nets.
- Paul Bell, Shang Chen and Lisa Jackson. Reachability and Mortality Problems for Hierarchical PCDs.
- Gilles Geeraerts, Joël Goossens and Amélie Stainer. Synthesising Succinct Strategies in Safety and Rechability Games.
- Giorgio Delzanno and Jan Stückrath. Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations.
- Stéphane Demri, Amit Kumar Dhar and Arnaud Sangnier. Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic.
- Ahmed Mahdi and Martin Fränzle. Generalized Craig Interpolation for Stochastic Satisfiability Modulo Theory problems.
- Paul Gastin, Benedikt Bollig and Jana Schubert. Parameterized Verification of Communicating Automata under Context Bounds.
- Aleksandra Jovanovic and Marta Kwiatkowska. Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstraction.