ENGLISH

Reachability Problems: 5th International Workshop, RP 2011, Genoa, Italy, September 28-30, 2011. Proceedings

By Igor Potapov (eds.) , Krishnendu Chatterjee (auth.) , Giorgio Delzanno

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2011
ISBN
9783642242878, 3642242871
DOI
10.1007/978-3-642-24288-5
Language
english
Format
PDF
Filesize
5 MB (5514556 bytes)
Series
Lecture Notes in Computer Science 6945 Theoretical Computer Science and General Issues
Edition
1
Pages
245\255
Time added
2013-04-24 17:00:00
CompilersInterpreters; Algorithm Analysis and Problem ComplLogics and Meanings of Programs; Software Engineer

Description

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.

Similar books