Accepted Papers:
- Etienne Andre, Fribourg Laurent, Thomas Chatain and Emmanuelle Encrenaz. An Inverse Method for Parametric Timed Automata.
- Kerstin Bauer, Raffaella Gentilini and Klaus Schneider. Approximated Reachability on Hybrid Automata: Falsification meets Certification.
- Yohan Boichut, Romeo Courbis, Pierre-Cyrille Heam and Olga Kouchnarenko. Handling Left-Quadratic Rules When Completing Tree Automata.
- Nathaniel Charlton and Michael Huth. Falsifying safety properties through games on over-approximating models.
- Pieter Collins and Goldsztejn Alexandre. The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems.
- Ingo Felscher. The compositional method and regular reachability.
- Jan Friso Groote and Bas Ploeger. Switching Graphs.
- Kai Lampka. A new algorithm for partitioned symbolic reachability analysis.
- Marisa Llorens, Javier Oliver, Josep Silva, Salvador Tamarit and German Vidal. Dynamic Slicing Techniques for Petri Nets.
- Pavel Martyugin. The length of subset reachability in nondeterministic automata.
- Arne Meier, Martin Mundhenk, Michael Thomas and Heribert Vollmer. The Complexity of Satisfiability for Fragments of CTL and CTL*.
- Maurice Margenstern and Yu Song. A universal cellular automaton on the ternary heptagrid.
- M. Praveen and Kamal Lodaya. Analyzing reachability for some Petri nets with fast growing markings.
- Klaus Reinhardt. Reachability in Petri Nets with Inhibitor arcs.