Abstract is missing.
- Complexity Bounds for Ordinal-Based Termination - (Invited Talk)Sylvain Schmitz. 1-19 [doi]
- On The Complexity of Bounded Time Reachability for Piecewise Affine SystemsHugo Bazille, Olivier Bournez, Walid Gomaa, Amaury Pouly. 20-31 [doi]
- Reachability and Mortality Problems for Restricted Hierarchical Piecewise Constant DerivativesPaul C. Bell, Shang Chen, Lisa Jackson. 32-44 [doi]
- Parameterized Verification of Communicating Automata under Context BoundsBenedikt Bollig, Paul Gastin, Jana Schubert. 45-57 [doi]
- Regular Strategies in Pushdown Reachability GamesArnaud Carayol, Matthew Hague. 58-71 [doi]
- Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood OperationsGiorgio Delzanno, Jan Stückrath. 72-84 [doi]
- Equivalence Between Model-Checking Flat Counter Systems and Presburger ArithmeticStéphane Demri, Amit Kumar Dhar, Arnaud Sangnier. 85-97 [doi]
- Synthesising Succinct Strategies in Safety and Reachability GamesGilles Geeraerts, Joël Goossens, Amélie Stainer. 98-111 [doi]
- Integer Vector Addition Systems with StatesChristoph Haase, Simon Halfon. 112-124 [doi]
- Reachability in MDPs: Refining Convergence of Value IterationSerge Haddad, Benjamin Monmege. 125-137 [doi]
- On the Expressiveness of Metric Temporal Logic over Bounded Timed WordsHsi-Ming Ho. 138-150 [doi]
- Trace Inclusion for One-Counter Nets RevisitedPiotr Hofman, Patrick Totzke. 151-162 [doi]
- Mean-Payoff Games with Partial-Observation - (Extended Abstract)Paul Hunter, Guillermo A. Pérez, Jean-François Raskin. 163-175 [doi]
- Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game AbstractionsAleksandra Jovanovic, Marta Kwiatkowska. 176-189 [doi]
- On Functions Weakly Computable by Petri Nets and Vector Addition SystemsJ. LeRoux, Ph. Schnoebelen. 190-202 [doi]
- Generalized Craig Interpolation for Stochastic Satisfiability Modulo Theory ProblemsAhmed Mahdi, Martin Fränzle. 203-215 [doi]
- Transformations for Compositional Verification of Assumption-Commitment PropertiesAhmed Mahdi, Bernd Westphal, Martin Fränzle. 216-229 [doi]
- Compositional Reachability in Petri NetsJulian Rathke, Pawel Sobocinski, Owen Stephens. 230-243 [doi]