Reachability Problems: 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014. Proceedings

Front Matter....Pages -
Complexity Bounds for Ordinal-Based Termination....Pages 1-19
On The Complexity of Bounded Time Reachability for Piecewise Affine Systems....Pages 20-31
Reachability and Mortality Problems for Restricted Hierarchical Piecewise Constant Derivatives....Pages 32-44
Parameterized Verification of Communicating Automata under Context Bounds....Pages 45-57
Regular Strategies in Pushdown Reachability Games....Pages 58-71
Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations....Pages 72-84
Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic....Pages 85-97
Synthesising Succinct Strategies in Safety and Reachability Games....Pages 98-111
Integer Vector Addition Systems with States....Pages 112-124
Reachability in MDPs: Refining Convergence of Value Iteration....Pages 125-137
On the Expressiveness of Metric Temporal Logic over Bounded Timed Words....Pages 138-150
Trace Inclusion for One-Counter Nets Revisited....Pages 151-162
Mean-Payoff Games with Partial-Observation....Pages 163-175
Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstractions....Pages 176-189
On Functions Weakly Computable by Petri Nets and Vector Addition Systems....Pages 190-202
Generalized Craig Interpolation for Stochastic Satisfiability Modulo Theory Problems....Pages 203-215
Transformations for Compositional Verification of Assumption-Commitment Properties....Pages 216-229
Compositional Reachability in Petri Nets....Pages 230-243
Back Matter....Pages -