Original research papers (up to 12 pages) and presentation-only contributions (short abstract), with clear relevance to reachability problems, are both encouraged.

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 and combinatorial aspects of algebraic structures (semigroups, groups and rings)
frontiers between decidable and undecidable reachability problems
predictability in iterative maps and new computational paradigms.

Submissions should be prepared using the Springer LNCS guidelines and submitted via the link https://easychair.org/conferences/?conf=rp24

Accepted original papers will be published in the Springer LNCS proceedings of RP'24.

Program Committee

Parosh Aziz Abdulla (Uppsala University)
Luca Aceto (Reykjavik University)
Christel Baier (TU Dresden)
Valentina Castiglioni (Eindhoven University of Technology)
Laure Daviaud (University of East Anglia)
Jim de Groot (The Australian National University)
Christoph Haase (University of Oxford)
Vesa Halava (University of Turku)
Ichiro Hasuo (National Institute of Informatics)
George Kenison (Liverpool John Moores University)
Sandra Kiefer (University of Oxford)
Laura Kovacs (TU Wien) - chair
Jérôme Leroux (CNRS)
Rupak Majumdar (MPI-SWS)
Anca Muscholl (LaBRI, Universite Bordeaux)
Igor Potapov (University of Liverpool)
Amaury Pouly (IRIF/CNRS - Université Paris Diderot)
Mahsa Shirmohammadi (CNRS)
Ana Sokolova (University of Salzburg) - chair
Thorsten Wißmann (Friedrich-Alexander-Universität Erlangen-Nürnberg)
James Worrell (University of Oxford)