Reachability Problems [electronic resource] : 5th International Workshop, RP 2011, Genoa, Italy, September 28-30, 2011. Proceedings / edited by Giorgio Delzanno, Igor Potapov.
Tipo de material:
TextoSeries Lecture Notes in Computer Science, 6945Editor: Berlin, Heidelberg : Springer Berlin Heidelberg, 2011Descripción: XII, 245 p. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9783642242885Trabajos contenidos: SpringerLink (Online service)Tema(s): Computer science | Software engineering | Computer software | Logic design | Computer Science | Logics and Meanings of Programs | Software Engineering | Mathematical Logic and Formal Languages | Programming Languages, Compilers, Interpreters | Algorithm Analysis and Problem Complexity | Computation by Abstract DevicesFormatos físicos adicionales: Sin títuloClasificación CDD: 005.1015113 Clasificación LoC:QA76.9.L63QA76.5913QA76.63Recursos en línea: de clik aquí para ver el libro electrónico Springer eBooksResumen: 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.
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.
ZDB-2-SCS
ZDB-2-LNC
No hay comentarios en este titulo.