Tobias Meggendorfer

Orcid: 0000-0002-1712-2165

According to our database1, Tobias Meggendorfer authored at least 35 papers between 2017 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Quantitative Bounds on Resource Usage of Probabilistic Programs.
Proc. ACM Program. Lang., 2024

Entropic risk for turn-based stochastic games.
Inf. Comput., 2024

Tools at the Frontiers of Quantitative Verification.
CoRR, 2024

What Are the Odds? Improving the foundations of Statistical Model Checking.
CoRR, 2024

Learning Algorithms for Verification of Markov Decision Processes.
CoRR, 2024

Certified Policy Verification and Synthesis for MDPs under Distributional Reach-Avoidance Properties.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Causally Deterministic Markov Decision Processes.
Proceedings of the 35th International Conference on Concurrency Theory, 2024

Playing Games with Your PET: Extending the Partial Exploration Tool to Stochastic Games.
Proceedings of the Computer Aided Verification - 36th International Conference, 2024

2023
Correct Approximation of Stationary Distributions.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2023

Faster Algorithm for Turn-based Stochastic Games with Bounded Treewidth.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Stopping Criteria for Value Iteration on Stochastic Games with Quantitative Objectives.
Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

Reachability Poorman Discrete-Bidding Games.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Guessing Winning Policies in LTL Synthesis by Semantic Learning.
Proceedings of the Computer Aided Verification - 35th International Conference, 2023

MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives.
Proceedings of the Computer Aided Verification - 35th International Conference, 2023

2022
Index appearance record with preorders.
Acta Informatica, 2022

Algorithms and Hardness Results for Computing Cores of Markov Chains.
Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

Anytime Guarantees for Reachability in Uncountable Markov Decision Processes.
Proceedings of the 33rd International Conference on Concurrency Theory, 2022

Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs.
Proceedings of the Computer Aided Verification - 34th International Conference, 2022

PET - A Partial Exploration Tool for Probabilistic Verification.
Proceedings of the Automated Technology for Verification and Analysis, 2022

Risk-Aware Stochastic Shortest Path.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Verifikation von Markov Entscheidungsprozessen in diskreter Zeit.
Proceedings of the Ausgezeichnete Informatikdissertationen 2021., 2021

Verification of Discrete-Time Markov Decision Processes.
PhD thesis, 2021

2020
Of Cores: A Partial-Exploration Framework for Markov Decision Processes.
Log. Methods Comput. Sci., 2020

An Anytime Algorithm for Reachability on Uncountable MDP.
CoRR, 2020

2019
Artefact for paper: Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis.
Dataset, June, 2019

Artefact for paper: Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis.
Dataset, June, 2019

Satisfiability Bounds for ω-Regular Properties in Bounded-Parameter Markov Decision Processes.
Proceedings of the 58th IEEE Conference on Decision and Control, 2019

Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis.
Proceedings of the Automated Technology for Verification and Analysis, 2019

2018
LTL Store: Repository of LTL formulae from literature and case studies.
CoRR, 2018

Conditional Value-at-Risk for Reachability and Mean Payoff in Markov Decision Processes.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Rabinizer 4: From LTL to Your Favourite Deterministic Automaton.
Proceedings of the Computer Aided Verification - 30th International Conference, 2018

Owl: A Library for ω-Words, Automata, and LTL.
Proceedings of the Automated Technology for Verification and Analysis, 2018

2017
Index Appearance Record for Transforming Rabin Automata into Parity Automata.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Value Iteration for Long-Run Average Reward in Markov Decision Processes.
Proceedings of the Computer Aided Verification - 29th International Conference, 2017

Efficient Strategy Iteration for Mean Payoff in Markov Decision Processes.
Proceedings of the Automated Technology for Verification and Analysis, 2017


  Loading...