Reachability Problems

7th International Workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013 Proceedings

  • Parosh Aziz Abdulla
  • Igor Potapov
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8169)

Table of contents

  1. Front Matter
  2. Patricia Bouyer, Nicolas Markey, Ocan Sankur
    Pages 1-18
  3. Daniel Kroening
    Pages 19-20
  4. Rupak Majumdar, Roland Meyer, Zilong Wang
    Pages 21-22
  5. Akash Lal, Shaz Qadeer
    Pages 23-44
  6. Beatrice Bérard, Serge Haddad, Aleksandra Jovanović, Didier Lime
    Pages 59-69
  7. Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro
    Pages 70-82
  8. Carlo Bellettini, Matteo Camilli, Lorenzo Capra, Mattia Monga
    Pages 83-95
  9. Ilaria De Crescenzo, Salvatore La Torre
    Pages 96-108
  10. Giorgio Delzanno, Arnaud Sangnier, Riccardo Traverso
    Pages 109-121
  11. Søren Kristoffer Stiil Frederiksen, Peter Bro Miltersen
    Pages 122-134
  12. Laurent Fribourg, Romain Soulat
    Pages 135-145
  13. Sam A. M. Jones, Richard M. Thomas
    Pages 146-158
  14. Kais Klai, Naim Aber, Laure Petrucci
    Pages 159-170
  15. Richard Mayr, Patrick Totzke
    Pages 171-182
  16. Artturi Piipponen, Antti Valmari
    Pages 183-195
  17. Julien Reichert
    Pages 196-208

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 7th International Workshop on Reachability Problems, RP 2013, held in Uppsala, Sweden, in September 2013. The 19 revised papers (The 14 revised papers were carefully reviewed and selected from 24 submissions in addition to 5 invited talks) were carefully reviewed and selected from 24 submissions. Topics of interest include reachability for finite 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

algebraic structures automata computational models hybrid systems infinite state systems petri nets reachability problems rewriting systems verification

Editors and affiliations

  • Parosh Aziz Abdulla
    • 1
  • Igor Potapov
    • 2
  1. 1.Uppsala UniversitySweden
  2. 2.University of LiverpoolUK

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-41036-9
  • Copyright Information Springer-Verlag Berlin Heidelberg 2013
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-41035-2
  • Online ISBN 978-3-642-41036-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book