Skip to main content
SpringerLink
Log in

Reachability Problems

14th International Conference, RP 2020, Paris, France, October 19–21, 2020, Proceedings

  • Conference proceedings
  • © 2020

Overview

Editors:
  1. Sylvain Schmitz

    1. Université de Paris, Paris, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Igor Potapov

    1. University of Liverpool, Liverpool, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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

Included in the following conference series:

Conference proceedings info: RP 2020.

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (10 papers)

  1. Front Matter

    Pages I-XXI
    Download chapter PDF

  2. Invited Papers

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. On Decision Problems for Substitutions in Symbolic Dynamics

      • Valérie Berthé
      Pages 3-19

    3. Games with Full, Longitudinal, and Transverse Observability

      • Orna Kupferman
      Pages 20-34

  3. Regular Papers

    1. Front Matter

      Pages 35-35
      Download chapter PDF

    2. Reachability Set Generation Using Hybrid Relation Compatible Saturation

      • Shruti Biswal, Andrew S. Miner
      Pages 37-51

    3. Case Study: Reachability and Scalability in a Unified Combat-Command-and-Control Model

      • Sergiy Bogomolov, Marcelo Forets, Kostiantyn Potomkin
      Pages 52-66

    4. Qualitative Multi-objective Reachability for Ordered Branching MDPs

      • Kousha Etessami, Emanuel Martinov
      Pages 67-82

    5. Quantum-over-Classical Advantage in Solving Multiplayer Games

      • Dmitry Kravchenko, Kamil Khadiev, Danil Serov, Ruslan Kapralov
      Pages 83-98

    6. Efficient Restrictions of Immediate Observation Petri Nets

      • Michael Raskin, Chana Weil-Kennedy
      Pages 99-114

    7. Binary Expression of Ancestors in the Collatz Graph

      • Tristan Stérin
      Pages 115-130

    8. The Collatz Process Embeds a Base Conversion Algorithm

      • Tristan Stérin, Damien Woods
      Pages 131-147

    9. The Complexity of the Label-Splitting-Problem for Flip-Flop-Nets

      • Ronny Tredup
      Pages 148-163

  4. Back Matter

    Pages 165-165
    Download chapter PDF
Back to top

Other volumes

  1. Reachability Problems

Keywords

About this book

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.

Editors and Affiliations

  • Université de Paris, Paris, France

    Sylvain Schmitz

  • University of Liverpool, Liverpool, UK

    Igor Potapov

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation