Tobias Meggendorfer

Chatterjee Group

15 Publications

Mark all

[15]
2023 | Conference Paper | IST-REx-ID: 12676 | OA
Chatterjee K, Meggendorfer T, Saona Urmeneta RJ, Svoboda J. Faster algorithm for turn-based stochastic games with bounded treewidth. In: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2023:4590-4605. doi:10.1137/1.9781611977554.ch173
[Published Version] View | DOI | Download Published Version (ext.)
 
[14]
2023 | Conference Paper | IST-REx-ID: 14259 | OA
Kretinsky J, Meggendorfer T, Prokop M, Rieder S. Guessing winning policies in LTL synthesis by semantic learning. In: 35th International Conference on Computer Aided Verification . Vol 13964. Springer Nature; 2023:390-414. doi:10.1007/978-3-031-37706-8_20
[Published Version] View | Files available | DOI
 
[13]
2023 | Conference Paper | IST-REx-ID: 14317 | OA
Akshay S, Chatterjee K, Meggendorfer T, Zikelic D. MDPs as distribution transformers: Affine invariant synthesis for safety objectives. In: International Conference on Computer Aided Verification. Vol 13966. Springer Nature; 2023:86-112. doi:10.1007/978-3-031-37709-9_5
[Published Version] View | Files available | DOI
 
[12]
2023 | Conference Paper | IST-REx-ID: 14417 | OA
Baier C, Chatterjee K, Meggendorfer T, Piribauer J. Entropic risk for turn-based stochastic games. In: 48th International Symposium on Mathematical Foundations of Computer Science. Vol 272. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.MFCS.2023.15
[Published Version] View | Files available | DOI | arXiv
 
[11]
2023 | Conference Paper | IST-REx-ID: 14518 | OA
Avni G, Meggendorfer T, Sadhukhan S, Tkadlec J, Zikelic D. Reachability poorman discrete-bidding games. In: Frontiers in Artificial Intelligence and Applications. Vol 372. IOS Press; 2023:141-148. doi:10.3233/FAIA230264
[Published Version] View | Files available | DOI | arXiv
 
[10]
2023 | Conference Paper | IST-REx-ID: 13967 | OA
Kretinsky J, Meggendorfer T, Weininger M. Stopping criteria for value iteration on stochastic games with quantitative objectives. In: 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
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[9]
2023 | Conference Paper | IST-REx-ID: 13139 | OA
Meggendorfer T. Correct approximation of stationary distributions. In: TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems. Vol 13993. Springer Nature; 2023:489-507. doi:10.1007/978-3-031-30823-9_25
[Published Version] View | Files available | DOI | arXiv
 
[8]
2023 | Research Data Reference | IST-REx-ID: 14990 | OA
Meggendorfer T. Artefact for: Correct Approximation of Stationary Distributions. 2023. doi:10.5281/ZENODO.7548214
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[7]
2022 | Conference Paper | IST-REx-ID: 12102 | OA
Ahmadi A, Chatterjee K, Goharshady AK, Meggendorfer T, Safavi Hemami R, Zikelic D. 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. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.FSTTCS.2022.29
[Published Version] View | Files available | DOI
 
[6]
2022 | Conference Paper | IST-REx-ID: 12568 | OA
Meggendorfer T. Risk-aware stochastic shortest path. In: Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022. Vol 36. Association for the Advancement of Artificial Intelligence; 2022:9858-9867. doi:10.1609/aaai.v36i9.21222
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[5]
2022 | Journal Article | IST-REx-ID: 10602 | OA
Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. Index appearance record with preorders. Acta Informatica. 2022;59:585-618. doi:10.1007/s00236-021-00412-y
[Published Version] View | Files available | DOI | WoS
 
[4]
2022 | Conference Paper | IST-REx-ID: 12170
Meggendorfer T. PET – A partial exploration tool for probabilistic verification. In: 20th International Symposium on Automated Technology for Verification and Analysis. Vol 13505. Springer Nature; 2022:320-326. doi:10.1007/978-3-031-19992-9_20
View | DOI
 
[3]
2022 | Conference Paper | IST-REx-ID: 12775 | OA
Grover K, Kretinsky J, Meggendorfer T, Weininger M. Anytime guarantees for reachability in uncountable Markov decision processes. In: 33rd International Conference on Concurrency Theory . Vol 243. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.CONCUR.2022.11
[Published Version] View | Files available | DOI | arXiv
 
[2]
2022 | Conference Paper | IST-REx-ID: 12000 | OA
Chatterjee K, Goharshady AK, Meggendorfer T, Zikelic D. Sound and complete certificates for auantitative termination analysis of probabilistic programs. In: Proceedings of the 34th International Conference on Computer Aided Verification. Vol 13371. Springer; 2022:55-78. doi:10.1007/978-3-031-13185-1_4
[Published Version] View | Files available | DOI | WoS
 
[1]
2017 | Conference Paper | IST-REx-ID: 13160 | OA
Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. Index appearance record for transforming Rabin automata into parity automata. In: Tools and Algorithms for the Construction and Analysis of Systems. Vol 10205. Springer; 2017:443-460. doi: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: AMA

    Export / Embed

15 Publications

Mark all

[15]
2023 | Conference Paper | IST-REx-ID: 12676 | OA
Chatterjee K, Meggendorfer T, Saona Urmeneta RJ, Svoboda J. Faster algorithm for turn-based stochastic games with bounded treewidth. In: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2023:4590-4605. doi:10.1137/1.9781611977554.ch173
[Published Version] View | DOI | Download Published Version (ext.)
 
[14]
2023 | Conference Paper | IST-REx-ID: 14259 | OA
Kretinsky J, Meggendorfer T, Prokop M, Rieder S. Guessing winning policies in LTL synthesis by semantic learning. In: 35th International Conference on Computer Aided Verification . Vol 13964. Springer Nature; 2023:390-414. doi:10.1007/978-3-031-37706-8_20
[Published Version] View | Files available | DOI
 
[13]
2023 | Conference Paper | IST-REx-ID: 14317 | OA
Akshay S, Chatterjee K, Meggendorfer T, Zikelic D. MDPs as distribution transformers: Affine invariant synthesis for safety objectives. In: International Conference on Computer Aided Verification. Vol 13966. Springer Nature; 2023:86-112. doi:10.1007/978-3-031-37709-9_5
[Published Version] View | Files available | DOI
 
[12]
2023 | Conference Paper | IST-REx-ID: 14417 | OA
Baier C, Chatterjee K, Meggendorfer T, Piribauer J. Entropic risk for turn-based stochastic games. In: 48th International Symposium on Mathematical Foundations of Computer Science. Vol 272. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.MFCS.2023.15
[Published Version] View | Files available | DOI | arXiv
 
[11]
2023 | Conference Paper | IST-REx-ID: 14518 | OA
Avni G, Meggendorfer T, Sadhukhan S, Tkadlec J, Zikelic D. Reachability poorman discrete-bidding games. In: Frontiers in Artificial Intelligence and Applications. Vol 372. IOS Press; 2023:141-148. doi:10.3233/FAIA230264
[Published Version] View | Files available | DOI | arXiv
 
[10]
2023 | Conference Paper | IST-REx-ID: 13967 | OA
Kretinsky J, Meggendorfer T, Weininger M. Stopping criteria for value iteration on stochastic games with quantitative objectives. In: 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
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[9]
2023 | Conference Paper | IST-REx-ID: 13139 | OA
Meggendorfer T. Correct approximation of stationary distributions. In: TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems. Vol 13993. Springer Nature; 2023:489-507. doi:10.1007/978-3-031-30823-9_25
[Published Version] View | Files available | DOI | arXiv
 
[8]
2023 | Research Data Reference | IST-REx-ID: 14990 | OA
Meggendorfer T. Artefact for: Correct Approximation of Stationary Distributions. 2023. doi:10.5281/ZENODO.7548214
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[7]
2022 | Conference Paper | IST-REx-ID: 12102 | OA
Ahmadi A, Chatterjee K, Goharshady AK, Meggendorfer T, Safavi Hemami R, Zikelic D. 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. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.FSTTCS.2022.29
[Published Version] View | Files available | DOI
 
[6]
2022 | Conference Paper | IST-REx-ID: 12568 | OA
Meggendorfer T. Risk-aware stochastic shortest path. In: Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022. Vol 36. Association for the Advancement of Artificial Intelligence; 2022:9858-9867. doi:10.1609/aaai.v36i9.21222
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[5]
2022 | Journal Article | IST-REx-ID: 10602 | OA
Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. Index appearance record with preorders. Acta Informatica. 2022;59:585-618. doi:10.1007/s00236-021-00412-y
[Published Version] View | Files available | DOI | WoS
 
[4]
2022 | Conference Paper | IST-REx-ID: 12170
Meggendorfer T. PET – A partial exploration tool for probabilistic verification. In: 20th International Symposium on Automated Technology for Verification and Analysis. Vol 13505. Springer Nature; 2022:320-326. doi:10.1007/978-3-031-19992-9_20
View | DOI
 
[3]
2022 | Conference Paper | IST-REx-ID: 12775 | OA
Grover K, Kretinsky J, Meggendorfer T, Weininger M. Anytime guarantees for reachability in uncountable Markov decision processes. In: 33rd International Conference on Concurrency Theory . Vol 243. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.CONCUR.2022.11
[Published Version] View | Files available | DOI | arXiv
 
[2]
2022 | Conference Paper | IST-REx-ID: 12000 | OA
Chatterjee K, Goharshady AK, Meggendorfer T, Zikelic D. Sound and complete certificates for auantitative termination analysis of probabilistic programs. In: Proceedings of the 34th International Conference on Computer Aided Verification. Vol 13371. Springer; 2022:55-78. doi:10.1007/978-3-031-13185-1_4
[Published Version] View | Files available | DOI | WoS
 
[1]
2017 | Conference Paper | IST-REx-ID: 13160 | OA
Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. Index appearance record for transforming Rabin automata into parity automata. In: Tools and Algorithms for the Construction and Analysis of Systems. Vol 10205. Springer; 2017:443-460. doi: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: AMA

    Export / Embed