Skip to main content
SpringerLink
Log in

Reachability Problems

17th International Conference, RP 2023, Nice, France, October 11–13, 2023, Proceedings

  • Conference proceedings
  • © 2023

Overview

Editors:
  1. Olivier Bournez

    1. École Polytechnique, Paris, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Enrico Formenti

    1. Université Côte d’Azur, Nice, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. 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 14235)

Included in the following conference series:

Conference proceedings info: RP 2023.

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 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 64.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 (14 papers)

  1. Front Matter

    Pages i-xlviii
    Download chapter PDF

  2. Invited Papers

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Randomness Quality and Trade-Offs for CA Random String Generators

      • Bruno Martin
      Pages 3-12

  3. Regular Papers

    1. Front Matter

      Pages 13-13
      Download chapter PDF

    2. Complexity of Reachability Problems in Neural Networks

      • Adrian Wurm
      Pages 15-27

    3. Weakly Synchronous Systems with Three Machines Are Turing Powerful

      • Cinzia Di Giusto, Davide Ferre’, Etienne Lozes, Nicolas Nisse
      Pages 28-41

    4. On the Identity and Group Problems for Complex Heisenberg Matrices

      • Paul C. Bell, Reino Niskanen, Igor Potapov, Pavel Semukhin
      Pages 42-55

    5. Reachability Analysis of a Class of Hybrid Gene Regulatory Networks

      • Honglu Sun, Maxime Folschette, Morgan Magnin
      Pages 56-69

    6. Quantitative Reachability Stackelberg-Pareto Synthesis Is NEXPTIME-Complete

      • Thomas Brihaye, Véronique Bruyère, Gaspard Reghem
      Pages 70-84

    7. Multi-weighted Reachability Games

      • Thomas Brihaye, Aline Goeminne
      Pages 85-97

    8. On the Complexity of Robust Eventual Inequality Testing for C-Finite Functions

      • Eike Neumann
      Pages 98-112

    9. Adaptive Directions for Bernstein-Based Polynomial Set Evolution

      • Alberto Casagrande, Carla Piazza
      Pages 113-126

    10. Introducing Divergence for Infinite Probabilistic Models

      • Alain Finkel, Serge Haddad, Lina Ye
      Pages 127-140

    11. A Framework for the Competitive Analysis of Model Predictive Controllers

      • Stijn Bellis, Joachim Denil, Ramesh Krishnamurthy, Tim Leys, Guillermo A. Pérez, Ritam Raha
      Pages 141-154

    12. Matching Patterns with Variables Under Simon’s Congruence

      • Pamela Fleischmann, Sungmin Kim, Tore Koß, Florin Manea, Dirk Nowotka, Stefan Siemer et al.
      Pages 155-170

    13. HyperMonitor: A Python Prototype for Hyper Predictive Runtime Verification

      • Angelo Ferrando, Giorgio Delzanno
      Pages 171-182

    14. Generalized ARRIVAL Problem for Rotor Walks in Path Multigraphs

      • David Auger, Pierre Coucheney, Loric Duhazé, Kossi Roland Etse
      Pages 183-198

  4. Back Matter

    Pages 199-199
    Download chapter PDF
Back to top

Other volumes

  1. Reachability Problems

Keywords

About this book

This book constitutes the refereed proceedings of the 17th International Conference on Reachability Problems, RP 2023, held in Nice, France, during October 11–13, 2023.


The 13 full papers included in this book were carefully reviewed and selected from 19 submissions. They present recent research on reachability problems to promote the exploration of new approaches for the modeling and analysis of computational processes by combining mathematical, algorithmic, and computational techniques.

Editors and Affiliations

  • École Polytechnique, Paris, France

    Olivier Bournez

  • Université Côte d’Azur, Nice, France

    Enrico Formenti

  • University of Liverpool, Liverpool, UK

    Igor Potapov

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation