Tobias Meggendorfer

23 Publications

Mark all

[23]
2025 | Published | Conference Paper | IST-REx-ID: 19742 | OA
Budde, C. E., Hartmanns, A., Meggendorfer, T., Weininger, M., & Wienhöft, P. (2025). Sound statistical model checking for probabilities and expected rewards. In 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 15696, pp. 167–190). Hamilton, ON, Canada: Springer Nature. https://doi.org/10.1007/978-3-031-90643-5_9
[Published Version] View | Files available | DOI | arXiv
 
[22]
2025 | Research Data Reference | IST-REx-ID: 19769 | OA
Budde, C., Hartmanns, A., Meggendorfer, T., Weininger, M., & Wienhöft, P. (2025). Sound statistical model checking for probabilities and expected rewards (experimental reproduction package). Zenodo. https://doi.org/10.5281/ZENODO.14602066
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[21]
2025 | Published | Conference Paper | IST-REx-ID: 19666 | OA
Meggendorfer, T., Weininger, M., & Wienhöft, P. (2025). Solving robust Markov decision processes: Generic, reliable, efficient. In Proceedings of the AAAI Conference on Artificial Intelligence (Vol. 39, pp. 26631–26641). Philadelphia, PA, United States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v39i25.34865
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[20]
2024 | Published | Conference Paper | IST-REx-ID: 18159 | OA
Akshay, S., Chatterjee, K., Meggendorfer, T., & Zikelic, D. (2024). Certified policy verification and synthesis for MDPs under distributional reach-avoidance properties. In Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence (pp. 3–12). Jeju, Korea: International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2024/1
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[19]
2024 | Published | Journal Article | IST-REx-ID: 17162 | OA
Chatterjee, K., Goharshady, A. K., Meggendorfer, T., & Zikelic, D. (2024). Quantitative bounds on resource usage of probabilistic programs. Proceedings of the ACM on Programming Languages. Association for Computing Machinery. https://doi.org/10.1145/3649824
[Published Version] View | Files available | DOI
 
[18]
2024 | Published | Conference Paper | IST-REx-ID: 17402 | OA
Meggendorfer, T., & Weininger, M. (2024). Playing games with your PET: Extending the Partial Exploration Tool to stochastic games. In 36th International Conference on Computer Aided Verification (Vol. 14683, pp. 359–372). Montreal, Canada: Springer Nature. https://doi.org/10.1007/978-3-031-65633-0_16
[Published Version] View | Files available | DOI | arXiv
 
[17]
2024 | Published | Journal Article | IST-REx-ID: 17474 | OA
Baier, C., Chatterjee, K., Meggendorfer, T., & Piribauer, J. (2024). Entropic risk for turn-based stochastic games. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2024.105214
[Published Version] View | Files available | DOI | arXiv
 
[16]
2024 | Published | Conference Paper | IST-REx-ID: 18600 | OA
Andriushchenko R, Bork A, Budde CE, Češka M, Grover K, Hahn EM, Hartmanns A, Israelsen B, Jansen N, Jeppson J, Junges S, Köhl MA, Könighofer B, Kretinsky J, Meggendorfer T, Parker D, Pranger S, Quatmann T, Ruijters E, Taylor L, Volk M, Weininger M, Zhang Z. 2024. Tools at the Frontiers of Quantitative Verification: QComp 2023 Competition Report. TOOLympics Challenge 2023. , LNCS, vol. 14550, 90–146.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[15]
2023 | Published | Conference Paper | IST-REx-ID: 13139 | OA
Meggendorfer, T. (2023). Correct approximation of stationary distributions. In TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems (Vol. 13993, pp. 489–507). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-30823-9_25
[Published Version] View | Files available | DOI | arXiv
 
[14]
2023 | Published | Conference Paper | IST-REx-ID: 14259 | OA
Kretinsky, J., Meggendorfer, T., Prokop, M., & Rieder, S. (2023). Guessing winning policies in LTL synthesis by semantic learning. In 35th International Conference on Computer Aided Verification (Vol. 13964, pp. 390–414). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-37706-8_20
[Published Version] View | Files available | DOI
 
[13]
2023 | Research Data Reference | IST-REx-ID: 14990 | OA
Meggendorfer, T. (2023). Artefact for: Correct Approximation of Stationary Distributions. Zenodo. https://doi.org/10.5281/ZENODO.7548214
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[12]
2023 | Published | Conference Paper | IST-REx-ID: 12676 | OA
Chatterjee, K., Meggendorfer, T., Saona Urmeneta, R. J., & Svoboda, J. (2023). Faster algorithm for turn-based stochastic games with bounded treewidth. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 4590–4605). Florence, Italy: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977554.ch173
[Published Version] View | DOI | Download Published Version (ext.)
 
[11]
2023 | Published | Conference Paper | IST-REx-ID: 14518 | OA
Avni, G., Meggendorfer, T., Sadhukhan, S., Tkadlec, J., & Zikelic, D. (2023). Reachability poorman discrete-bidding games. In Frontiers in Artificial Intelligence and Applications (Vol. 372, pp. 141–148). Krakow, Poland: IOS Press. https://doi.org/10.3233/FAIA230264
[Published Version] View | Files available | DOI | arXiv
 
[10]
2023 | Published | Conference Paper | IST-REx-ID: 14317 | OA
Akshay, S., Chatterjee, K., Meggendorfer, T., & Zikelic, D. (2023). MDPs as distribution transformers: Affine invariant synthesis for safety objectives. In International Conference on Computer Aided Verification (Vol. 13966, pp. 86–112). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-37709-9_5
[Published Version] View | Files available | DOI
 
[9]
2023 | Published | Conference Paper | IST-REx-ID: 13967 | OA
Kretinsky, J., Meggendorfer, T., & Weininger, M. (2023). Stopping criteria for value iteration on stochastic games with quantitative objectives. In 38th Annual ACM/IEEE Symposium on Logic in Computer Science (Vol. 2023). Boston, MA, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/LICS56636.2023.10175771
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[8]
2023 | Published | Conference Paper | IST-REx-ID: 14417 | OA
Baier, C., Chatterjee, K., Meggendorfer, T., & Piribauer, J. (2023). Entropic risk for turn-based stochastic games. In 48th International Symposium on Mathematical Foundations of Computer Science (Vol. 272). Bordeaux, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2023.15
[Published Version] View | Files available | DOI | arXiv
 
[7]
2022 | Published | Conference Paper | IST-REx-ID: 12170
Meggendorfer, T. (2022). PET – A partial exploration tool for probabilistic verification. In 20th International Symposium on Automated Technology for Verification and Analysis (Vol. 13505, pp. 320–326). Virtual: Springer Nature. https://doi.org/10.1007/978-3-031-19992-9_20
View | DOI
 
[6]
2022 | Published | Conference Paper | IST-REx-ID: 12568 | OA
Meggendorfer, T. (2022). Risk-aware stochastic shortest path. In Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022 (Vol. 36, pp. 9858–9867). Virtual: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v36i9.21222
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[5]
2022 | Published | Conference Paper | IST-REx-ID: 12775 | OA
Grover, K., Kretinsky, J., Meggendorfer, T., & Weininger, M. (2022). Anytime guarantees for reachability in uncountable Markov decision processes. In 33rd International Conference on Concurrency Theory (Vol. 243). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2022.11
[Published Version] View | Files available | DOI | arXiv
 
[4]
2022 | Published | Journal Article | IST-REx-ID: 10602 | OA
Kretinsky, J., Meggendorfer, T., Waldmann, C., & Weininger, M. (2022). Index appearance record with preorders. Acta Informatica. Springer Nature. https://doi.org/10.1007/s00236-021-00412-y
[Published Version] View | Files available | DOI | WoS
 
[3]
2022 | Published | Conference Paper | IST-REx-ID: 12102 | OA
Ahmadi, A., Chatterjee, K., Goharshady, A. K., Meggendorfer, T., Safavi Hemami, R., & Zikelic, D. (2022). Algorithms and hardness results for computing cores of Markov chains. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 250). Madras, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29
[Published Version] View | Files available | DOI
 
[2]
2022 | Published | Conference Paper | IST-REx-ID: 12000 | OA
Chatterjee, K., Goharshady, A. K., Meggendorfer, T., & Zikelic, D. (2022). Sound and complete certificates for auantitative termination analysis of probabilistic programs. In Proceedings of the 34th International Conference on Computer Aided Verification (Vol. 13371, pp. 55–78). Haifa, Israel: Springer. https://doi.org/10.1007/978-3-031-13185-1_4
[Published Version] View | Files available | DOI | WoS
 
[1]
2017 | Published | Conference Paper | IST-REx-ID: 13160 | OA
Kretinsky, J., Meggendorfer, T., Waldmann, C., & Weininger, M. (2017). Index appearance record for transforming Rabin automata into parity automata. In Tools and Algorithms for the Construction and Analysis of Systems (Vol. 10205, pp. 443–460). Uppsala, Sweden: Springer. https://doi.org/10.1007/978-3-662-54577-5_26
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed

Grants


23 Publications

Mark all

[23]
2025 | Published | Conference Paper | IST-REx-ID: 19742 | OA
Budde, C. E., Hartmanns, A., Meggendorfer, T., Weininger, M., & Wienhöft, P. (2025). Sound statistical model checking for probabilities and expected rewards. In 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 15696, pp. 167–190). Hamilton, ON, Canada: Springer Nature. https://doi.org/10.1007/978-3-031-90643-5_9
[Published Version] View | Files available | DOI | arXiv
 
[22]
2025 | Research Data Reference | IST-REx-ID: 19769 | OA
Budde, C., Hartmanns, A., Meggendorfer, T., Weininger, M., & Wienhöft, P. (2025). Sound statistical model checking for probabilities and expected rewards (experimental reproduction package). Zenodo. https://doi.org/10.5281/ZENODO.14602066
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[21]
2025 | Published | Conference Paper | IST-REx-ID: 19666 | OA
Meggendorfer, T., Weininger, M., & Wienhöft, P. (2025). Solving robust Markov decision processes: Generic, reliable, efficient. In Proceedings of the AAAI Conference on Artificial Intelligence (Vol. 39, pp. 26631–26641). Philadelphia, PA, United States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v39i25.34865
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[20]
2024 | Published | Conference Paper | IST-REx-ID: 18159 | OA
Akshay, S., Chatterjee, K., Meggendorfer, T., & Zikelic, D. (2024). Certified policy verification and synthesis for MDPs under distributional reach-avoidance properties. In Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence (pp. 3–12). Jeju, Korea: International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2024/1
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[19]
2024 | Published | Journal Article | IST-REx-ID: 17162 | OA
Chatterjee, K., Goharshady, A. K., Meggendorfer, T., & Zikelic, D. (2024). Quantitative bounds on resource usage of probabilistic programs. Proceedings of the ACM on Programming Languages. Association for Computing Machinery. https://doi.org/10.1145/3649824
[Published Version] View | Files available | DOI
 
[18]
2024 | Published | Conference Paper | IST-REx-ID: 17402 | OA
Meggendorfer, T., & Weininger, M. (2024). Playing games with your PET: Extending the Partial Exploration Tool to stochastic games. In 36th International Conference on Computer Aided Verification (Vol. 14683, pp. 359–372). Montreal, Canada: Springer Nature. https://doi.org/10.1007/978-3-031-65633-0_16
[Published Version] View | Files available | DOI | arXiv
 
[17]
2024 | Published | Journal Article | IST-REx-ID: 17474 | OA
Baier, C., Chatterjee, K., Meggendorfer, T., & Piribauer, J. (2024). Entropic risk for turn-based stochastic games. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2024.105214
[Published Version] View | Files available | DOI | arXiv
 
[16]
2024 | Published | Conference Paper | IST-REx-ID: 18600 | OA
Andriushchenko R, Bork A, Budde CE, Češka M, Grover K, Hahn EM, Hartmanns A, Israelsen B, Jansen N, Jeppson J, Junges S, Köhl MA, Könighofer B, Kretinsky J, Meggendorfer T, Parker D, Pranger S, Quatmann T, Ruijters E, Taylor L, Volk M, Weininger M, Zhang Z. 2024. Tools at the Frontiers of Quantitative Verification: QComp 2023 Competition Report. TOOLympics Challenge 2023. , LNCS, vol. 14550, 90–146.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[15]
2023 | Published | Conference Paper | IST-REx-ID: 13139 | OA
Meggendorfer, T. (2023). Correct approximation of stationary distributions. In TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems (Vol. 13993, pp. 489–507). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-30823-9_25
[Published Version] View | Files available | DOI | arXiv
 
[14]
2023 | Published | Conference Paper | IST-REx-ID: 14259 | OA
Kretinsky, J., Meggendorfer, T., Prokop, M., & Rieder, S. (2023). Guessing winning policies in LTL synthesis by semantic learning. In 35th International Conference on Computer Aided Verification (Vol. 13964, pp. 390–414). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-37706-8_20
[Published Version] View | Files available | DOI
 
[13]
2023 | Research Data Reference | IST-REx-ID: 14990 | OA
Meggendorfer, T. (2023). Artefact for: Correct Approximation of Stationary Distributions. Zenodo. https://doi.org/10.5281/ZENODO.7548214
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[12]
2023 | Published | Conference Paper | IST-REx-ID: 12676 | OA
Chatterjee, K., Meggendorfer, T., Saona Urmeneta, R. J., & Svoboda, J. (2023). Faster algorithm for turn-based stochastic games with bounded treewidth. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 4590–4605). Florence, Italy: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977554.ch173
[Published Version] View | DOI | Download Published Version (ext.)
 
[11]
2023 | Published | Conference Paper | IST-REx-ID: 14518 | OA
Avni, G., Meggendorfer, T., Sadhukhan, S., Tkadlec, J., & Zikelic, D. (2023). Reachability poorman discrete-bidding games. In Frontiers in Artificial Intelligence and Applications (Vol. 372, pp. 141–148). Krakow, Poland: IOS Press. https://doi.org/10.3233/FAIA230264
[Published Version] View | Files available | DOI | arXiv
 
[10]
2023 | Published | Conference Paper | IST-REx-ID: 14317 | OA
Akshay, S., Chatterjee, K., Meggendorfer, T., & Zikelic, D. (2023). MDPs as distribution transformers: Affine invariant synthesis for safety objectives. In International Conference on Computer Aided Verification (Vol. 13966, pp. 86–112). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-37709-9_5
[Published Version] View | Files available | DOI
 
[9]
2023 | Published | Conference Paper | IST-REx-ID: 13967 | OA
Kretinsky, J., Meggendorfer, T., & Weininger, M. (2023). Stopping criteria for value iteration on stochastic games with quantitative objectives. In 38th Annual ACM/IEEE Symposium on Logic in Computer Science (Vol. 2023). Boston, MA, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/LICS56636.2023.10175771
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[8]
2023 | Published | Conference Paper | IST-REx-ID: 14417 | OA
Baier, C., Chatterjee, K., Meggendorfer, T., & Piribauer, J. (2023). Entropic risk for turn-based stochastic games. In 48th International Symposium on Mathematical Foundations of Computer Science (Vol. 272). Bordeaux, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2023.15
[Published Version] View | Files available | DOI | arXiv
 
[7]
2022 | Published | Conference Paper | IST-REx-ID: 12170
Meggendorfer, T. (2022). PET – A partial exploration tool for probabilistic verification. In 20th International Symposium on Automated Technology for Verification and Analysis (Vol. 13505, pp. 320–326). Virtual: Springer Nature. https://doi.org/10.1007/978-3-031-19992-9_20
View | DOI
 
[6]
2022 | Published | Conference Paper | IST-REx-ID: 12568 | OA
Meggendorfer, T. (2022). Risk-aware stochastic shortest path. In Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022 (Vol. 36, pp. 9858–9867). Virtual: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v36i9.21222
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[5]
2022 | Published | Conference Paper | IST-REx-ID: 12775 | OA
Grover, K., Kretinsky, J., Meggendorfer, T., & Weininger, M. (2022). Anytime guarantees for reachability in uncountable Markov decision processes. In 33rd International Conference on Concurrency Theory (Vol. 243). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2022.11
[Published Version] View | Files available | DOI | arXiv
 
[4]
2022 | Published | Journal Article | IST-REx-ID: 10602 | OA
Kretinsky, J., Meggendorfer, T., Waldmann, C., & Weininger, M. (2022). Index appearance record with preorders. Acta Informatica. Springer Nature. https://doi.org/10.1007/s00236-021-00412-y
[Published Version] View | Files available | DOI | WoS
 
[3]
2022 | Published | Conference Paper | IST-REx-ID: 12102 | OA
Ahmadi, A., Chatterjee, K., Goharshady, A. K., Meggendorfer, T., Safavi Hemami, R., & Zikelic, D. (2022). Algorithms and hardness results for computing cores of Markov chains. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 250). Madras, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29
[Published Version] View | Files available | DOI
 
[2]
2022 | Published | Conference Paper | IST-REx-ID: 12000 | OA
Chatterjee, K., Goharshady, A. K., Meggendorfer, T., & Zikelic, D. (2022). Sound and complete certificates for auantitative termination analysis of probabilistic programs. In Proceedings of the 34th International Conference on Computer Aided Verification (Vol. 13371, pp. 55–78). Haifa, Israel: Springer. https://doi.org/10.1007/978-3-031-13185-1_4
[Published Version] View | Files available | DOI | WoS
 
[1]
2017 | Published | Conference Paper | IST-REx-ID: 13160 | OA
Kretinsky, J., Meggendorfer, T., Waldmann, C., & Weininger, M. (2017). Index appearance record for transforming Rabin automata into parity automata. In Tools and Algorithms for the Construction and Analysis of Systems (Vol. 10205, pp. 443–460). Uppsala, Sweden: Springer. https://doi.org/10.1007/978-3-662-54577-5_26
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed