Showing 1–16 of 16 results
/ Date/ Name
Sep 20, 2012Controllable-choice Message Sequence GraphsAug 22, 2013POMDPs under Probabilistic SemanticsSep 11, 2014Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics ApplicationsMay 5, 2014CEGAR for Qualitative Analysis of Probabilistic SystemsNov 26, 2015A Symbolic SAT-based Algorithm for Almost-sure Reachability with Small Strategies in POMDPsFeb 10, 2015Counterexample Explanation by Learning Small Strategies in Markov Decision ProcessesSep 29, 2017Sensor Synthesis for POMDPs with Reachability ObjectivesFeb 10, 2014Verification of Markov Decision Processes using Learning AlgorithmsOct 20, 2014Temporal Logic Control for Stochastic Linear Systems using Abstraction Refinement of Probabilistic GamesSep 11, 2013What is Decidable about Partially Observable Markov Decision Processes with ω-Regular ObjectivesNov 14, 2014Optimal Cost Almost-sure Reachability in POMDPsMar 14, 2024Learning Algorithms for Verification of Markov Decision ProcessesOct 9, 2012Interface Simulation DistancesFeb 19, 2012Equivalence of Games with Probabilistic Uncertainty and Partial-observation GamesAug 9, 2014POMDPs under Probabilistic SemanticsFeb 24, 2016Stochastic Shortest Path with Energy Constraints in POMDPs