TY  - GEN
T1  - Reachability problems 5th international workshop, RP 2011, Genoa, Italy, September 28-30, 2011: proceedings
T2  - Lecture notes in computer science
T2  - LNCS sublibrary. SL 1, Theoretical computer science and general issues
A2  - Delzanno, Giorgio
A2  - Potapov, Igor
LA  - English
PP  - Berlin, New York
PB  - Springer
YR  - 2011
UL  - https://tuklas.up.edu.ph/Record/UP-99796217611154618
AB  - This book constitutes the refereed proceedings of the 5th International Workshop on Reachability Problems, RP 2011, held in Genoa, Italy, in September 2011. The 16 papers presented together with 4 invited talks were carefully reviewed and selected from 24 submissions. The workshop deals with reachability problems that appear in 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 modelled as games.
OP  - 244
SN  - 9783642242885 (eBook)
SN  - 364224288X (eBook)
KW  - Computer systems : Verification : Congresses.
KW  - Decidability (Mathematical logic) : Congresses.
KW  - Graph theory : Data processing : Congresses.
KW  - Electronic books.
ER  -