Skip to main content
SpringerLink
Log in

Reachability Problems

12th International Conference, RP 2018, Marseille, France, September 24-26, 2018, Proceedings

  • Conference proceedings
  • © 2018

Overview

Editors:
  1. Igor Potapov

    1. University of Liverpool, Liverpool, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Pierre-Alain Reynier

    1. Aix-Marseille University, Marseille, France

    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 11123)

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

Included in the following conference series:

Conference proceedings info: RP 2018.

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 (11 papers)

  1. Front Matter

    Pages I-XXI
    Download chapter PDF

  2. Reachability Analysis of Nonlinear ODEs Using Polytopic Based Validated Runge-Kutta

    • Julien Alexandre dit Sandretto, Jian Wan
    Pages 1-14

  3. The Satisfiability of Word Equations: Decidable and Undecidable Theories

    • Joel D. Day, Vijay Ganesh, Paul He, Florin Manea, Dirk Nowotka
    Pages 15-29

  4. Left-Eigenvectors Are Certificates of the Orbit Problem

    • Steven de Oliveira, Virgile Prevosto, Peter Habermehl, Saddek Bensalem
    Pages 30-44

  5. Constrained Dynamic Tree Networks

    • Matthew Hague, Vincent Penelle
    Pages 45-58

  6. EXPSPACE-Complete Variant of Countdown Games, and Simulation on Succinct One-Counter Nets

    • Petr Jančar, Petr Osička, Zdeněk Sawa
    Pages 59-74

  7. Revisiting MU-Puzzle. A Case Study in Finite Countermodels Verification

    • Alexei Lisitsa
    Pages 75-86

  8. Knapsack in Hyperbolic Groups

    • Markus Lohrey
    Pages 87-102

  9. Generalized Tag Systems

    • Turlough Neary, Matthew Cook
    Pages 103-116

  10. Certain Query Answering on Compressed String Patterns: From Streams to Hyperstreams

    • Iovka Boneva, Joachim Niehren, Momar Sakho
    Pages 117-132

  11. Büchi VASS Recognise \(\mathbf {\Sigma }^{1}_{1}\)-complete \({\omega }\)-languages

    • Michał Skrzypczak
    Pages 133-145

  12. Qualitative Reachability for Open Interval Markov Chains

    • Jeremy Sproston
    Pages 146-160

  13. Back Matter

    Pages 161-161
    Download chapter PDF
Back to top

Other volumes

  1. Reachability Problems

Keywords

About this book

This book constitutes the refereed proceedings of the 12th International Conference on Reachability Problems, RP 2018, held in Marseille, France, in September 2018.

The 11 full papers presented were carefully reviewed and selected from 21 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

  • University of Liverpool, Liverpool, UK

    Igor Potapov

  • Aix-Marseille University, Marseille, France

    Pierre-Alain Reynier

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation