Reachability problems : 5th International Workshop, RP 2011, Genoa, Italy, September 28-30, 2011. Proceedings / Giorgio Delzanno, Igor Potapov (eds.).
By: (5th : RP (Workshop) (5th : 2011 : Genoa, Italy)
Contributor(s): Delzanno, Giorgio | Potapov, Igor
Material type: 
TextSeries: SerienbezeichnungLecture notes in computer science: 6945.; LNCS sublibrary: Publisher: Berlin ; New York : Springer, ©2011Description: 1 online resource (xii, 244 pages)Content type: text Media type: computer Carrier type: online resourceISBN: 9783642242885; 364224288X; 9783642242878; 3642242871Subject(s): Computer systems -- Verification -- Congresses | Decidability (Mathematical logic) -- Congresses | Graph theory -- Data processing -- Congresses | Informatique | Computer systems -- Verification | Decidability (Mathematical logic) | Graph theory -- Data processing | Computer science | Software engineering | Computer software | Logic design | Logics and Meanings of Programs | Mathematical Logic and Formal Languages | Programming Languages, Compilers, Interpreters | Algorithm Analysis and Problem Complexity | Computation by Abstract Devices | computerwetenschappen | computer sciences | wiskunde | mathematics | logica | logic | programmeertalen | programming languages | algoritmen | algorithms | computeranalyse | computer analysis | computational science | Information and Communication Technology (General) | Informatie- en communicatietechnologie (algemeen)Genre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Printed edition:: No titleDDC classification: 003 LOC classification: QA76.76.V47 | R6 2011Other classification: 53.89 Online resources: Click here to access online Summary: 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.
| Item type | Current location | Collection | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
eBook
|
e-Library
Electronic Book@IST |
EBook | Available |
Includes bibliographical references and author index.
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.
There are no comments for this item.