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
• Computational game theory
• Concurrency and distributed computation
• Decision procedures in computational models
• Hybrid systems
• Logic and model checking
• Verification of finite and infinite-state systems

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.

For questions please contact: rp26@utu.fi.