Reachability Problems

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

  • Matthew Hague
  • Igor Potapov
Conference proceedings RP 2017

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

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 10506)

Table of contents

  1. Front Matter
    Pages I-XV
  2. Devendra Bhave, Shibashis Guha
    Pages 9-25
  3. Florian Bruse, Martin Lange, Etienne Lozes
    Pages 26-41
  4. Franck Cassez, Peter Gjøl Jensen, Kim Guldstrand Larsen
    Pages 42-58
  5. Davide Ancona, Giorgio Delzanno, Luca Franceschini, Maurizio Leotta, Enrico Prampolini, Marina Ribaudo et al.
    Pages 59-74
  6. Emmanuel Filiot, Pierre-Alain Reynier
    Pages 75-86
  7. Norbert Hundeshagen, Martin Lange
    Pages 87-100
  8. A. Le Coënt, J. Alexandre dit Sandretto, A. Chapoutot, L. Fribourg, F. De Vuyst, L. Chamoin
    Pages 118-131
  9. Antti Valmari
    Pages 160-175
  10. Back Matter
    Pages 193-193

About these proceedings

Introduction

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.

Keywords

semantics software engineering model checking automata theory timed automata translation (languages) programming languages computer software selection and evaluation verification Reachability problems in infinite state systems rewriting systems dynamical and hybrid systems Petri-Nets reachability problems in logic and verification

Editors and affiliations

  • Matthew Hague
    • 1
  • Igor Potapov
    • 2
  1. 1.Royal Holloway University of LondonLondonUnited Kingdom
  2. 2.University of LiverpoolLiverpoolUnited Kingdom

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-67089-8
  • Copyright Information Springer International Publishing AG 2017
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-67088-1
  • Online ISBN 978-3-319-67089-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book