Overview

This volume contains the papers presented at the 4th International Workshop on Reachability Problems, RP 2010 held during August 28-29, 2010 in the F- ulty of Informatics, Masaryk University, Brno, Czech Republic and co-located with Joint MFCS and CSL 2010 (35th InternationalSymposiums on Mathem- ical Foundations of Computer Science and 19th EACSL Annual Conferences on Computer Science Logic). RP 2010 was the fourth in the series of workshops following three successful meetings at Ecole Polytechnique, France in 2009 at University of Liverpool, UK in 2008 and at Turku University, Finland in 2007. TheReachabilityProblemsworkshopsseriesaimsatgatheringtogethersch- ars from diverse disciplines and backgrounds interested in reachability problems that appearin algebraicstructures,computationalmodels, hybridsystems, logic and veri?cation, etc. Reachability is a fundamental problem in the context of many models and abstractions which describe various computational processes. Analysisofthecomputationaltracesandpredictabilityquestionsforsuchmodels can be formalized as a set of di?erent reachability problems. In general, reac- bility can be formulated as follows: Given a computational system with a set of allowed transformations (functions), decide whether a certain state of a system is reachable from a given initial state by a set of allowed transformations. The same questions can be asked not only about reachability of exact states of the system but also about a set of states expressed in terms of some property as a parameterized reachability problem. Another set of predictability questions can be seen in terms of reachability of eligible traces of computations,unavoidability ofsomedynamicsandapossibilitytoavoidundesirabledynamicsusingalimited control.

Full Product Details

Author:   Antonin Kucera ,  Igor Potapov
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Volume:   6227
Dimensions:   Width: 15.50cm , Height: 1.30cm , Length: 23.40cm
Weight:   0.329kg
ISBN:  

9783642153488

ISBN 10:   3642153488
Pages:   199
Publication Date:   18 August 2010
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print  
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata.- Symbolic and Compositional Reachability for Timed Automata.- Temporal Logics over Linear Time Domains Are in PSPACE.- Lossy Counter Machines Decidability Cheat Sheet.- Behavioral Cartography of Timed Automata.- On the Joint Spectral Radius for Bounded Matrix Languages.- Z-Reachability Problem for Games on 2-Dimensional Vector Addition Systems with States Is in P.- Towards the Frontier between Decidability and Undecidability for Hyperbolic Cellular Automata.- Rewriting Systems for Reachability in Vector Addition Systems with Pairs.- The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions.- Depth Boundedness in Multiset Rewriting Systems with Name Binding.- Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA.- Efficient Graph Reachability Query Answering Using Tree Decomposition.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions