11th International Workshop on Reachability Problems

      7 - 9 September 2017, London, UK

Program

Thursday 7th September

09:00-09:30 Registration
09:30-10:30 Invited Talk
Path-complete Lyapunov techniques: stability, safety, and beyond ?
Raphaël Jungers
10:30-11:00 Tea Break
11:00-12:30: Reachability in Graphs
Distributed control synthesis using Euler’s method
Adrien Le Coent, Julien Alexandre Dit Sandretto, Alexandre Chapoutot, Laurent Fribourg, Florian De Vuyst and Ludovic Chamoin
Stubborn Sets with Frozen Actions
Antti Valmari
Parameterized Graph Connectivity and Polynomial-Time Sub-Linear-Space Short Reductions
Tomoyuki Yamakami
12:30-14:00 Lunch
14:00-16:00 Tutorial
Reachability problems in linear dynamical systems
James Worrell
16:00-16:30 Tea Break
16:30-18:00 Storage Mechanisms
Reachability problem for polynomial iteration is PSPACE-complete
Reino Niskanen
An abstract machine for asynchronous programs with closures and priority queues
Davide Ancona, Giorgio Delzanno, Luca Franceschini, Maurizio Leotta, Enrico Prampolini, Marina Ribaudo and Filippo Ricca
Topological characterisation of multi-buffer simulation
Milka Hutagalung
18:45 Taxis to Banquet

Friday 8th September

09:30-10:30 Invited Talk
How do we know that our system is correct?
Hana Chockler
10:30-11:00 Tea Break
11:00-12:30 Logic and Equivalence
Space-efficient fragments of higher-order fixpoint logic
Florian Bruse, Martin Lange and Etienne Lozes
Model checking CTL over restricted classes of automatic structures
Norbert Hundeshagen and Martin Lange
Copyful streaming string transducers
Emmanuel Filiot and Pierre-Alain Reynier
12:30-14:00 Lunch
14:00-15:00 Invited Talk
Trace abstraction
Andreas Podelski
15:00-15:30 Tea Break
15:30-17:30 Informal Presentations
On the input energy for state reachability of linear systems with packet losses
A. Sanand Amita Dilip, Nikolaos Athanasopoulos and Raphaël M. Jungers
Membership problem in GL(2,Z) extended by singular matrices.
I. Potapov and P. Semukhin
On the Identity Problem for the Special Linear Group and the Heisenberg Group
Sang-Ki Ko, Reino Niskanen, Igor Potapov
The 2CNF Boolean Formula Satisfiability Problem and the Linear Space Hypothesis
Tomoyuki Yamakami

Saturday 9th September

09:30-10:30 Invited Talk
The multiple dimensions of mean-payoff games
Laurent Doyen
10:30-11:00 Tea Break
11:00-12:30 Timed Systems
Refinement of Trace Abstraction for Real-Time Programs
Franck Cassez, Peter Gjøl Jensen and Kim Guldstrand Larsen
Adding Dense-timed Stack to Integer Reset Timed Automata
Devendra Bhave and Shibashis Guha
Probabilistic Timed Automata with Clock-Dependent Probabilities
Jeremy Sproston
12:30-14:00 Lunch

Important dates (Provisional):


Nearby

Highlights 2017
Queen Mary
University of London
12-15 September 2017

Support

We acknowledge the kind support of the EATCS