When Is Reachability Intrinsically Decidable?
From MaRDI portal
Publication:3533013
DOI10.1007/978-3-540-85780-8_17zbMATH Open1161.68037OpenAlexW1482178340MaRDI QIDQ3533013FDOQ3533013
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
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
- A theory of timed automata
- Depth-First Search and Linear Graph Algorithms
- Title not available (Why is that?)
- Transforming structures by set interpretations
- Elements of finite model theory.
- Algorithmic analysis of programs with well quasi-ordered domains.
- Using forward reachability analysis for verification of lossy channel systems
- Reachability analysis of pushdown automata: Application to model-checking
- A logical reconstruction of reachability
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Handbook of recursive mathematics. Vol. 1: Recursive model theory
- Term Rewriting and Applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reachability Problems: An Update
- On reachability and safety in infinite-state systems
Cited In (4)
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)
