When Is Reachability Intrinsically Decidable?

DOI10.1007/978-3-540-85780-8_17MaRDI QIDQ3533013zbMATH OpenOpenAlexFDO

Authors Bakhadyr Khoussainov, Barbara 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)

Recommendations

• Decidability of inferring inductive invariants
• Some decidable results on reachability of solvable systems
• On the decidability of reachability in linear time-invariant systems
• When is an extension of a specification consistent? Decidable and undecidable cases
• Decidability of definability
• Reachability is decidable in the numbers game
• The Decidability of the Reachability Problem for CCS!
• How unprovable is Rabin's decidability theorem?
• About the decision of reachability for register machines
• When is containment decidable for probabilistic automata?

Cites work

• scientific article; zbMATH DE number 3732033 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 1929935 (Why is no real title available?)
• A logical reconstruction of reachability
• A theory of timed automata
• Algorithmic analysis of programs with well quasi-ordered domains.
• Depth-First Search and Linear Graph Algorithms
• Elements of finite model theory.
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Handbook of recursive mathematics. Vol. 1: Recursive model theory
• On reachability and safety in infinite-state systems
• Reachability Problems: An Update
• Reachability analysis of pushdown automata: Application to model-checking
• Term Rewriting and Applications
• Transforming structures by set interpretations
• Using forward reachability analysis for verification of lossy channel systems

Cited in

(4)

• Constructing decidable graphs from decidable structures
• When is scalar multiplication decidable?
• scientific article; zbMATH DE number 2090011 (Why is no real title available?)
• Computing planarity in computable planar graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3533013)