January 01, 2015 preprint Open access A Symbolic SAT-based Algorithm for Almost-sure Reachability with Small Strategies in POMDPs arXiv (Cornell University) DOI: 10.15479/at:ist-2015-325-v2-1 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 3 stored of 23 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access The probabilistic model checker Storm 2021 International Journal on Software Tools for Technology Transfer article Computer Science Formal Methods in Verification Open access 246 citations The complexity of reachability in parametric Markov decision processes 2021 Journal of Computer and System Sciences article Computer Science Formal Methods in Verification Open access 23 citations The Complexity of Reachability in Parametric Markov Decision Processes 2020 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access 10 citations 3 results References 0