International Conference on Reachability Problems explained

History:	2007–
Discipline:	Automata theory, Algebraic structures, logic, verification, computational models
Abbreviation:	RP
Country:	International
Frequency:	annual

RP, the International Conference on Reachability Problems is an annual academic conference in thefield of computer science.

The RP is specifically aimed at gathering together scholars from diverse disciplines and backgrounds interested in reachability problems that appear in

• Algebraic structures
• Automata Theory and Formal languages
• Concurrency and Distributed computations
• Decision Procedures in Computational models
• Hybrid systems
• Logic and Model checking
• Formal verification of Finite and Infinite-state Systems
• Algorithmic game theory

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'21 in Liverpool, UK, LNCS proceedings, volume 13035, Springer Verlag
• RP'20 in Paris, France, LNCS proceedings, volume 12448, Springer Verlag
• RP'19 in Brussels, Belgium, LNCS proceedings, volume 11674, Springer Verlag
• RP'18 in Marseille, France, LNCS proceedings, volume 11123, Springer Verlag
• RP'17 in London, UK, LNCS proceedings, Springer Verlag
• RP'16 in Aalborg, Denmark, LNCS proceedings, Springer Verlag
• RP'15 in Warsaw, Poland, LNCS proceedings, Springer Verlag
• RP'14 in Oxford, UK, LNCS proceedings, Springer Verlag
• RP'13 in Uppsala, Sweden, LNCS proceedings, Springer Verlag
• RP'12 in Bordeaux, France, LNCS proceedings, Volume 7550/2012, Springer Verlag^[1]
• RP'11 in Genova, Italy, LNCS proceedings, Volume 6945/2011, Springer Verlag ^[2]
• RP'10 in Brno, Czech Republic, LNCS proceedings, Volume 6227/2010, Springer Verlag^[3]
• 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

Notes and References

1. 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,
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,
3. 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,
4. 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,
5. Vesa Halava, Igor Potapov: Preface. Electr. Notes Theor. Comput. Sci. 223: 1-2 (2008)