TY - BOOK AU - Delzanno,Giorgio AU - Potapov,Igor ED - RP (Workshop) TI - Reachability problems: 5th International Workshop, RP 2011, Genoa, Italy, September 28-30, 2011. Proceedings T2 - Lecture notes in computer science, SN - 9783642242885 AV - QA76.76.V47 R6 2011 U1 - 003 23 PY - 2011/// CY - Berlin, New York PB - Springer KW - Computer systems KW - Verification KW - Congresses KW - Decidability (Mathematical logic) KW - Graph theory KW - Data processing KW - Systèmes informatiques KW - Vérification KW - Congrès KW - Décidabilité (Logique mathématique) KW - Informatique KW - eclas KW - fast KW - Computer science KW - Software engineering KW - Computer software KW - Logic design KW - Logics and Meanings of Programs KW - Mathematical Logic and Formal Languages KW - Programming Languages, Compilers, Interpreters KW - Algorithm Analysis and Problem Complexity KW - Computation by Abstract Devices KW - computerwetenschappen KW - computer sciences KW - wiskunde KW - mathematics KW - logica KW - logic KW - programmeertalen KW - programming languages KW - algoritmen KW - algorithms KW - computeranalyse KW - computer analysis KW - computational science KW - Information and Communication Technology (General) KW - Informatie- en communicatietechnologie (algemeen) KW - Congress KW - proceedings (reports) KW - aat KW - Conference papers and proceedings KW - lcgft KW - Actes de congrès KW - rvmgf N1 - Includes bibliographical references and author index N2 - 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 UR - https://link.springer.com/10.1007/978-3-642-24288-5 ER -