Reachability Problems Reachability Problems

Reachability Problems

    • £35.99
    • £35.99

Publisher 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.

GENRE
Computing & Internet
RELEASED
2011
25 September
LANGUAGE
EN
English
LENGTH
257
Pages
PUBLISHER
Springer Berlin Heidelberg
SIZE
10
MB

More Books Like This

CONCUR 2011 -- Concurrency Theory CONCUR 2011 -- Concurrency Theory
2011
Automated Technology for Verification and Analysis Automated Technology for Verification and Analysis
2009
SOFSEM 2009: Theory and Practice of Computer Science SOFSEM 2009: Theory and Practice of Computer Science
2009
Foundations of Software Science and Computational Structures Foundations of Software Science and Computational Structures
2009
Automata, Languages and Programming Automata, Languages and Programming
2010
Computer Aided Verification Computer Aided Verification
2010