00000cmm a22000004a 4500 UP-99796217611154618 Buklod 20140305092101.0 m go j cr |n |||auu|a 111021s2011 xx u a eng d 9783642242885 (eBook) 364224288X (eBook) (iLib)UPD-00214604446 DML eng DMLUC QA 76.76 V47 R6 2011eb RP (Workshop) (5th 2011 Genoa, Italy) Reachability problems [electronic resource] 5th international workshop, RP 2011, Genoa, Italy, September 28-30, 2011: proceedings Giorgio Delzanno, Igor Potapov (eds.). Berlin New York Springer c2011. 1 online resource (xii, 244 p.) Lecture notes in computer science 6945 LNCS sublibrary. SL 1, Theoretical computer science and general issues IP based subscription, on campus and remote access. Access via Electronic Resources of the UPD University Library Website. 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. Electronic reproduction. New York SpringerLink 2011. Available via World Wide Web through Springerlink. Computer systems Verification Congresses. Decidability (Mathematical logic) Congresses. Graph theory Data processing Congresses. Electronic books. Delzanno, Giorgio. Potapov, Igor. SpringerLink (Online service). Available for University of the Philippines Diliman via Springerlink. Click here to access http://link.springer.com/book/10.1007/978-3-642-24288-5 FO Monograph UPD DMLR Electronic Resource