Skip to main content
SpringerLink
Log in
Book cover

Reachability Problems

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

  • Conference proceedings
  • © 2015

Overview

Editors:
  1. Mikolai Bojanczyk

    1. The Institute of Informatics, University of Warsaw, Warsaw, Poland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Slawomir Lasota

    1. The Institute of Informatics, University of Warsaw, Warsaw, Poland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Igor Potapov

    1. University of Liverpool, Liverpool, United Kingdom

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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)

Included in the following conference series:

Conference proceedings info: RP 2015.

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (15 papers)

  1. Front Matter

    Pages I-XX
    Download chapter PDF

  2. Reasoning About Cost-Utility Constraints in Probabilistic Models

    • Christel Baier
    Pages 1-6

  3. Integer-Complete Synthesis for Bounded Parametric Timed Automata

    • Étienne André, Didier Lime, Olivier H. Roux
    Pages 7-19

  4. Polynomial Interrupt Timed Automata

    • Béatrice Bérard, Serge Haddad, Claudine Picaronny, Mohab Safey El Din, Mathieu Sassolas
    Pages 20-32

  5. Irregular Behaviours for Probabilistic Automata

    • Nathanaël Fijalkow, Michał Skrzypczak
    Pages 33-36

  6. Reachability in Succinct One-Counter Games

    • Paul Hunter
    Pages 37-49

  7. On Reachability-Related Games on Vector Addition Systems with States

    • Petr Jančar
    Pages 50-62

  8. A Topological Method for Finding Invariant Sets of Continuous Systems

    • Laurent Fribourg, Eric Goubault, Sameh Mohamed, Marian Mrozek, Sylvie Putot
    Pages 63-75

  9. The Ideal View on Rackoff’s Coverability Technique

    • Ranko Lazić, Sylvain Schmitz
    Pages 76-88

  10. Synthesis Problems for One-Counter Automata

    • Antonia Lechner
    Pages 89-100

  11. On Boundedness Problems for Pushdown Vector Addition Systems

    • Jérôme Leroux, Grégoire Sutre, Patrick Totzke
    Pages 101-113

  12. Multithreaded-Cartesian Abstract Interpretation of Multithreaded Recursive Programs Is Polynomial

    • Alexander Malkis
    Pages 114-127

  13. Over-Approximating Terms Reachable by Context-Sensitive Rewriting

    • Nirina Andrianarivelo, Pierre Réty
    Pages 128-139

  14. Reducing Bounded Realizability Analysis to Reachability Checking

    • Masaya Shimakawa, Shigeki Hagihara, Naoki Yonezaki
    Pages 140-152

  15. Rearranging Two Dimensional Arrays by Prefix Reversals

    • Akihiro Yamamura
    Pages 153-165

  16. The Emptiness Problem for Valence Automata or: Another Decidable Extension of Petri Nets

    • Georg Zetzsche
    Pages 166-178

  17. Back Matter

    Pages 179-179
    Download chapter PDF
Back to top

Other volumes

  1. Reachability Problems

Keywords

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

Publish with us

Policies and ethics

Back to top

Search

Navigation