Reachability Problems : 11th International Workshop, RP 2017, London, UK, September 7-9, 2017 : proceedings

Front Matter ....Pages I-XV
 The Multiple Dimensions of Mean-Payoff Games  (Laurent Doyen)....Pages 1-8
 Adding Dense-Timed Stack to Integer Reset Timed Automata  (Devendra Bhave, Shibashis Guha)....Pages 9-25
 Space-Efficient Fragments of Higher-Order Fixpoint Logic  (Florian Bruse, Martin Lange, Etienne Lozes)....Pages 26-41
 Refinement of Trace Abstraction for Real-Time Programs  (Franck Cassez, Peter Gjøl Jensen, Kim Guldstrand Larsen)....Pages 42-58
 An Abstract Machine for Asynchronous Programs with Closures and Priority Queues  (Davide Ancona, Giorgio Delzanno, Luca Franceschini, Maurizio Leotta, Enrico Prampolini, Marina Ribaudo et al.)....Pages 59-74
 Copyful Streaming String Transducers  (Emmanuel Filiot, Pierre-Alain Reynier)....Pages 75-86
 Model Checking CTL over Restricted Classes of Automatic Structures  (Norbert Hundeshagen, Martin Lange)....Pages 87-100
 Topological Characterisation of Multi-buffer Simulation  (Milka Hutagalung)....Pages 101-117
 Distributed Control Synthesis Using Euler’s Method  (A. Le Coënt, J. Alexandre dit Sandretto, A. Chapoutot, L. Fribourg, F. De Vuyst, L. Chamoin)....Pages 118-131
 Reachability Problem for Polynomial Iteration Is PSPACE-complete  (Reino Niskanen)....Pages 132-143
 Probabilistic Timed Automata with Clock-Dependent Probabilities  (Jeremy Sproston)....Pages 144-159
 Stubborn Sets with Frozen Actions  (Antti Valmari)....Pages 160-175
 Parameterized Graph Connectivity and Polynomial-Time Sub-Linear-Space Short Reductions  (Tomoyuki Yamakami)....Pages 176-191
Back Matter ....Pages 193-193