Reachability Problems: 13th International Conference, RP 2019, Brussels, Belgium, September 11–13, 2019, Proceedings

Description

This book constitutes the refereed proceedings of the 13th International Conference on Reachability Problems, RP 2019, held in Brussels, Belgium, in September 2019. The 14 full papers presented were carefully reviewed and selected from 26 submissions. 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-xx Bidding Games on Markov Decision Processes (Guy Avni, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Petr Novotný)....Pages 1-12 Primitivity and Synchronizing Automata: A Functional Analytic Approach (Vladimir Yu. Protasov)....Pages 13-21 Reaching Out Towards Fully Verified Autonomous Systems (Sriram Sankaranarayanan, Souradeep Dutta, Sergio Mover)....Pages 22-32 On the m-eternal Domination Number of Cactus Graphs (Václav Blažej, Jan Matyáš Křišt’an, Tomáš Valla)....Pages 33-47 On Relevant Equilibria in Reachability Games (Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Nathan Thomasset)....Pages 48-62 Partial Solvers for Generalized Parity Games (Véronique Bruyère, Guillermo A. Pérez, Jean-François Raskin, Clément Tamines)....Pages 63-78 Reachability in Augmented Interval Markov Chains (Ventsislav Chonev)....Pages 79-92 On Solving Word Equations Using SAT (Joel D. Day, Thorsten Ehlers, Mitja Kulczynski, Florin Manea, Dirk Nowotka, Danny Bøgsted Poulsen)....Pages 93-106 Parameterised Verification of Publish/Subscribe Networks with Exception Handling (Giorgio Delzanno)....Pages 107-120 Cellular Automata for the Self-stabilisation of Colourings and Tilings (Nazim Fatès, Irène Marcovici, Siamak Taati)....Pages 121-136 On the Termination Problem for Counter Machines with Incrementing Errors (Christopher Hampson)....Pages 137-148 Reachability Problems on Partially Lossy Queue Automata (Chris Köcher)....Pages 149-163 On the Computation of the Minimal Coverability Set of Petri Nets (Pierre-Alain Reynier, Frédéric Servais)....Pages 164-177 Deciding Reachability for Piecewise Constant Derivative Systems on Orientable Manifolds (Andrei Sandler, Olga Tveretina)....Pages 178-192 Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets (Sylvain Schmitz, Georg Zetzsche)....Pages 193-201 Synthesis of Structurally Restricted b-bounded Petri Nets: Complexity Results (Ronny Tredup)....Pages 202-217 Reachability of Five Gossip Protocols (Hans van Ditmarsch, Malvin Gattinger, Ioannis Kokkinis, Louwe B. Kuijer)....Pages 218-231 Back Matter ....Pages 233-233