Reachability Problems

10th International Workshop, RP 2016, Aalborg, Denmark, September 19-21, 2016, Proceedings

  • Kim Guldstrand Larsen
  • Igor Potapov
  • Jiří Srba
Conference proceedings RP 2016

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

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

Table of contents

  1. Front Matter
    Pages I-XIV
  2. Alain Finkel
    Pages 1-22
  3. Axel Legay, Sean Sedwards, Louis-Marie Traonouez
    Pages 23-35
  4. Natasha Alechina, Nils Bulling, Stephane Demri, Brian Logan
    Pages 36-50
  5. Giorgio Delzanno
    Pages 63-76
  6. Thomas Geffroy, Jérôme Leroux, Grégoire Sutre
    Pages 77-89
  7. Henri Hansen, Antti Valmari
    Pages 90-103
  8. Sam A. M. Jones, Richard M. Thomas
    Pages 104-118
  9. Adrien Le Coënt, Laurent Fribourg, Nicolas Markey, Florian De Vuyst, Ludovic Chamoin
    Pages 119-133
  10. Adrien Le Coënt, Laurent Fribourg, Romain Soulat
    Pages 134-147
  11. Matthew Hague, Anthony Widjaja Lin
    Pages 148-162
  12. Reino Niskanen
    Pages 163-176
  13. Igor Potapov, Olena Prianychnykova, Sergey Verlan
    Pages 177-191
  14. Back Matter
    Pages 193-193

About these proceedings


This book constitutes the refereed proceedings of the 10th International Workshop on Reachability Problems, RP 2016, held in Aalborg, Denmark, in September 2016. The 11 full papers presented together with2 invited papers and 3 abstracts of invited talks were carefully reviewed and selected from 18 submissions. The papers cover a range of topics in the field of 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.


complex systems decidability hybrid systems Petri nets probabilistic systems automata theory dynamical systems groups infinite alphabet insertion-deletion languages reachability reachability games relational words rewriting systems theory of computation timed automata vector addition game winning strategy word problems

Editors and affiliations

  • Kim Guldstrand Larsen
    • 1
  • Igor Potapov
    • 2
  • Jiří Srba
    • 3
  1. 1.Aalborg UniversityAalborgDenmark
  2. 2.University of LiverpoolLiverpoolUnited Kingdom
  3. 3.Aalborg UniversityAalborgDenmark

Bibliographic information

  • DOI
  • Copyright Information Springer International Publishing Switzerland 2016
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science Computer Science (R0)
  • Print ISBN 978-3-319-45993-6
  • Online ISBN 978-3-319-45994-3
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
IT & Software
Consumer Packaged Goods
Energy, Utilities & Environment