About the decision of reachability for register machines
From MaRDI portal
Publication:4405553
Recommendations
- Reachability problems in nondeterministic polynomial maps on the integers
- Reachability problems in low-dimensional nondeterministic polynomial maps over integers
- On undecidability bounds for matrix decision problems
- Reachability in register machines with polynomial updates
- Lowering Undecidability Bounds for Decision Questions in Matrices
Cites work
- A well-structured framework for analysing Petri net extensions
- scientific article; zbMATH DE number 3685647 (Why is no real title available?)
- scientific article; zbMATH DE number 3539209 (Why is no real title available?)
- scientific article; zbMATH DE number 1223710 (Why is no real title available?)
- scientific article; zbMATH DE number 2085315 (Why is no real title available?)
Cited in
(9)- Reachability problems in low-dimensional nondeterministic polynomial maps over integers
- Reachability in register machines with polynomial updates
- Model-checking \(\mathrm{CTL}^*\) over flat Presburger counter systems
- Forward analysis and model checking for trace bounded WSTS
- Forward analysis and model checking for trace bounded WSTS
- When Is Reachability Intrinsically Decidable?
- Linear-time temporal logics with Presburger constraints: an overview
- Mortality of iterated piecewise affine functions over the integers: decidability and complexity
- Porous invariants for linear systems
This page was built for publication: About the decision of reachability for register machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4405553)
