Reachability Problems [electronic resource] : 5th International Workshop, RP 2011, Genoa, Italy, September 28-30, 2011. Proceedings / edited by Giorgio Delzanno, Igor Potapov.
By: Delzanno, Giorgio [editor.].
Contributor(s): Potapov, Igor [editor.] | SpringerLink (Online service).
Material type:
BookSeries: Lecture Notes in Computer Science: 6945Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2011Description: XII, 245 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642242885.Subject(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 DevicesDDC classification: 005.1015113 Online resources: Click here to access online
In:
Springer eBooksSummary: 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.
There are no comments for this item.