11 search results - page 2 / 3 » On the Decidability of the Reachability Problem for Planar D... |
COCO
2010
Springer
13 years 9 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
ICTAC
2009
Springer
13 years 3 months ago
2009
Springer
The GSPeeDI tool implements a decision procedure for the reachability analysis of GSPDIs, planar hybrid systems whose dynamics is given by differential inclusions, and that are not...
COCO
2007
Springer
13 years 11 months ago
2007
Springer
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
HYBRID
2000
Springer
13 years 9 months ago
2000
Springer
A problem of great interest in the control of hybrid systems is the design of least restrictive controllers for reachability specifications. Controller design typically uses game t...
ECCC
2010
13 years 2 months ago
2010
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...