Reachability Problems
8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014, Proceedings
Published on 23. September 2014
Book
Paperback/Softback
XX, 246 pages
978-3-319-11438-5 (ISBN)
Description
This book constitutes the proceedings of the 8th International Workshop on Reachability Problems, RP 2014, held in Oxford, UK, in September 2014. The 17 papers presented in this volume were carefully reviewed and selected from 25 submissions. The book also contains a paper summarizing the invited talk. The papers offer new approaches for the modelling and analysis of computational processes by combining mathematical, algorithmic, and computational techniques.
More details
Series
Edition
2014 ed.
Language
English
Place of publication
Cham
Switzerland
Publishing group
Springer International Publishing
Target group
Professional and scholarly
Research
Illustrations
59 s/w Abbildungen
XX, 246 p. 59 illus.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 15 mm
Weight
411 gr
ISBN-13
978-3-319-11438-5 (9783319114385)
DOI
10.1007/978-3-319-11439-2
Schweitzer Classification
Other editions
Additional editions
Joel Ouaknine | Igor Potapov | James Worrell
Reachability Problems
8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014, Proceedings
E-Book
09/2014
Springer
€50.28
Available for download
Content
Complexity Bounds for Ordinal-Based Termination.- On The Complexity of Bounded Time Reachability for Piecewise Affine Systems.- Reachability and Mortality Problems for Restricted Hierarchical Piecewise Constant Derivatives.- Parameterized Verification of Communicating Automata under Context Bounds.- Regular Strategies in Pushdown Reachability Games.- Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations.- Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic.- Synthesising Succinct Strategies in Safety and Reachability Games.- Integer Vector Addition Systems with States.- Reachability in MDPs: Refining Convergence of Value Iteration.- On the Expressiveness of Metric Temporal Logic over Bounded Timed Words.- Trace Inclusion for One-Counter Nets Revisited.- Mean-Payoff Games with Partial-Observation.- Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstractions.- On Functions Weakly Computable by Petri Nets and Vector Addition Systems.- Generalized Craig Interpolation for Stochastic Satisfiability Modulo Theory Problems.- Transformations for Compositional Verification of Assumption-Commitment Properties.- Compositional Reachability in Petri Nets.