Reachability Problems

8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014, Proceedings

AvJoel Ouaknine,Igor Potapov

Häftad, Engelska, 2014

Del 8762 i serien Lecture Notes in Computer Science

532 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This book constitutes the proceedings of the 8th International Workshop on Reachability Problems, RP 2014, held in Oxford, UK, in September 2014. The papers offer new approaches for the modelling and analysis of computational processes by combining mathematical, algorithmic, and computational techniques.

Produktinformation

Utgivningsdatum:2014-09-23
Mått:155 x 235 x 15 mm
Vikt:411 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:246
Förlag:Springer International Publishing AG
ISBN:9783319114385

Utforska kategorier

Innehållsförteckning

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.