Tobias Meggendorfer

Chatterjee Group

15 Publications

Mark all

[15]
2023 | Conference Paper | IST-REx-ID: 12676 | OA
K. Chatterjee, T. Meggendorfer, R. J. Saona Urmeneta, and J. Svoboda, “Faster algorithm for turn-based stochastic games with bounded treewidth,” in Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, Florence, Italy, 2023, pp. 4590–4605.
[Published Version] View | DOI | Download Published Version (ext.)
 
[14]
2023 | Conference Paper | IST-REx-ID: 14259 | OA
J. Kretinsky, T. Meggendorfer, M. Prokop, and S. Rieder, “Guessing winning policies in LTL synthesis by semantic learning,” in 35th International Conference on Computer Aided Verification , Paris, France, 2023, vol. 13964, pp. 390–414.
[Published Version] View | Files available | DOI
 
[13]
2023 | Conference Paper | IST-REx-ID: 14317 | OA
S. Akshay, K. Chatterjee, T. Meggendorfer, and D. Zikelic, “MDPs as distribution transformers: Affine invariant synthesis for safety objectives,” in International Conference on Computer Aided Verification, Paris, France, 2023, vol. 13966, pp. 86–112.
[Published Version] View | Files available | DOI
 
[12]
2023 | Conference Paper | IST-REx-ID: 14417 | OA
C. Baier, K. Chatterjee, T. Meggendorfer, and J. Piribauer, “Entropic risk for turn-based stochastic games,” in 48th International Symposium on Mathematical Foundations of Computer Science, Bordeaux, France, 2023, vol. 272.
[Published Version] View | Files available | DOI | arXiv
 
[11]
2023 | Conference Paper | IST-REx-ID: 14518 | OA
G. Avni, T. Meggendorfer, S. Sadhukhan, J. Tkadlec, and D. Zikelic, “Reachability poorman discrete-bidding games,” in Frontiers in Artificial Intelligence and Applications, Krakow, Poland, 2023, vol. 372, pp. 141–148.
[Published Version] View | Files available | DOI | arXiv
 
[10]
2023 | Conference Paper | IST-REx-ID: 13967 | OA
J. Kretinsky, T. Meggendorfer, and M. Weininger, “Stopping criteria for value iteration on stochastic games with quantitative objectives,” in 38th Annual ACM/IEEE Symposium on Logic in Computer Science, Boston, MA, United States, 2023, vol. 2023.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[9]
2023 | Conference Paper | IST-REx-ID: 13139 | OA
T. Meggendorfer, “Correct approximation of stationary distributions,” in TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, Paris, France, 2023, vol. 13993, pp. 489–507.
[Published Version] View | Files available | DOI | arXiv
 
[8]
2023 | Research Data Reference | IST-REx-ID: 14990 | OA
T. Meggendorfer, “Artefact for: Correct Approximation of Stationary Distributions.” Zenodo, 2023.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[7]
2022 | Conference Paper | IST-REx-ID: 12102 | OA
A. Ahmadi, K. Chatterjee, A. K. Goharshady, T. Meggendorfer, R. Safavi Hemami, and D. Zikelic, “Algorithms and hardness results for computing cores of Markov chains,” in 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Madras, India, 2022, vol. 250.
[Published Version] View | Files available | DOI
 
[6]
2022 | Conference Paper | IST-REx-ID: 12568 | OA
T. Meggendorfer, “Risk-aware stochastic shortest path,” in Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, Virtual, 2022, vol. 36, no. 9, pp. 9858–9867.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[5]
2022 | Journal Article | IST-REx-ID: 10602 | OA
J. Kretinsky, T. Meggendorfer, C. Waldmann, and M. Weininger, “Index appearance record with preorders,” Acta Informatica, vol. 59. Springer Nature, pp. 585–618, 2022.
[Published Version] View | Files available | DOI | WoS
 
[4]
2022 | Conference Paper | IST-REx-ID: 12170
T. Meggendorfer, “PET – A partial exploration tool for probabilistic verification,” in 20th International Symposium on Automated Technology for Verification and Analysis, Virtual, 2022, vol. 13505, pp. 320–326.
View | DOI
 
[3]
2022 | Conference Paper | IST-REx-ID: 12775 | OA
K. Grover, J. Kretinsky, T. Meggendorfer, and M. Weininger, “Anytime guarantees for reachability in uncountable Markov decision processes,” in 33rd International Conference on Concurrency Theory , Warsaw, Poland, 2022, vol. 243.
[Published Version] View | Files available | DOI | arXiv
 
[2]
2022 | Conference Paper | IST-REx-ID: 12000 | OA
K. Chatterjee, A. K. Goharshady, T. Meggendorfer, and D. Zikelic, “Sound and complete certificates for auantitative termination analysis of probabilistic programs,” in Proceedings of the 34th International Conference on Computer Aided Verification, Haifa, Israel, 2022, vol. 13371, pp. 55–78.
[Published Version] View | Files available | DOI | WoS
 
[1]
2017 | Conference Paper | IST-REx-ID: 13160 | OA
J. Kretinsky, T. Meggendorfer, C. Waldmann, and M. Weininger, “Index appearance record for transforming Rabin automata into parity automata,” in Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden, 2017, vol. 10205, pp. 443–460.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: IEEE

    Export / Embed

15 Publications

Mark all

[15]
2023 | Conference Paper | IST-REx-ID: 12676 | OA
K. Chatterjee, T. Meggendorfer, R. J. Saona Urmeneta, and J. Svoboda, “Faster algorithm for turn-based stochastic games with bounded treewidth,” in Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, Florence, Italy, 2023, pp. 4590–4605.
[Published Version] View | DOI | Download Published Version (ext.)
 
[14]
2023 | Conference Paper | IST-REx-ID: 14259 | OA
J. Kretinsky, T. Meggendorfer, M. Prokop, and S. Rieder, “Guessing winning policies in LTL synthesis by semantic learning,” in 35th International Conference on Computer Aided Verification , Paris, France, 2023, vol. 13964, pp. 390–414.
[Published Version] View | Files available | DOI
 
[13]
2023 | Conference Paper | IST-REx-ID: 14317 | OA
S. Akshay, K. Chatterjee, T. Meggendorfer, and D. Zikelic, “MDPs as distribution transformers: Affine invariant synthesis for safety objectives,” in International Conference on Computer Aided Verification, Paris, France, 2023, vol. 13966, pp. 86–112.
[Published Version] View | Files available | DOI
 
[12]
2023 | Conference Paper | IST-REx-ID: 14417 | OA
C. Baier, K. Chatterjee, T. Meggendorfer, and J. Piribauer, “Entropic risk for turn-based stochastic games,” in 48th International Symposium on Mathematical Foundations of Computer Science, Bordeaux, France, 2023, vol. 272.
[Published Version] View | Files available | DOI | arXiv
 
[11]
2023 | Conference Paper | IST-REx-ID: 14518 | OA
G. Avni, T. Meggendorfer, S. Sadhukhan, J. Tkadlec, and D. Zikelic, “Reachability poorman discrete-bidding games,” in Frontiers in Artificial Intelligence and Applications, Krakow, Poland, 2023, vol. 372, pp. 141–148.
[Published Version] View | Files available | DOI | arXiv
 
[10]
2023 | Conference Paper | IST-REx-ID: 13967 | OA
J. Kretinsky, T. Meggendorfer, and M. Weininger, “Stopping criteria for value iteration on stochastic games with quantitative objectives,” in 38th Annual ACM/IEEE Symposium on Logic in Computer Science, Boston, MA, United States, 2023, vol. 2023.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[9]
2023 | Conference Paper | IST-REx-ID: 13139 | OA
T. Meggendorfer, “Correct approximation of stationary distributions,” in TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, Paris, France, 2023, vol. 13993, pp. 489–507.
[Published Version] View | Files available | DOI | arXiv
 
[8]
2023 | Research Data Reference | IST-REx-ID: 14990 | OA
T. Meggendorfer, “Artefact for: Correct Approximation of Stationary Distributions.” Zenodo, 2023.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[7]
2022 | Conference Paper | IST-REx-ID: 12102 | OA
A. Ahmadi, K. Chatterjee, A. K. Goharshady, T. Meggendorfer, R. Safavi Hemami, and D. Zikelic, “Algorithms and hardness results for computing cores of Markov chains,” in 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Madras, India, 2022, vol. 250.
[Published Version] View | Files available | DOI
 
[6]
2022 | Conference Paper | IST-REx-ID: 12568 | OA
T. Meggendorfer, “Risk-aware stochastic shortest path,” in Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, Virtual, 2022, vol. 36, no. 9, pp. 9858–9867.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[5]
2022 | Journal Article | IST-REx-ID: 10602 | OA
J. Kretinsky, T. Meggendorfer, C. Waldmann, and M. Weininger, “Index appearance record with preorders,” Acta Informatica, vol. 59. Springer Nature, pp. 585–618, 2022.
[Published Version] View | Files available | DOI | WoS
 
[4]
2022 | Conference Paper | IST-REx-ID: 12170
T. Meggendorfer, “PET – A partial exploration tool for probabilistic verification,” in 20th International Symposium on Automated Technology for Verification and Analysis, Virtual, 2022, vol. 13505, pp. 320–326.
View | DOI
 
[3]
2022 | Conference Paper | IST-REx-ID: 12775 | OA
K. Grover, J. Kretinsky, T. Meggendorfer, and M. Weininger, “Anytime guarantees for reachability in uncountable Markov decision processes,” in 33rd International Conference on Concurrency Theory , Warsaw, Poland, 2022, vol. 243.
[Published Version] View | Files available | DOI | arXiv
 
[2]
2022 | Conference Paper | IST-REx-ID: 12000 | OA
K. Chatterjee, A. K. Goharshady, T. Meggendorfer, and D. Zikelic, “Sound and complete certificates for auantitative termination analysis of probabilistic programs,” in Proceedings of the 34th International Conference on Computer Aided Verification, Haifa, Israel, 2022, vol. 13371, pp. 55–78.
[Published Version] View | Files available | DOI | WoS
 
[1]
2017 | Conference Paper | IST-REx-ID: 13160 | OA
J. Kretinsky, T. Meggendorfer, C. Waldmann, and M. Weininger, “Index appearance record for transforming Rabin automata into parity automata,” in Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden, 2017, vol. 10205, pp. 443–460.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: IEEE

    Export / Embed