Call for Presentations: Reachability Problems RP2018 - Deadline: 7th August 2018

by Igor Potapov, July 26, 2018

The 12th International Conference on Reachability Problems (RP'18)
24 - 26 September 2018 | Aix-Marseille University, FR | https://rp2018.lis-lab.fr/
Presentation-Only Track deadline: 7th of August 2018

The 12th International Conference on Reachability Problems will be hosted at Aix-Marseille University, organised by the Laboratory of Computer and System Sciences.

The Reachability Problems Conference is specifically aimed at gathering together
scholars from diverse disciplines interested in reachability problems that
appear in algebraic structures, computational models, hybrid systems, logic
and verification.

In addition to regular papers that will appear in our LNCS proceedings, we invite researchers to apply to give a presentation at RP'18 without an
accompanying paper. Such presentations can be based on work that has appeared (or which is going to appear) in the proceedings of another conference, or which
has not yet been submitted. These contributions will be judged solely on the basis of their attractiveness to the conference. Deadline: 7th of August 2018
https://rp2018.lis-lab.fr/

Please submit a pdf file containing your title, abstract and short paper (upto 4 pages in LNCS format) by e-mail [[email protected]] with a subject 
"RP2018 Informal Presentation". 


Confirmed Invited Speakers:

* Maria Prandini, Politecnico di Milano
   Title: Reachability in Cyber-Physical Systems

* Olivier Bournez, École Polytechnique, LIX
   Title: On the Computational Complexity of Solving Ordinary Differential Equations

* Jérémie Chalopin, CNRS, Aix-Marseille Université, LIS
   Title: A Counterexample to Thiagarajan's Conjecture on Regular Event Structures

* Marcin Jurdzinski, University of Warwick
   Title: Universal Ordered Trees and Quasi-Polynomial Algorithms for Solving Parity Games

* Marta Kwiatkowska, University of Oxford
   Title: Safety Verification for Deep Neural Networks with Provable Guarantees

List of Accepted papers:

* Julien Alexandre Dit Sandretto and Jian Wan. Reachability Analysis of Nonlinear ODEs using Polytopic based Validated Runge-Kutta

* Michał Skrzypczak. Buchi VASS recognise Sigma^1_1-complete w-languages

* Steven De Oliveira, Virgile Prevosto, Peter Habermehl and Saddek Bensalem. Left-eigenvectors are certificates of the Orbit Problem.

* Markus Lohrey. Knapsack in hyperbolic groups

* Alexei Lisitsa.  Revisiting MU-puzzle. A case study in finite countermodels verification. 

* Jeremy Sproston. Qualitative Reachability for Open Interval Markov Chains

* Matthew Hague and Vincent Penelle. Constrained Dynamic Tree Networks

* Turlough Neary and Matthew Cook. Generalized Tag Systems

* Petr Jancar, Petr Osička and Zdenek Sawa. EXPSPACE-completeness of simulation-like equivalences of succinct one-counter nets

* Momar Sakho, Iovka Boneva and Joachim Niehren. Certain Query Answering on Compressed String Patterns: From Streams to Hyperstreams

* Joel Day, Vijay Ganesh, Paul He, Florin Manea and Dirk Nowotka. The Satisfiability of Word Equations: Decidable and Undecidable Theories


Submissions for Presentation-Only Papers
 
*   Abstracts: 7 August 2018
*   Notification: 14 August 2018

Please submit a pdf file containing your title, abstract and short paper (upto 4 pages in LNCS format) 
by e-mail [[email protected]] with a subject "RP2018 Informal Presentation". 

Topics of interest include (but are not limited to): reachability problems in
infinite state systems, rewriting systems, dynamical and hybrid systems;
reachability problems in logic and verification; reachability analysis in
different computational models, counter timed/cellular/communicating automata;
Petri nets; computational aspects of algebraic structures (semigroups, groups
and rings); frontiers between decidable and undecidable reachability problems;
predictability in iterative maps and new computational paradigms.

We plan also to publish selected works from RP2018 in a special issue of 
Fundamenta Informaticae following the regular referee procedure.

RP'18 Program Committee:
Igor Potapov, University of Liverpool (co-chair)
Pierre-Alain Reynier, Aix-Marseille University (co-chair)

S. Akshay, IIT Bombay
Christel Baier, TU Dresden
Paul Bell, Liverpool John Moores University
Nathalie Bertrand, INRIA
Udi Boker, Interdisciplinary Center of Herzliya
Krishnendu Chatterjee, Institute of Science and Technology
Laure Daviaud, University of Warwick
Giorgio Delzanno, Università Degli Studi Di Genova
Emmanuel Filiot, FNRS, Université Libre de Bruxelles
Pierre Ganty, IMDEA Software Institute
Matthew Hague, Royal Holloway University of London
Vera Halava, University of Turku
Petr Jancar, Faculty of Science, Palacky Univ. Olomouc
Martin Lange, University of Kassel
Sławomir Lasota, Warsaw University
Fribourg Laurent, CNRS, LSV, ENS Paris-Saclay
Benjamin Monmege, Aix-Marseille Université
Anca Muscholl, Université de Bordeaux
Pavithra Prabhakar, Kansas State University
Alexander Rabinovich, Tel Aviv University
Thomas Schwentick, TU Dortmund
Helmut Seidl, TU Munich
Mikhail Volkov, Ural State University

Previous editions:

2017: RP'17 in London, UK
LNCS proceedings, Volume 10506/2017, Springer Verlag
2016: RP'16 in Aalborg, Denmark
LNCS proceedings, Volume 9899/2016, Springer Verlag
2015: RP'15 in Warsaw, Poland
LNCS proceedings, Volume 9328/2015, Springer Verlag
2014: RP'14 in Oxford, UK
LNCS proceedings, Volume 8762/2014, Springer Verlag
2013: RP'13 in Uppsala, Sweden
LNCS proceedings, Volume 8169/2013, Springer Verlag
2012: RP'12 in Bordeaux, France
LNCS proceedings, Volume 7550/2012, Springer Verlag
2011: RP'11 in Genova, Italy
LNCS proceedings, Volume 6945/2011, Springer Verlag
2010: RP'10 in Brno, Czech Republic
LNCS proceedings, Volume 6227/2010, Springer Verlag
2009: RP'09 in Palaiseau, France
LNCS proceedings, Volume 5797/2009, Springer Verlag
2008: RP'08 in Liverpool, UK
ENTCS proceedings, Volume 223, Elsevier
2007: RP'07 in Turku, Finland
TUCS General Publication Series, Volume 45, Turku Centre for Computer Science