Reachability Problems

6th International Workshop, RP 2012, Bordeaux, France, September 17-19, 2012. Proceedings
2012
ISBN: 978-3-642-33511-2
Verlag: Springer

Buch, Englisch, 149 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 260 g

Reihe: Theoretical Computer Science and General Issues

This book constitutes the refereed proceedings of the 6th International Workshop on Reachability Problems, RP 2012, held in Bordeaux, France, in September, 2012. The 8 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 15 submissions. The papers present current research and original contributions related to reachability problems in different computational models and systems such as algebraic structures, computational models, hybrid systems, logic and verification. Reachability is a fundamental problem that appears in several different contexts: finite- and infinite-state concurrent systems, computational models like cellular automata and Petri nets, decision procedures for classical, modal and temporal logic, program analysis, discrete and continuous systems, time critical systems, and open systems modeled as games.

Zielgruppe

Research

Autoren/Hrsg.

Finkel, Alain

Potapov, Igor

Leroux, Jerome

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Theoretische Informatik
• Mathematik | Informatik EDV | Informatik Informatik Berechenbarkeitstheorie, Komplexitätstheorie

Inhaltsverzeichnis

Reachability problems in algebraic structures, computational models, hybrid systems, logic and verification.- Finite- and infinite-state concurrent systems.- Computational models.- Decision procedures.