Chatterjee, Krishnendu, et al. “Faster Algorithm for Turn-Based Stochastic Games with Bounded Treewidth.”10.1137/1.9781611977554.ch173__Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2023, pp. 4590–605, doi:10.1137/1.9781611977554.ch173.

Kretinsky, Jan, et al. “Guessing Winning Policies in LTL Synthesis by Semantic Learning.”10.1007/978-3-031-37706-8_20__35th International Conference on Computer Aided Verification , vol. 13964, Springer Nature, 2023, pp. 390–414, doi:10.1007/978-3-031-37706-8_20.

Akshay, S., et al. “MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives.”10.1007/978-3-031-37709-9_5__International Conference on Computer Aided Verification, vol. 13966, Springer Nature, 2023, pp. 86–112, doi:10.1007/978-3-031-37709-9_5.

Baier, Christel, et al. “Entropic Risk for Turn-Based Stochastic Games.”10.4230/LIPIcs.MFCS.2023.15__48th International Symposium on Mathematical Foundations of Computer Science, vol. 272, 15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.MFCS.2023.15.

Avni, Guy, et al. “Reachability Poorman Discrete-Bidding Games.”10.3233/FAIA230264__Frontiers in Artificial Intelligence and Applications, vol. 372, IOS Press, 2023, pp. 141–48, doi:10.3233/FAIA230264.

Kretinsky, Jan, et al. “Stopping Criteria for Value Iteration on Stochastic Games with Quantitative Objectives.”10.1109/LICS56636.2023.10175771__38th Annual ACM/IEEE Symposium on Logic in Computer Science, vol. 2023, Institute of Electrical and Electronics Engineers, 2023, doi:10.1109/LICS56636.2023.10175771.

Meggendorfer, Tobias. “Correct Approximation of Stationary Distributions.”10.1007/978-3-031-30823-9_25__TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, vol. 13993, Springer Nature, 2023, pp. 489–507, doi:10.1007/978-3-031-30823-9_25.

Meggendorfer, Tobias. Artefact for: Correct Approximation of Stationary Distributions. Zenodo, 2023, doi:10.5281/ZENODO.7548214.

Ahmadi, Ali, et al. “Algorithms and Hardness Results for Computing Cores of Markov Chains.”10.4230/LIPIcs.FSTTCS.2022.29__42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 250, 29, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.FSTTCS.2022.29.

Meggendorfer, Tobias. “Risk-Aware Stochastic Shortest Path.”10.1609/aaai.v36i9.21222__Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, vol. 36, no. 9, Association for the Advancement of Artificial Intelligence, 2022, pp. 9858–67, doi:10.1609/aaai.v36i9.21222.

Kretinsky, Jan, et al. “Index Appearance Record with Preorders.”10.1007/s00236-021-00412-y__Acta Informatica, vol. 59, Springer Nature, 2022, pp. 585–618, doi:10.1007/s00236-021-00412-y.

Meggendorfer, Tobias. “PET – A Partial Exploration Tool for Probabilistic Verification.”10.1007/978-3-031-19992-9_20__20th International Symposium on Automated Technology for Verification and Analysis, vol. 13505, Springer Nature, 2022, pp. 320–26, doi:10.1007/978-3-031-19992-9_20.

Grover, Kush, et al. “Anytime Guarantees for Reachability in Uncountable Markov Decision Processes.”10.4230/LIPIcs.CONCUR.2022.11__33rd International Conference on Concurrency Theory , vol. 243, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.CONCUR.2022.11.

Chatterjee, Krishnendu, et al. “Sound and Complete Certificates for Auantitative Termination Analysis of Probabilistic Programs.”10.1007/978-3-031-13185-1_4__Proceedings of the 34th International Conference on Computer Aided Verification, vol. 13371, Springer, 2022, pp. 55–78, doi:10.1007/978-3-031-13185-1_4.

Kretinsky, Jan, et al. “Index Appearance Record for Transforming Rabin Automata into Parity Automata.”10.1007/978-3-662-54577-5_26__Tools and Algorithms for the Construction and Analysis of Systems, vol. 10205, Springer, 2017, pp. 443–60, doi:10.1007/978-3-662-54577-5_26.