Reachability Problems Third International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009, Proceedings /

This book constitutes the research papers presented at the 3rd International Workshop, RP 2009 held in Palaiseau, France, September 23-25, 2009. The 20 full papers of this workshop reflect reachability problems that appear in algebraic structures, computational models, hybrid systems and verificatio...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Bournez, Olivier (Editor ), Potapov, Igor (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2009.
Edición:1st ed. 2009.
Colección:Theoretical Computer Science and General Issues, 5797
Temas:
Computer science-Mathematics.
Computer science.
Computer programming.
Algorithms.
Mathematics of Computing.
Theory of Computation.
Programming Techniques.
Computer Science Logic and Foundations of Programming.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • On the Reachability Problem for Dynamic Networks of Concurrent Pushdown Systems
  • Formalisms for Specifying Markovian Population Models
  • Reachability for Continuous and Hybrid Systems
  • Algorithmic Information Theory and Foundations of Probability
  • Model Checking as A Reachability Problem
  • Automatic Verification of Directory-Based Consistency Protocols
  • On Yen's Path Logic for Petri Nets
  • Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates
  • How to Tackle Integer Weighted Automata Positivity
  • A Reduction Theorem for the Verification of Round-Based Distributed Algorithms
  • Computable CTL * for Discrete-Time and Continuous-Space Dynamic Systems
  • An Undecidable Permutation of the Natural Numbers
  • Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order
  • Counting Multiplicity over Infinite Alphabets
  • The Periodic Domino Problem Is Undecidable in the Hyperbolic Plane
  • Games with Opacity Condition
  • Abstract Counterexamples for Non-disjunctive Abstractions
  • Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-Based Systems
  • Games on Higher Order Multi-stack Pushdown Systems
  • Limit Set Reachability in Asynchronous Graph Dynamical Systems.

Ejemplares similares