Author of the publication

A Simple Algorithm for Solving Qualitative Probabilistic Parity Games.

, , , and . CAV (2), volume 9780 of Lecture Notes in Computer Science, page 291-311. Springer, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Good-for-MDPs Automata., , , , , and . CoRR, (2019)Mungojerrie: Reinforcement Learning of Linear-Time Objectives., , , , , and . CoRR, (2021)The Marriage Between Safety and Cybersecurity: Still Practicing., , , , and . SPIN, volume 12864 of Lecture Notes in Computer Science, page 3-21. Springer, (2021)Reinforcement Learning with Guarantees that Hold for Ever., , , , , and . FMICS, volume 13487 of Lecture Notes in Computer Science, page 3-7. Springer, (2022)Polynomial-Time Alternating Probabilistic Bisimulation for Interval MDPs., , , , and . SETTA, volume 10606 of Lecture Notes in Computer Science, page 25-41. Springer, (2017)Limit reachability for model-free reinforcement learning of ω-regular objectives., , , , , and . SNR, page 16-18. ACM, (2019)sfATM: A Logic for Quantitative Security Properties on Attack Trees., , , and . SEFM, volume 14323 of Lecture Notes in Computer Science, page 205-225. Springer, (2023)Interval Markov Decision Processes with Multiple Objectives: From Robust Strategies to Pareto Curves., , , , and . ACM Trans. Model. Comput. Simul., 29 (4): 27:1-27:31 (2019)Model Checking Omega-regular Properties for Quantum Markov Chains ., , , and . CONCUR, volume 85 of LIPIcs, page 35:1-35:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Symblicit exploration and elimination for probabilistic model checking., and . SAC, page 1798-1806. ACM, (2021)