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

Reachability Problems 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014, Proceedings / edited by Joel Ouaknine, Igor Potapov, James Worrell.

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

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Ouaknine, Joel (Editor), Potapov, Igor (Editor), Worrell, James (Editor)
Format: eBook
Language:English
Published: Cham : Springer International Publishing : Imprint: Springer, 2014.
Edition:1st ed. 2014.
Series:Theoretical Computer Science and General Issues ; 8762
Springer eBook Collection.
Subjects:
Computers.
Computer logic.
Software engineering.
Programming languages (Electronic computers).
Mathematical logic.
Coding theory.
Information theory.
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
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.

Similar Items