Reachability Problems 3rd International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Bournez, Olivier (Επιμελητής έκδοσης), Potapov, Igor (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2009.
• Σειρά: Lecture Notes in Computer Science, 5797
• Θέματα: Computer science.; Computer programming.; Computers.; Algorithms.; Computer logic.; Computer science > Mathematics.; Computer Science.; Mathematics of Computing.; Theory of Computation.; Programming Techniques.; Algorithm Analysis and Problem Complexity.; Logics and Meanings of Programs.; Computation by Abstract Devices.

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

Πίνακας περιεχομένων:

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