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

Description

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. Front Matter....Pages - Robustness in Timed Automata....Pages 1-18 Automated Verification of Concurrent Software....Pages 19-20 Provenance Verification....Pages 21-22 Reachability Modulo Theories....Pages 23-44 The Dynamic Complexity of the Reachability Problem on Graphs....Pages 45-45 Reachability Problems for Hierarchical Piecewise Constant Derivative Systems....Pages 46-58 Parametric Interrupt Timed Automata....Pages 59-69 Deciding Continuous-Time Metric Temporal Logic with Counting Modalities....Pages 70-82 MaRDiGraS : Simplified Building of Reachability Graphs on Large Clusters....Pages 83-95 Modular Synthesis with Open Components....Pages 96-108 Parameterized Verification of Broadcast Networks of Register Automata....Pages 109-121 Monomial Strategies for Concurrent Reachability Games and Other Stochastic Games....Pages 122-134 Stability Controllers for Sampled Switched Systems....Pages 135-145 Formal Languages, Word Problems of Groups and Decidability....Pages 146-158 Verification of Reachability Properties for Time Petri Nets....Pages 159-170 Branching-Time Model Checking Gap-Order Constraint Systems....Pages 171-182 Constructing Minimal Coverability Sets....Pages 183-195 On the Complexity of Counter Reachability Games....Pages 196-208 Completeness Results for Generalized Communication-Free Petri Nets with Arbitrary Edge Multiplicities....Pages 209-221 Back Matter....Pages -