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

• Corporate Author: SpringerLink (Online service)
• Other Authors: Ouaknine, Joël (Editor), Potapov, Igor (Editor), Worrell, James (Editor)
• Format: Electronic eBook
• Language: English
• Published: Cham : Springer International Publishing : Imprint: Springer, 2014.
• Series: Lecture Notes in Computer Science, 8762
• Subjects: Computer science.; Software engineering.; Programming languages (Electronic computers).; Coding theory.; Computers.; Computer logic.; Mathematical logic.; Computer Science.; Computation by Abstract Devices.; Logics and Meanings of Programs.; Software Engineering.; Programming Languages, Compilers, Interpreters.; Mathematical Logic and Formal Languages.; Coding and Information Theory.

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 ta...

Table of Contents:

• 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.