Skip to main content
SpringerLink
Log in
Book cover

Reachability Problems

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

  • Conference proceedings
  • © 2013

Overview

Editors:
  1. Parosh Aziz Abdulla

    1. Uppsala University, Sweden

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Igor Potapov

    1. University of Liverpool, UK

    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 8169)

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

Included in the following conference series:

Conference proceedings info: RP 2013.

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

  1. Front Matter

    Download chapter PDF

  2. Robustness in Timed Automata

    • Patricia Bouyer, Nicolas Markey, Ocan Sankur
    Pages 1-18

  3. Automated Verification of Concurrent Software

    • Daniel Kroening
    Pages 19-20

  4. Provenance Verification

    • Rupak Majumdar, Roland Meyer, Zilong Wang
    Pages 21-22

  5. Reachability Modulo Theories

    • Akash Lal, Shaz Qadeer
    Pages 23-44

  6. The Dynamic Complexity of the Reachability Problem on Graphs

    • Thomas Schwentick
    Pages 45-45

  7. Reachability Problems for Hierarchical Piecewise Constant Derivative Systems

    • Paul C. Bell, Shang Chen
    Pages 46-58

  8. Parametric Interrupt Timed Automata

    • Beatrice Bérard, Serge Haddad, Aleksandra Jovanović, Didier Lime
    Pages 59-69

  9. Deciding Continuous-Time Metric Temporal Logic with Counting Modalities

    • Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro
    Pages 70-82

  10. MaRDiGraS: Simplified Building of Reachability Graphs on Large Clusters

    • Carlo Bellettini, Matteo Camilli, Lorenzo Capra, Mattia Monga
    Pages 83-95

  11. Modular Synthesis with Open Components

    • Ilaria De Crescenzo, Salvatore La Torre
    Pages 96-108

  12. Parameterized Verification of Broadcast Networks of Register Automata

    • Giorgio Delzanno, Arnaud Sangnier, Riccardo Traverso
    Pages 109-121

  13. Monomial Strategies for Concurrent Reachability Games and Other Stochastic Games

    • Søren Kristoffer Stiil Frederiksen, Peter Bro Miltersen
    Pages 122-134

  14. Stability Controllers for Sampled Switched Systems

    • Laurent Fribourg, Romain Soulat
    Pages 135-145

  15. Formal Languages, Word Problems of Groups and Decidability

    • Sam A. M. Jones, Richard M. Thomas
    Pages 146-158

  16. Verification of Reachability Properties for Time Petri Nets

    • Kais Klai, Naim Aber, Laure Petrucci
    Pages 159-170

  17. Branching-Time Model Checking Gap-Order Constraint Systems

    • Richard Mayr, Patrick Totzke
    Pages 171-182

  18. Constructing Minimal Coverability Sets

    • Artturi Piipponen, Antti Valmari
    Pages 183-195

  19. On the Complexity of Counter Reachability Games

    • Julien Reichert
    Pages 196-208

  20. Completeness Results for Generalized Communication-Free Petri Nets with Arbitrary Edge Multiplicities

    • Ernst W. Mayr, Jeremias Weihmann
    Pages 209-221
Back to top

Other volumes

  1. Reachability Problems

Keywords

About this book

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.

Editors and Affiliations

  • Uppsala University, Sweden

    Parosh Aziz Abdulla

  • University of Liverpool, UK

    Igor Potapov

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation