No. Title Author Year
1 Anytime Guarantees for Reachability in Uncountable Markov Decision Processes Grover, Kush et al. 2022
2 Enforcing ω-Regular Properties in Markov Chains by Restarting Esparza, Javier et al. 2021
3 Of Cores: A Partial-Exploration Framework for Markov Decision Processes Kretínský, Jan et al. 2019
4 Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints Kretínský, Jan et al. 2018
5 Machine Learning and Model Checking Join Forces (Dagstuhl Seminar 18121) Jansen, Nils et al. 2018
6 The Satisfiability Problem for Unbounded Fragments of Probabilistic CTL Kretínský, Jan et al. 2018
7 Linear Distances between Markov Chains Daca, Przemyslaw et al. 2016
8 Polynomial Time Decidability of Weighted Synchronization under Partial Observability Kretinsky, Jan et al. 2015
9 Verification of Open Interactive Markov Chains Brazdil, Tomas et al. 2012
10 Process Algebra for Modal Transition Systemses Benes, Nikola et al. 2011
11 Continuous-Time Stochastic Games with Time-Bounded Reachability Brazdil, Tomas et al. 2009
Current Page :
Number of result pages: 1
Number of documents: 11

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI