When Is Reachability Intrinsically Decidable?

DOI10.1007/978-3-540-85780-8_17zbMath1161.68037OpenAlexW1482178340MaRDI QIDQ3533013

Bakhadyr Khoussainov, Barbara F. Csima

Publication date: 30 October 2008

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85780-8_17

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Elements of finite model theory.
• Handbook of recursive mathematics. Vol. 1: Recursive model theory
• A theory of timed automata
• Algorithmic analysis of programs with well quasi-ordered domains.
• Using forward reachability analysis for verification of lossy channel systems
• ON REACHABILITY AND SAFETY IN INFINITE-STATE SYSTEMS
• Transforming structures by set interpretations
• Reachability Problems: An Update
• Depth-First Search and Linear Graph Algorithms
• Term Rewriting and Applications
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Perspectives of System Informatics
• Reachability analysis of pushdown automata: Application to model-checking

This page was built for publication: When Is Reachability Intrinsically Decidable?