TY  - BOOK
AU  - 
AU  - 
AU  - 
ED  - SpringerLink (Online service)
TI  - Reachability Problems: 6th International Workshop, RP 2012, Bordeaux, France, September 17-19, 2012. Proceedings 
T2  - Lecture Notes in Computer Science,
SN  - 9783642335129
AV  - QA76.9.L63 
U1  - 005.1015113 23
PY  - 2012///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg, Imprint: Springer
KW  - Computer science
KW  - Software engineering
KW  - Computer software
KW  - Logic design
KW  - Computer Science
KW  - Logics and Meanings of Programs
KW  - Software Engineering
KW  - Mathematical Logic and Formal Languages
KW  - Programming Languages, Compilers, Interpreters
KW  - Algorithm Analysis and Problem Complexity
KW  - Computation by Abstract Devices
N1  - Reachability problems in algebraic structures, computational models, hybrid systems, logic and verification -- Finite- and infinite-state concurrent systems -- Computational models -- Decision procedures; ZDB-2-SCS; ZDB-2-LNC
N2  - 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
UR  - http://dx.doi.org/10.1007/978-3-642-33512-9
ER  -