Del 8762 i serien Lecture Notes in Computer Science

Reachability Problems

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

Häftad, Engelska, 2014

AvJoel Ouaknine,Igor Potapov,James Worrell

699 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

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

Utgivningsdatum2014-09-23
Mått155 x 235 x 15 mm
Vikt411 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor246
FörlagSpringer International Publishing AG
ISBN9783319114385

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Programvaruutveckling inom Data och IT
Programmeringsböcker inom Data och IT
Referensverk och tvärvetenskap inom Samhälle och politik

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.