default search action
Tobias Meggendorfer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]Christel Baier
, Krishnendu Chatterjee, Tobias Meggendorfer, Jakob Piribauer
Entropic risk for turn-based stochastic games. Inf. Comput. 301: 105214 (2024) - [j3]Krishnendu Chatterjee
Quantitative Bounds on Resource Usage of Probabilistic Programs. Proc. ACM Program. Lang. 8(OOPSLA1): 362-391 (2024) - [c24]Tobias Meggendorfer
Playing Games with Your PET: Extending the Partial Exploration Tool to Stochastic Games. CAV (3) 2024: 359-372 - [c23]S. Akshay, Tobias Meggendorfer, P. S. Thiagarajan:
Causally Deterministic Markov Decision Processes. CONCUR 2024: 6:1-6:22 - [c22]S. Akshay, Krishnendu Chatterjee, Tobias Meggendorfer, Dorde Zikelic:
Certified Policy Verification and Synthesis for MDPs under Distributional Reach-Avoidance Properties. IJCAI 2024: 3-12 - [i22]Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Vojtech Forejt, Jan Kretínský, Marta Kwiatkowska, Tobias Meggendorfer, David Parker, Mateusz Ujma:
Learning Algorithms for Verification of Markov Decision Processes. CoRR abs/2403.09184 (2024) - [i21]Tobias Meggendorfer, Maximilian Weininger
What Are the Odds? Improving the foundations of Statistical Model Checking. CoRR abs/2404.05424 (2024) - [i20]Tobias Meggendorfer, Maximilian Weininger:
Playing Games with your PET: Extending the Partial Exploration Tool to Stochastic Games. CoRR abs/2405.03885 (2024) - [i19]S. Akshay, Krishnendu Chatterjee, Tobias Meggendorfer, Dorde Zikelic:
Certified Policy Verification and Synthesis for MDPs under Distributional Reach-avoidance Properties. CoRR abs/2405.04015 (2024) - [i18]Roman Andriushchenko, Alexander Bork, Carlos E. Budde, Milan Ceska, Kush Grover, Ernst Moritz Hahn, Arnd Hartmanns, Bryant Israelsen, Nils Jansen, Joshua Jeppson, Sebastian Junges, Maximilian A. Köhl, Bettina Könighofer, Jan Kretínský, Tobias Meggendorfer, David Parker, Stefan Pranger, Tim Quatmann, Enno Ruijters, Landon Taylor, Matthias Volk, Maximilian Weininger, Zhen Zhang:
Tools at the Frontiers of Quantitative Verification. CoRR abs/2405.13583 (2024) - [i17]Carlos E. Budde, Arnd Hartmanns, Tobias Meggendorfer, Maximilian Weininger, Patrick Wienhöft:
Sound Statistical Model Checking for Probabilities and Expected Rewards. CoRR abs/2411.00559 (2024) - 2023
- [c21]S. Akshay
MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives. CAV (3) 2023: 86-112 - [c20]Jan Kretínský
Guessing Winning Policies in LTL Synthesis by Semantic Learning. CAV (1) 2023: 390-414 - [c19]Guy Avni, Tobias Meggendorfer, Suman Sadhukhan, Josef Tkadlec, Dorde Zikelic:
Reachability Poorman Discrete-Bidding Games. ECAI 2023: 141-148 - [c18]Jan Kretínský, Tobias Meggendorfer, Maximilian Weininger
Stopping Criteria for Value Iteration on Stochastic Games with Quantitative Objectives. LICS 2023: 1-14 - [c17]Christel Baier
Entropic Risk for Turn-Based Stochastic Games. MFCS 2023: 15:1-15:16 - [c16]Krishnendu Chatterjee, Tobias Meggendorfer, Raimundo Saona
Faster Algorithm for Turn-based Stochastic Games with Bounded Treewidth. SODA 2023: 4590-4605 - [c15]Tobias Meggendorfer
Correct Approximation of Stationary Distributions. TACAS (1) 2023: 489-507 - [i16]Tobias Meggendorfer:
Correct Approximation of Stationary Distributions. CoRR abs/2301.08137 (2023) - [i15]Jan Kretínský, Tobias Meggendorfer, Maximilian Weininger
Stopping Criteria for Value Iteration on Stochastic Games with Quantitative Objectives. CoRR abs/2304.09930 (2023) - [i14]Jan Kretínský, Tobias Meggendorfer, Maximilian Prokop, Sabine Rieder:
Guessing Winning Policies in LTL Synthesis by Semantic Learning. CoRR abs/2305.15109 (2023) - [i13]S. Akshay, Krishnendu Chatterjee, Tobias Meggendorfer, Dorde Zikelic:
MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives. CoRR abs/2305.16796 (2023) - [i12]Christel Baier, Krishnendu Chatterjee, Tobias Meggendorfer, Jakob Piribauer:
Entropic Risk for Turn-Based Stochastic Games. CoRR abs/2307.06611 (2023) - [i11]Guy Avni, Tobias Meggendorfer, Suman Sadhukhan, Josef Tkadlec, Dorde Zikelic:
Reachability Poorman Discrete-Bidding Games. CoRR abs/2307.15218 (2023) - 2022
- [j2]Jan Kretínský
Index appearance record with preorders. Acta Informatica 59(5): 585-618 (2022) - [c14]Tobias Meggendorfer:
Risk-Aware Stochastic Shortest Path. AAAI 2022: 9858-9867 - [c13]Tobias Meggendorfer
PET - A Partial Exploration Tool for Probabilistic Verification. ATVA 2022: 320-326 - [c12]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Dorde Zikelic:
Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs. CAV (1) 2022: 55-78 - [c11]Kush Grover
Anytime Guarantees for Reachability in Uncountable Markov Decision Processes. CONCUR 2022: 11:1-11:20 - [c10]Ali Ahmadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Roodabeh Safavi, Dorde Zikelic:
Algorithms and Hardness Results for Computing Cores of Markov Chains. FSTTCS 2022: 29:1-29:20 - [i10]Tobias Meggendorfer:
Risk-aware Stochastic Shortest Path. CoRR abs/2203.01640 (2022) - [i9]Jan Kretínský, Tobias Meggendorfer, Maximilian Weininger
Satisfiability Bounds for ω-Regular Properties in Bounded-Parameter Markov Decision Processes. CoRR abs/2207.13660 (2022) - 2021
- [b1]Tobias Meggendorfer:
Verification of Discrete-Time Markov Decision Processes. Technical University of Munich, Germany, 2021 - [p1]Tobias Meggendorfer:
Verifikation von Markov Entscheidungsprozessen in diskreter Zeit. Ausgezeichnete Informatikdissertationen 2021: 201-210 - 2020
- [j1]Jan Kretínský, Tobias Meggendorfer:
Of Cores: A Partial-Exploration Framework for Markov Decision Processes. Log. Methods Comput. Sci. 16(4) (2020) - [i8]Kush Grover, Jan Kretínský, Tobias Meggendorfer, Maximilian Weininger:
An Anytime Algorithm for Reachability on Uncountable MDP. CoRR abs/2008.04824 (2020)
2010 – 2019
- 2019
- [c9]Jan Kretínský
Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis. ATVA 2019: 404-422 - [c8]Maximilian Weininger
Satisfiability Bounds for ω-Regular Properties in Bounded-Parameter Markov Decision Processes. CDC 2019: 2284-2291 - [c7]Jan Kretínský, Tobias Meggendorfer
Of Cores: A Partial-Exploration Framework for Markov Decision Processes. CONCUR 2019: 5:1-5:17 - [d2]Jan Kretínský
Artefact for paper: Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis. Version 1.0. Zenodo, 2019 [all versions] - [d1]Jan Kretínský
Artefact for paper: Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis. Version 1.0. Zenodo, 2019 [all versions] - [i7]Jan Kretínský, Tobias Meggendorfer:
Of Cores: A Partial-Exploration Framework for Markov Decision Processes. CoRR abs/1906.06931 (2019) - [i6]Jan Kretínský, Alexander Manta, Tobias Meggendorfer:
Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis. CoRR abs/1907.12157 (2019) - 2018
- [c6]Jan Kretínský
Owl: A Library for ω-Words, Automata, and LTL. ATVA 2018: 543-550 - [c5]Jan Kretínský, Tobias Meggendorfer
Rabinizer 4: From LTL to Your Favourite Deterministic Automaton. CAV (1) 2018: 567-577 - [c4]Jan Kretínský, Tobias Meggendorfer
Conditional Value-at-Risk for Reachability and Mean Payoff in Markov Decision Processes. LICS 2018: 609-618 - [i5]Jan Kretínský, Tobias Meggendorfer:
Conditional Value-at-Risk for Reachability and Mean Payoff in Markov Decision Processes. CoRR abs/1805.02946 (2018) - [i4]Jan Kretínský, Tobias Meggendorfer, Salomon Sickert:
LTL Store: Repository of LTL formulae from literature and case studies. CoRR abs/1807.03296 (2018) - 2017
- [c3]Jan Kretínský, Tobias Meggendorfer
Efficient Strategy Iteration for Mean Payoff in Markov Decision Processes. ATVA 2017: 380-399 - [c2]Pranav Ashok
Value Iteration for Long-Run Average Reward in Markov Decision Processes. CAV (1) 2017: 201-221 - [c1]Jan Kretínský, Tobias Meggendorfer
Index Appearance Record for Transforming Rabin Automata into Parity Automata. TACAS (1) 2017: 443-460 - [i3]Jan Kretínský, Tobias Meggendorfer, Clara Waldmann
Index appearance record for transforming Rabin automata into parity automata. CoRR abs/1701.05738 (2017) - [i2]Pranav Ashok, Krishnendu Chatterjee, Przemyslaw Daca, Jan Kretínský, Tobias Meggendorfer:
Value Iteration for Long-run Average Reward in Markov Decision Processes. CoRR abs/1705.02326 (2017) - [i1]Jan Kretínský, Tobias Meggendorfer:
Efficient Strategy Iteration for Mean Payoff in Markov Decision Processes. CoRR abs/1707.01859 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-13 19:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: