Reachability Problems

Reachability Problems

4.11 - 1251 ratings - Source

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.5th International Workshop, RP 2011, Genoa, Italy, September 28-30, 2011, Proceedings Giorgio Delzanno, Igor Potapov ... reachability analysis in term rewriting tries to answer to the following question: does there exists at least one term of Bad that can be reached from E using the rewriting ... Solving a such formula leads automatically to a conclusive approximation without extra technical parameters. 1anbsp;...

Title:Reachability Problems
Author:Giorgio Delzanno, Igor Potapov
Publisher:Springer Science & Business Media - 2011-09-19


You Must CONTINUE and create a free account to access unlimited downloads & streaming