Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
Theoretical Computer Science
Algorithmic analysis of programs with well quasi-ordered domains
Information and Computation - Special issue: LICS 1996—Part 1
On Infinite Terms Having a Decidable Monadic Theory
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Model Checking via Reachability Testing for Timed Automata
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Automatic Presentations of Structures
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
Using Forward Reachability Analysis for Verification of Lossy Channel Systems
Formal Methods in System Design
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Reachability Problems: An Update
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Reachability analysis of multithreaded software with asynchronous communication
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
On computing reachability sets of process rewrite systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
| Hi-index | 0.00 |
A graph $\mathcal{H}$ is computableif there is a graph $\mathcal{G}=(V,E)$ isomorphic to $\mathcal{H}$ where the set Vof vertices and the edge relation Eare both computable. In this case $\mathcal{G}$ is called a computable copyof $\mathcal{H}$. The reachability problemfor $\mathcal{H}$ in $\mathcal{G}$ is, given u,w茂戮驴 V, to decide whether there is a path from uto w. If the reachability problem for $\mathcal{H}$ is decidable in allcomputable copies of $\mathcal{H}$ then the problem is intrinsically decidable. This paper provides syntactic-logical characterizations of certain classes of graphs with intrinsically decidable reachability relations.