On reachability and safety in infinite-state systems
From MaRDI portal
Publication:5249293
Recommendations
Cites work
- A really temporal logic
- A technique for proving decidability of containment and equivalence of linear constraint queries
- A theory of timed automata
- A variant of a recursively unsolvable problem
- Decidability of model checking for infinite-state concurrent systems
- Model-checking in dense real-time
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Symbolic model checking for real-time systems
- Symbolic model checking: \(10^{20}\) states and beyond
- The complexity of decision problems for finite-turn multicounter machines
Cited in
(10)- When Is Reachability Intrinsically Decidable?
- scientific article; zbMATH DE number 1759611 (Why is no real title available?)
- Reachability and safety objectives in Markov decision processes on long but finite horizons
- Liveness checking as safety checking for infinite state spaces
- Revisiting MU puzzle: a case study in finite countermodels verification
- Fixed point characterization of infinite behavior of finite-state systems
- scientific article; zbMATH DE number 1773081 (Why is no real title available?)
- INDUCTIVE COMPOSITION OF NUMBERS WITH MAXIMUM, MINIMUM, AND ADDITION: A New Theory for Program Execution-Time Analysis
- Semilinearity of families of languages
- On store languages and applications
This page was built for publication: On reachability and safety in infinite-state systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249293)
