Skip to main content
  • Conference proceedings
  • © 2022

Reachability Problems

16th International Conference, RP 2022, Kaiserslautern, Germany, October 17–21, 2022, Proceedings

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

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

Conference proceedings info: RP 2022.

Buying options

eBook USD 44.99
Price excludes VAT (USA)
  • ISBN: 978-3-031-19135-0
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 59.99
Price excludes VAT (USA)

This is a preview of subscription content, access via your institution.

Table of contents (11 papers)

  1. Front Matter

    Pages i-xliii
  2. Invited Papers

    1. Front Matter

      Pages 1-1
    2. SAT-Based Invariant Inference and Its Relation to Concept Learning

      • Yotam M. Y. Feldman, Sharon Shoham
      Pages 3-27
  3. Regular Papers

    1. Front Matter

      Pages 47-47
    2. Linearization, Model Reduction and Reachability in Nonlinear odes

      • Michele Boreale, Luisa Collodi
      Pages 49-66
    3. History-Deterministic Timed Automata Are Not Determinizable

      • Sougata Bose, Thomas A. Henzinger, Karoliina Lehtinen, Sven Schewe, Patrick Totzke
      Pages 67-76
    4. The Stochastic Arrival Problem

      • Thomas Webster
      Pages 93-107
    5. On Higher-Order Reachability Games Vs May Reachability

      • Kazuyuki Asada, Hiroyuki Katsura, Naoki Kobayashi
      Pages 108-124
    6. Coefficient Synthesis for Threshold Automata

      • A. R. Balasubramanian
      Pages 125-139
    7. Subsequences in Bounded Ranges: Matching and Analysis Problems

      • Maria Kosche, Tore Koß, Florin Manea, Viktoriya Pak
      Pages 140-159
  4. Back Matter

    Pages 179-179

Other Volumes

  1. Reachability Problems

About this book

This book constitutes the refereed proceedings of the 15th International Conference on Reachability Problems, RP 2022, held in Kaiserslautern, Germany, in October 2022.

The 8 full papers presented were carefully reviewed and selected from 14 submissions. In addition, 3 invited papers were included in this volume. The RP proceedings 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.


Keywords

  • architecture verification and validation
  • artificial intelligence
  • automata theory
  • computer programming
  • computer systems
  • distributed computer systems
  • distributed systems
  • embedded systems
  • formal languages
  • formal logic
  • graph theory
  • model checking
  • software architecture
  • software design
  • software engineering
  • theoretical computer science

Editors and Affiliations

  • Department of Computer Science, TU Kaiserslautern, Kaiserslautern, Germany

    Anthony W. Lin

  • Max Planck Institute for Software Systems, Kaiserslautern, Germany

    Georg Zetzsche

  • University of Liverpool, Liverpool, UK

    Igor Potapov

Bibliographic Information

Buying options

eBook USD 44.99
Price excludes VAT (USA)
  • ISBN: 978-3-031-19135-0
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 59.99
Price excludes VAT (USA)