Skip to main content
SpringerLink
Log in
Book cover

Reachability Problems

11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings

  • Conference proceedings
  • © 2017

Overview

Editors:
  1. Matthew Hague

    1. Royal Holloway University of London, London, United Kingdom

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Igor Potapov

    1. University of Liverpool, Liverpool, United Kingdom

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

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

Included in the following conference series:

Conference proceedings info: RP 2017.

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

  1. Front Matter

    Pages I-XV
    Download chapter PDF

  2. The Multiple Dimensions of Mean-Payoff Games

    • Laurent Doyen
    Pages 1-8

  3. Adding Dense-Timed Stack to Integer Reset Timed Automata

    • Devendra Bhave, Shibashis Guha
    Pages 9-25

  4. Space-Efficient Fragments of Higher-Order Fixpoint Logic

    • Florian Bruse, Martin Lange, Etienne Lozes
    Pages 26-41

  5. Refinement of Trace Abstraction for Real-Time Programs

    • Franck Cassez, Peter Gjøl Jensen, Kim Guldstrand Larsen
    Pages 42-58

  6. An Abstract Machine for Asynchronous Programs with Closures and Priority Queues

    • Davide Ancona, Giorgio Delzanno, Luca Franceschini, Maurizio Leotta, Enrico Prampolini, Marina Ribaudo et al.
    Pages 59-74

  7. Copyful Streaming String Transducers

    • Emmanuel Filiot, Pierre-Alain Reynier
    Pages 75-86

  8. Model Checking CTL over Restricted Classes of Automatic Structures

    • Norbert Hundeshagen, Martin Lange
    Pages 87-100

  9. Topological Characterisation of Multi-buffer Simulation

    • Milka Hutagalung
    Pages 101-117

  10. Distributed Control Synthesis Using Euler’s Method

    • A. Le Coënt, J. Alexandre dit Sandretto, A. Chapoutot, L. Fribourg, F. De Vuyst, L. Chamoin
    Pages 118-131

  11. Reachability Problem for Polynomial Iteration Is PSPACE-complete

    • Reino Niskanen
    Pages 132-143

  12. Probabilistic Timed Automata with Clock-Dependent Probabilities

    • Jeremy Sproston
    Pages 144-159

  13. Stubborn Sets with Frozen Actions

    • Antti Valmari
    Pages 160-175

  14. Parameterized Graph Connectivity and Polynomial-Time Sub-Linear-Space Short Reductions

    • Tomoyuki Yamakami
    Pages 176-191

  15. Back Matter

    Pages 193-193
    Download chapter PDF
Back to top

Other volumes

  1. Reachability Problems

Keywords

About this book

This book constitutes the refereed proceedings of the 11th International Workshop on Reachability Problems, RP 2017, held in London, UK, in September 2017. The 12 full papers presented together with 1 invited paper were carefully reviewed and selected from 17 submissions.

The aim of the conference is to bring together scholars from diverse fields with a shared interest in reachability problems, and to promote the exploration of new approaches for the modelling and analysis of computational processes by combining 

mathematical, algorithmic, and computational techniques. Topics of interest include (but are not limited to): reachability for innite 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

  • Royal Holloway University of London, London, United Kingdom

    Matthew Hague

  • University of Liverpool, Liverpool, United Kingdom

    Igor Potapov

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation