On reachability and safety in infinite-state systems
From MaRDI portal
Publication:5249293
DOI10.1142/S0129054101000898zbMATH Open1319.68084OpenAlexW2067723582MaRDI QIDQ5249293FDOQ5249293
Jianwen Su, Tevfik Bultan, Oscar H. Ibarra
Publication date: 30 April 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054101000898
Recommendations
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- A theory of timed automata
- Symbolic model checking: \(10^{20}\) states and beyond
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- A really temporal logic
- Model-checking in dense real-time
- A variant of a recursively unsolvable problem
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Symbolic model checking for real-time systems
- Decidability of model checking for infinite-state concurrent systems
- The complexity of decision problems for finite-turn multicounter machines
- A technique for proving decidability of containment and equivalence of linear constraint queries
Cited In (9)
- Liveness checking as safety checking for infinite state spaces
- When Is Reachability Intrinsically Decidable?
- INDUCTIVE COMPOSITION OF NUMBERS WITH MAXIMUM, MINIMUM, AND ADDITION: A New Theory for Program Execution-Time Analysis
- Fixed point characterization of infinite behavior of finite-state systems
- Semilinearity of Families of Languages
- On store languages and applications
- Title not available (Why is that?)
- Reachability and safety objectives in Markov decision processes on long but finite horizons
- Title not available (Why is that?)
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)
