Skip to main content
  • Conference proceedings
  • © 2019

Reachability Problems

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

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 11674)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): RP: International Conference on Reachability Problems

Conference proceedings info: RP 2019.

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (17 papers)

  1. Front Matter

    Pages i-xx
  2. Bidding Games on Markov Decision Processes

    • Guy Avni, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Petr Novotný
    Pages 1-12
  3. Reaching Out Towards Fully Verified Autonomous Systems

    • Sriram Sankaranarayanan, Souradeep Dutta, Sergio Mover
    Pages 22-32
  4. On the m-eternal Domination Number of Cactus Graphs

    • Václav Blažej, Jan Matyáš Křišt’an, Tomáš Valla
    Pages 33-47
  5. On Relevant Equilibria in Reachability Games

    • Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Nathan Thomasset
    Pages 48-62
  6. Partial Solvers for Generalized Parity Games

    • Véronique Bruyère, Guillermo A. Pérez, Jean-François Raskin, Clément Tamines
    Pages 63-78
  7. Reachability in Augmented Interval Markov Chains

    • Ventsislav Chonev
    Pages 79-92
  8. On Solving Word Equations Using SAT

    • Joel D. Day, Thorsten Ehlers, Mitja Kulczynski, Florin Manea, Dirk Nowotka, Danny Bøgsted Poulsen
    Pages 93-106
  9. Cellular Automata for the Self-stabilisation of Colourings and Tilings

    • Nazim Fatès, Irène Marcovici, Siamak Taati
    Pages 121-136
  10. On the Computation of the Minimal Coverability Set of Petri Nets

    • Pierre-Alain Reynier, Frédéric Servais
    Pages 164-177
  11. Reachability of Five Gossip Protocols

    • Hans van Ditmarsch, Malvin Gattinger, Ioannis Kokkinis, Louwe B. Kuijer
    Pages 218-231
  12. Back Matter

    Pages 233-233

Other Volumes

  1. Reachability Problems

About this book

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.


Editors and Affiliations

  • Université Libre de Bruxelles, Brussels, Belgium

    Emmanuel Filiot

  • Université Catholique de Louvain, Louvain-la-Neuve, Belgium

    Raphaël Jungers

  • University of Liverpool, Liverpool, UK

    Igor Potapov

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access