Reachability Problems

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

Editors:

ISBN: 978-3-642-41035-2 (Print) 978-3-642-41036-9 (Online)

Table of contents (19 chapters)

  1. Front Matter

    Pages -

  2. No Access

    Book Chapter

    Pages 1-18

    Robustness in Timed Automata

  3. No Access

    Book Chapter

    Pages 19-20

    Automated Verification of Concurrent Software

  4. No Access

    Book Chapter

    Pages 21-22

    Provenance Verification

  5. No Access

    Book Chapter

    Pages 23-44

    Reachability Modulo Theories

  6. No Access

    Book Chapter

    Pages 45-45

    The Dynamic Complexity of the Reachability Problem on Graphs

  7. No Access

    Book Chapter

    Pages 46-58

    Reachability Problems for Hierarchical Piecewise Constant Derivative Systems

  8. No Access

    Book Chapter

    Pages 59-69

    Parametric Interrupt Timed Automata

  9. No Access

    Book Chapter

    Pages 70-82

    Deciding Continuous-Time Metric Temporal Logic with Counting Modalities

  10. No Access

    Book Chapter

    Pages 83-95

    MaRDiGraS: Simplified Building of Reachability Graphs on Large Clusters

  11. No Access

    Book Chapter

    Pages 96-108

    Modular Synthesis with Open Components

  12. No Access

    Book Chapter

    Pages 109-121

    Parameterized Verification of Broadcast Networks of Register Automata

  13. No Access

    Book Chapter

    Pages 122-134

    Monomial Strategies for Concurrent Reachability Games and Other Stochastic Games

  14. No Access

    Book Chapter

    Pages 135-145

    Stability Controllers for Sampled Switched Systems

  15. No Access

    Book Chapter

    Pages 146-158

    Formal Languages, Word Problems of Groups and Decidability

  16. No Access

    Book Chapter

    Pages 159-170

    Verification of Reachability Properties for Time Petri Nets

  17. No Access

    Book Chapter

    Pages 171-182

    Branching-Time Model Checking Gap-Order Constraint Systems

  18. No Access

    Book Chapter

    Pages 183-195

    Constructing Minimal Coverability Sets

  19. No Access

    Book Chapter

    Pages 196-208

    On the Complexity of Counter Reachability Games

  20. No Access

    Book Chapter

    Pages 209-221

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

  21. Back Matter

    Pages -