| Description |
1 online resource (xx, 246 pages) : illustrations |
| Series |
Lecture Notes in Computer Science, 0302-9743 ; 8762 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 8762. 0302-9743
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
880-01 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 |
|
880-01/(S Intro; Preface; Organization; Algorithms for Branching Markov Decision Processes; References; Walking with Data -- Where Does it Stop; References; Complexity Bounds for Ordinal-Based Termination; On the Subtle Interaction Between Reachability and Liveness; Table of Contents; Complexity Bounds for Ordinal-Based Termination; 1 Introduction; 2 Well Quasi Orders and Termination; 2.1 Well Quasi Orders; 2.2 Termination; 2.3 Ordinals; 3 Complexity Bounds; 3.1 Controlled Ranking Functions; 3.2 Hardy and Cichon H́ierarchies; 3.3 A Length Function Theorem for ε0; 4 Complexity Classification |
| Summary |
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 |
| Notes |
International conference proceedings |
| Bibliography |
Includes bibliographical references and author index |
| Notes |
Online resource; title from PDF title page (SpringerLink, viewed September 24, 2014) |
| Subject |
Computer systems -- Verification -- Congresses
|
|
Decidability (Mathematical logic) -- Congresses
|
|
Computer science -- Mathematics -- Congresses
|
|
Computer science -- Mathematics
|
|
Computer systems -- Verification
|
|
Decidability (Mathematical logic)
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Ouaknine, Joël, editor.
|
|
Potapov, Igor, editor.
|
|
Worrell, James, editor
|
| ISBN |
9783319114392 |
|
3319114395 |
|
3319114387 |
|
9783319114385 |
|
