Reachability Problems: 14th International Conference, RP 2020, Paris, France, October 19–21, 2020, Proceedings (Theoretical Computer Science and General Issues Book 12448)

This book constitutes the refereed proceedings of the 14th International Conference on Reachability Problems, RP 2020, held in Paris, France in October 2020. The 8 full papers presented were carefully reviewed and selected from 25 submissions. In addition, 2 invited papers were included in this volume. The papers cover topics such as reachability for infinite state systems; rewriting systems; reachability analysis in counter/timed/cellular/communicating automata; Petri nets; computational aspects of semigroups, groups, and rings; reachability in dynamical and hybrid systems; frontiers between decidable and undecidable reachability problems; complexity and decidability aspects; predictability in iterative maps; and new computational paradigms. Front Matter ....Pages I-XXI Front Matter ....Pages 1-1 On Decision Problems for Substitutions in Symbolic Dynamics (Valérie Berthé)....Pages 3-19 Games with Full, Longitudinal, and Transverse Observability (Orna Kupferman)....Pages 20-34 Front Matter ....Pages 35-35 Reachability Set Generation Using Hybrid Relation Compatible Saturation (Shruti Biswal, Andrew S. Miner)....Pages 37-51 Case Study: Reachability and Scalability in a Unified Combat-Command-and-Control Model (Sergiy Bogomolov, Marcelo Forets, Kostiantyn Potomkin)....Pages 52-66 Qualitative Multi-objective Reachability for Ordered Branching MDPs (Kousha Etessami, Emanuel Martinov)....Pages 67-82 Quantum-over-Classical Advantage in Solving Multiplayer Games (Dmitry Kravchenko, Kamil Khadiev, Danil Serov, Ruslan Kapralov)....Pages 83-98 Efficient Restrictions of Immediate Observation Petri Nets (Michael Raskin, Chana Weil-Kennedy)....Pages 99-114 Binary Expression of Ancestors in the Collatz Graph (Tristan Stérin)....Pages 115-130 The Collatz Process Embeds a Base Conversion Algorithm (Tristan Stérin, Damien Woods)....Pages 131-147 The Complexity of the Label-Splitting-Problem for Flip-Flop-Nets (Ronny Tredup)....Pages 148-163 Back Matter ....Pages 165-165 This book constitutes the refereed proceedings of the 7th International Workshop on Reachability Problems, RP 2013, held in Uppsala, Sweden, in September 2013. The 19 revised papers (The 14 revised papers were carefully reviewed and selected from 24 submissions in addition to 5 invited talks) were carefully reviewed and selected from 24 submissions. Topics of interest include reachability for finite state systems; rewriting systems, reachability analysis in counter/timed/cellular/communicating automata; Petri-nets; computational aspects of semigroups, groups and rings; reachability in dynamical and hybrid systems; frontiers between decidable and undecidable reachability problems; complexity and decidability aspects, predictability in iterative maps and new computational paradigms.