Advertisement

Reachability Problems

9th International Workshop, RP 2015, Warsaw, Poland, September 21-23, 2015, Proceedings

  • Mikolai Bojanczyk
  • Slawomir Lasota
  • Igor Potapov

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

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

Table of contents

  1. Front Matter
    Pages I-XX
  2. Étienne André, Didier Lime, Olivier H. Roux
    Pages 7-19
  3. Béatrice Bérard, Serge Haddad, Claudine Picaronny, Mohab Safey El Din, Mathieu Sassolas
    Pages 20-32
  4. Nathanaël Fijalkow, Michał Skrzypczak
    Pages 33-36
  5. Laurent Fribourg, Eric Goubault, Sameh Mohamed, Marian Mrozek, Sylvie Putot
    Pages 63-75
  6. Ranko Lazić, Sylvain Schmitz
    Pages 76-88
  7. Antonia Lechner
    Pages 89-100
  8. Jérôme Leroux, Grégoire Sutre, Patrick Totzke
    Pages 101-113
  9. Nirina Andrianarivelo, Pierre Réty
    Pages 128-139
  10. Masaya Shimakawa, Shigeki Hagihara, Naoki Yonezaki
    Pages 140-152
  11. Back Matter
    Pages 179-179

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 9th International Workshop on Reachability Problems, RP 2015, held in Warsaw, Poland, in September 2015. The 14 papers presented together with 6 extended abstracts in this volume were carefully reviewed and selected from 23 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.

Keywords

Algebraic Structures Automata Theory Cellular Automata Communicating Automata Computability and Decidability Computational Aspects of Semigroups, Groups, and Rings Computational Models Dynamical Systems Formal Methods Hybrid Systems Petri Nets Predictability in Iterative Maps Probabilistic Automata Reachability Analysis Reachability Problems in Logic and Verification Rewriting Systems Theory of Computation Timed Automata Undecidable Reachability Problems

Editors and affiliations

  • Mikolai Bojanczyk
    • 1
  • Slawomir Lasota
    • 2
  • Igor Potapov
    • 3
  1. 1.The Institute of InformaticsUniversity of WarsawWarsawPoland
  2. 2.The Institute of InformaticsUniversity of WarsawWarsawPoland
  3. 3.University of LiverpoolLiverpoolUnited Kingdom

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-24537-9
  • Copyright Information Springer International Publishing Switzerland 2015
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-24536-2
  • Online ISBN 978-3-319-24537-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Biotechnology
Electronics
IT & Software
Telecommunications
Aerospace
Engineering