The RP is specifically aimed at gathering together scholars from diverse disciplines and backgrounds interested in reachability problems that appear in
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.
History of the Workshop
RP'22 in Kaiserslautern, Germany, LNCS proceedings, Springer Verlag
RP'09 in Palaiseau, France, LNCS proceedings, Volume 5797/2009, Springer Verlag[4]
RP'08 in Liverpool, UK, ENTCS proceedings, Volume 223, Elsevier [5]
RP'07 in Turku, Finland, TUCS General Publication Serie, Volume 45, Turku Centre for Computer Science
References
^Alain Finkel, Jérôme Leroux, Igor Potapov (Eds.): Reachability Problems - 6th International Workshop, RP 2012, Bordeaux, France, September 17–19, 2012. Proceedings. Lecture Notes in Computer Science 7550, Springer 2012, ISBN978-3-642-33511-2
^Giorgio Delzanno, Igor Potapov (Eds.): Reachability Problems - 5th International Workshop, RP 2011, Genoa, Italy, September 28–30, 2011. Proceedings. Lecture Notes in Computer Science 6945, Springer 2011, ISBN978-3-642-24287-8
^Antonín Kucera, Igor Potapov (Eds.): Reachability Problems, 4th International Workshop, RP 2010, Brno, Czech Republic, August 28–29, 2010. Proceedings. Lecture Notes in Computer Science 6227, Springer 2010, ISBN978-3-642-15348-8
^Olivier Bournez, Igor Potapov (Eds.): Reachability Problems, 3rd International Workshop, RP 2009, Palaiseau, France, September 23–25, 2009. Proceedings. Lecture Notes in Computer Science 5797, Springer 2009, ISBN978-3-642-04419-9