Index Appearance Record for Transforming Rabin Automata into Parity Automata. - Jan Kretínský; Tobias Meggendorfer; Clara Waldmann; Maximilian Weininger (TACAS (1), 2017)

Value Iteration for Simple Stochastic Games: Stopping Criterion and Learning Algorithm. - Edon Kelmendi; Julia Krämer; Jan Kretínský; Maximilian Weininger (CAV (1), 2018)

PAC Statistical Model Checking for Markov Decision Processes and Stochastic Games. - Pranav Ashok; Jan Kretínský; Maximilian Weininger (CAV (1), 2019)

Satisfiability Bounds for ω-Regular Properties in Bounded-Parameter Markov Decision Processes. - Maximilian Weininger; Tobias Meggendorfer; Jan Kretínský (CDC, 2019)

SOS: Safe, Optimal and Small Strategies for Hybrid Markov Decision Processes. - Pranav Ashok; Jan Kretínský; Kim Guldstrand Larsen; Adrien Le Coënt; Jakob Haahr Taankvist; Maximilian Weininger (QEST, 2019)

Approximating Values of Generalized-Reachability Stochastic Games. - Pranav Ashok; Jan Kretínský; Maximilian Weininger (CoRR, 2019)

Stochastic Games with Lexicographic Reachability-Safety Objectives. - Krishnendu Chatterjee; Joost-Pieter Katoen; Maximilian Weininger; Tobias Winkler 001 (CAV (2), 2020)

Automata Tutor v3. - Loris D'Antoni; Martin Helfrich; Jan Kretínský; Emanuel Ramneantu; Maximilian Weininger (CAV (2), 2020)

dtControl: decision tree learning algorithms for controller representation. - Pranav Ashok; Mathias Jackermeier; Pushpak Jagtap; Jan Kretínský; Maximilian Weininger; Majid Zamani 001 (HSCC, 2020)

Statistical Model Checking: Black or White? - Pranav Ashok; Przemyslaw Daca; Jan Kretínský; Maximilian Weininger (ISoLA (1), 2020)

Approximating Values of Generalized-Reachability Stochastic Games. - Pranav Ashok; Krishnendu Chatterjee; Jan Kretínský; Maximilian Weininger; Tobias Winkler 001 (LICS, 2020)

An Anytime Algorithm for Reachability on Uncountable MDP. - Kush Grover; Jan Kretínský; Tobias Meggendorfer; Maximilian Weininger (CoRR, 2020)

Comparison of Algorithms for Simple Stochastic Games (Full Version). - Jan Kretínský; Emanuel Ramneantu; Alexander Slivinskiy; Maximilian Weininger (CoRR, 2020)

Comparison of Algorithms for Simple Stochastic Games. - Jan Kretínský; Emanuel Ramneantu; Alexander Slivinskiy; Maximilian Weininger (GandALF, 2020)

Online Monitoring ω-Regular Properties in Unknown Markov Chains. - Javier Esparza; Stefan Kiefer; Jan Kretínský; Maximilian Weininger (CoRR, 2020)

dtControl: decision tree learning algorithms for controller representation (HSCC 20 Repeatability Evaluation Package). - Pranav Ashok; Mathias Jackermeier; Pushpak Jagtap; Jan Kretínský; Maximilian Weininger; Majid Zamani 001 (Zenodo, 2020)

Guaranteed Trade-Offs in Dynamic Information Flow Tracking Games. - Maximilian Weininger; Kush Grover; Shruti Misra; Jan Kretínský (CDC, 2021)

Enforcing ω-Regular Properties in Markov Chains by Restarting. - Javier Esparza; Stefan Kiefer; Jan Kretínský; Maximilian Weininger (CONCUR, 2021)

dtControl 2.0: Explainable Strategy Representation via Decision Tree Learning Steered by Experts. - Pranav Ashok; Mathias Jackermeier; Jan Kretínský; Christoph Weinhuber; Maximilian Weininger; Mayank Yadav (TACAS (2), 2021)

Stochastic Games with Disjunctions of Multiple Objectives (Technical Report). - Tobias Winkler 001; Maximilian Weininger (CoRR, 2021)

Stochastic Games with Disjunctions of Multiple Objectives. - Tobias Winkler 001; Maximilian Weininger (GandALF, 2021)

dtControl 2.0: Explainable Strategy Representation via Decision Tree Learning Steered by Experts (TACAS 21 Artifact). - Pranav Ashok; Mathias Jackermeier; Jan Kretínský; Christoph Weinhuber; Maximilian Weininger; Mayank Yadav (Zenodo, 2021)

Optimistic and Topological Value Iteration for Simple Stochastic Games. - Muqsit Azeem; Alexandros Evangelidis; Jan Kretínský; Alexander Slivinskiy; Maximilian Weininger (ATVA, 2022)

Anytime Guarantees for Reachability in Uncountable Markov Decision Processes. - Kush Grover; Jan Kretínský; Tobias Meggendorfer; Maximilian Weininger (CONCUR, 2022)

Index appearance record with preorders. - Jan Kretínský; Tobias Meggendorfer; Clara Waldmann; Maximilian Weininger (Acta Informatica, 2022)

Value iteration for simple stochastic games: Stopping criterion and learning algorithm. - Julia Eisentraut; Edon Kelmendi; Jan Kretínský; Maximilian Weininger (Inf. Comput., 2022)

Solving Stochastic Games Reliably. - Maximilian Weininger (2022)

Stopping Criteria for Value Iteration on Stochastic Games with Quantitative Objectives. - Jan Kretínský; Tobias Meggendorfer; Maximilian Weininger (LICS, 2023)

A Practitioner's Guide to MDP Model Checking Algorithms. - Arnd Hartmanns; Sebastian Junges; Tim Quatmann; Maximilian Weininger (TACAS (1), 2023)

Tools at the Frontiers of Quantitative Verification - QComp 2023 Competition Report. - Roman Andriushchenko; Alexander Bork; Carlos E. Budde; Milan Ceska 002; Kush Grover; Ernst Moritz Hahn; Arnd Hartmanns; Bryant Israelsen; Nils Jansen 001; Joshua Jeppson; Sebastian Junges; Maximilian A. Köhl; et al. (TOOLympics@ETAPS, 2023)

Algebraically explainable controllers: decision trees and support vector machines join forces. - Florian Jüngermann; Jan Kretínský; Maximilian Weininger (Int. J. Softw. Tools Technol. Transf., 2023)

QComp LRA results. - Kush Grover; Maximilian Weininger; Jan Kretínský (Zenodo, 2023)

Playing Games with Your PET: Extending the Partial Exploration Tool to Stochastic Games. - Tobias Meggendorfer; Maximilian Weininger (CAV (3), 2024)

What Are the Odds? Improving the foundations of Statistical Model Checking. - Tobias Meggendorfer; Maximilian Weininger; Patrick Wienhöft (CoRR, 2024)

Tools at the Frontiers of Quantitative Verification. - Roman Andriushchenko; Alexander Bork; Carlos E. Budde; Milan Ceska 002; Kush Grover; Ernst Moritz Hahn; Arnd Hartmanns; Bryant Israelsen; Nils Jansen 001; Joshua Jeppson; Sebastian Junges; Maximilian A. Köhl; et al. (CoRR, 2024)

Sound Value Iteration for Simple Stochastic Games. - Muqsit Azeem; Jan Kretínský; Maximilian Weininger (CoRR, 2024)

Stochastic games with lexicographic objectives. - Krishnendu Chatterjee; Joost-Pieter Katoen; Stefanie Mohr; Maximilian Weininger; Tobias Winkler 001 (Formal Methods Syst. Des., 2024)

Solving Robust Markov Decision Processes: Generic, Reliable, Efficient. - Tobias Meggendorfer; Maximilian Weininger; Patrick Wienhöft (AAAI, 2025)

Sound Statistical Model Checking for Probabilities and Expected Rewards. - Carlos E. Budde; Arnd Hartmanns; Tobias Meggendorfer; Maximilian Weininger; Patrick Wienhöft (TACAS (1), 2025)

Fixed Point Certificates for Reachability and Expected Rewards in MDPs. - Krishnendu Chatterjee; Tim Quatmann; Maximilian Schäffeler; Maximilian Weininger; Tobias Winkler 001; Daniel Zilken (TACAS (2), 2025)

1-2-3-Go! Policy Synthesis for Parameterized Markov Decision Processes via Decision-Tree Learning and Generalization. - Muqsit Azeem; Debraj Chakraborty 002; Sudeep Kanav; Jan Kretínský; MohammadSadegh Mohagheghi; Stefanie Mohr; Maximilian Weininger (VMCAI (2), 2025)

Artifact: Fixed Point Certificates for Reachability and Expected Rewards in MDPs. - Krishnendu Chatterjee; Tim Quatmann; Maximilian Schäffeler; Maximilian Weininger; Tobias Winkler 001; Daniel Zillken (Zenodo, 2025)

Risk-aware Markov Decision Processes Using Cumulative Prospect Theory. - Thomas Brihaye; Krishnendu Chatterjee; Stefanie Mohr; Maximilian Weininger (CoRR, 2025)

Stopping Criteria for Value Iteration on Concurrent Stochastic Reachability and Safety Games. - Marta Grobelna; Jan Kretínský; Maximilian Weininger (CoRR, 2025)