Reachability Problems: 6th International Workshop, RP 2012, Bordeaux, France, September 17-19, 2012. Proceedings

Description

This book constitutes the refereed proceedings of the 6th International Workshop on Reachability Problems, RP 2012, held in Bordeaux, France, in September, 2012. The 8 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 15 submissions. The papers present current research and original contributions related to reachability problems in different computational models and systems such as algebraic structures, computational models, hybrid systems, logic and verification. Reachability is a fundamental problem that appears in several different contexts: finite- and infinite-state concurrent systems, computational models like cellular automata and Petri nets, decision procedures for classical, modal and temporal logic, program analysis, discrete and continuous systems, time critical systems, and open systems modeled as games. Front Matter....Pages - Fraenkel-Mostowski Sets with Non-homogeneous Atoms....Pages 1-5 Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata....Pages 6-20 Decision Problems for Linear Recurrence Sequences....Pages 21-28 Playing Games with Counter Automata....Pages 29-41 LTL-Model-Checking via Model Composition....Pages 42-53 On the Relationship between Reachability Problems in Timed and Counter Automata....Pages 54-65 Smooth Sand Piles....Pages 66-78 Ariadne: Dominance Checking of Nonlinear Hybrid Automata Using Reachability Analysis....Pages 79-91 Robustness of Time Petri Nets under Guard Enlargement....Pages 92-106 Efficient Probabilistic Model Checking of Systems with Ranged Probabilities....Pages 107-120 On the Length of Knot Transformations via Reidemeister Moves I and II....Pages 121-136 Invariants for LTI Systems with Uncertain Input....Pages 137-148 Back Matter....Pages -