[Lecture Notes in Computer Science] Reachability Problems Volume 5797 || Algorithmic Information Theory and Foundations of Probability

✍ Scribed by Bournez, Olivier; Potapov, Igor

• Book ID: 121706569
• Publisher: Springer Berlin Heidelberg
• Year: 2009
• Tongue: English
• Weight: 130 KB
• Edition: 1
• Category: Article
• ISBN: 3642044204
• DOI: 10.1007/978-3-642-04420-5_4

✦ Synopsis

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 verification. Reachability is a fundamental problem in the context of many models and abstractions which are describing various computational processes. Topics of interest include reachability problems in infinite state systems, rewriting systems, dynamical and hybrid systems, reachability problems in logic and verification, reachability analysis in different computational models, counter, timed, cellular, communicating automata, Petri-Nets, computational aspects of algebraic structures and predictability in iterative maps and new computational paradigms.