Reachability Problems (Lecture Notes in Computer Science) de Joel Ouaknine

Reachability Problems: 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014, Proceedings: Lecture Notes in Computer Science, cartea 8762

Joel Ouaknine

Igor Potapov

James Worrell

en Limba Engleză Paperback – 23 sep 2014

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.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

20%

Preț: 426^.75 lei
20%

Preț: 315^.62 lei
20%

Preț: 320^.92 lei
15%

Preț: 426^.53 lei
20%

Preț: 313^.87 lei
20%

Preț: 355^.79 lei
20%

Preț: 355^.54 lei
20%

Preț: 355^.18 lei
20%

Preț: 390^.68 lei
20%

Preț: 392^.03 lei
20%

Preț: 498^.95 lei
20%

Preț: 390^.79 lei
20%

Preț: 495^.44 lei
20%

Preț: 498^.80 lei
20%

Preț: 498^.50 lei
20%

Preț: 355^.93 lei
20%

Preț: 639^.52 lei
20%

Preț: 499^.90 lei
20%

Preț: 498^.95 lei
20%

Preț: 270^.68 lei
20%

Preț: 321^.68 lei
20%

Preț: 391^.36 lei
20%

Preț: 322^.09 lei
20%

Preț: 498^.90 lei
20%

Preț: 312^.82 lei
20%

Preț: 496^.73 lei
20%

Preț: 463^.03 lei
20%

Preț: 531^.75 lei
15%

Preț: 496^.40 lei
20%

Preț: 497^.25 lei
20%

Preț: 498^.80 lei
20%

Preț: 461^.86 lei
20%

Preț: 355^.59 lei
20%

Preț: 324^.19 lei
Preț: 418^.19 lei
20%

Preț: 498^.59 lei
20%

Preț: 391^.28 lei
20%

Preț: 355^.69 lei
15%

Preț: 499^.72 lei
20%

Preț: 499^.40 lei
20%

Preț: 390^.42 lei
20%

Preț: 497^.75 lei
20%

Preț: 326^.81 lei
20%

Preț: 322^.32 lei
20%

Preț: 390^.42 lei
20%

Preț: 458^.84 lei
20%

Preț: 427^.09 lei
20%

Preț: 499^.90 lei
20%

Preț: 320^.72 lei

Specificații

ISBN-13: 9783319114385
ISBN-10: 3319114387
Pagini: 268
Ilustrații: XX, 246 p. 59 illus.
Dimensiuni: 155 x 235 x 14 mm
Greutate: 0.38 kg
Ediția:2014
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

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.