12th International Conference on Reachability Problems

      24 - 26 September 2018, Marseille, France

Program

Monday 24th September

08:45-09:00 Opening
09:00-10:00 Invited talk
Computations and Dynamical Systems
Olivier Bournez (Ecole Polytechnique, LIX)
10:00-10:30 Coffee break
10:30-12:00 Regular session
Revisiting MU-puzzle. A case study in finite countermodels verification
Alexei Lisitsa
Generalized Tag Systems
Turlough Neary and Matthew Cook
Constrained Dynamic Tree Networks
Matthew Hague and Vincent Penelle
12:00-14:00 Lunch
14:00-16:00 Invited tutorial
Verification of machine learning algorithms
Marta Kwiatkowska (University of Oxford)
16:00-16:30 Coffee break
16:30-18:00 Informal presentations
On the Significance of Reachability Problems in Learning-Based Robust Model Predictive Control
Raffaele Soloperto and Frank Allgöwer
News on Safety Properties for Timed Petri Nets
Patrick Totzke
Reachability Problems in Nondeterministic Polynomial Maps on the Integers
Sang-Ki Ko, Reino Niskanen, Igor Potapov

Tuesday 25th September

09:00-10:00 Invited Talk
A counter-example to the Thiagarajan conjecture
Jérémie Chalopin (CNRS, Aix-Marseille Université, LIS)
10:00-10:30 Coffee break
10:30-12:00 Regular session
Certain Query Answering on Compressed String Patterns: From Streams to Hyperstreams
Momar Sakho, Iovka Boneva and Joachim Niehren
The Satisfiability of Word Equations: Decidable and Undecidable Theories
Joel Day, Vijay Ganesh, Paul He, Florin Manea and Dirk Nowotka
EXPSPACE-Complete Variant of Countdown Games, and Simulation on Succinct One-Counter Nets
Petr Jancar, Petr Osička and Zdenek Sawa
12:00-14:00 Lunch
14:00-15:00 Invited talk
Reachability in Cyber-Physical Systems
Maria Prandini (Politecnico di Milano)
15:00-16:00 Regular session
Reachability Analysis of Nonlinear ODEs using Polytopic based Validated Runge-Kutta
Julien Alexandre Dit Sandretto and Jian Wan
Left-eigenvectors are certificates of the Orbit Problem
Steven De Oliveira, Virgile Prevosto, Peter Habermehl and Saddek Bensalem
16:00-16:30 Coffee break
16:30-18:30 Informal Presentations
Effective Divergence Analysis for Linear Recurrence Sequences
Shaull Almagor, Brynmor Chapman, Mehran Hosseini, Joël Ouaknine and James Worrell
Mortality problem for bounded languages and linear recurrence sequences
Paul Bell, Igor Potapov and Pavel Semukhin
Primitivity of random matrix sets and the synchronizing probability function
Costanza Catalano and Raphaël M. Jungers
On Finite Monoids over Nonnegative Integer Matrices and Short Killing Words
Stefan Kiefer and Corto Mascle
20:00-22:00 Banquet

Wednesday 26th September

09:00-10:00 Invited talk
New algorithms for parity games
Marcin Jurdzinski (University of Warwick)
10:00-10:30 Coffee break
10:30-12:00 Regular session
Buchi VASS recognise Sigma^1_1-complete w-languages
Michał Skrzypczak
Qualitative Reachability for Open Interval Markov Chains
Jeremy Sproston
Knapsack in hyperbolic groups
Markus Lohrey
12:00-14:00 Lunch

Important dates


Support