Skip to main content
  • Conference proceedings
  • © 2015

Reachability Problems

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

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

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

Conference series link(s): RP: International Conference on Reachability Problems

Conference proceedings info: RP 2015.

Buy it now

Buying options

eBook USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 44.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

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (15 papers)

  1. Front Matter

    Pages I-XX
  2. Integer-Complete Synthesis for Bounded Parametric Timed Automata

    • Étienne André, Didier Lime, Olivier H. Roux
    Pages 7-19
  3. Polynomial Interrupt Timed Automata

    • Béatrice Bérard, Serge Haddad, Claudine Picaronny, Mohab Safey El Din, Mathieu Sassolas
    Pages 20-32
  4. Irregular Behaviours for Probabilistic Automata

    • Nathanaël Fijalkow, Michał Skrzypczak
    Pages 33-36
  5. A Topological Method for Finding Invariant Sets of Continuous Systems

    • Laurent Fribourg, Eric Goubault, Sameh Mohamed, Marian Mrozek, Sylvie Putot
    Pages 63-75
  6. The Ideal View on Rackoff’s Coverability Technique

    • Ranko Lazić, Sylvain Schmitz
    Pages 76-88
  7. Synthesis Problems for One-Counter Automata

    • Antonia Lechner
    Pages 89-100
  8. On Boundedness Problems for Pushdown Vector Addition Systems

    • Jérôme Leroux, Grégoire Sutre, Patrick Totzke
    Pages 101-113
  9. Over-Approximating Terms Reachable by Context-Sensitive Rewriting

    • Nirina Andrianarivelo, Pierre Réty
    Pages 128-139
  10. Reducing Bounded Realizability Analysis to Reachability Checking

    • Masaya Shimakawa, Shigeki Hagihara, Naoki Yonezaki
    Pages 140-152
  11. Back Matter

    Pages 179-179

Other Volumes

  1. Reachability Problems

About this book

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.

Editors and Affiliations

  • The Institute of Informatics, University of Warsaw, Warsaw, Poland

    Mikolai Bojanczyk, Slawomir Lasota

  • University of Liverpool, Liverpool, United Kingdom

    Igor Potapov

Bibliographic Information

Buy it now

Buying options

eBook USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 44.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