Tobias Meggendorfer

According to our database, Tobias Meggendorfer authored at least 27 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Learning Algorithms for Verification of Markov Decision Processes.

Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Vojtech Forejt, Jan Kretínský, Marta Kwiatkowska, Tobias Meggendorfer, David Parker, Mateusz Ujma

CoRR, 2024

2023

Correct Approximation of Stationary Distributions.

Tobias Meggendorfer

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2023

Faster Algorithm for Turn-based Stochastic Games with Bounded Treewidth.

Krishnendu Chatterjee, Tobias Meggendorfer, Raimundo Saona, Jakub Svoboda

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Entropic Risk for Turn-Based Stochastic Games.

Christel Baier, Krishnendu Chatterjee, Tobias Meggendorfer, Jakob Piribauer

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Stopping Criteria for Value Iteration on Stochastic Games with Quantitative Objectives.

Jan Kretínský, Tobias Meggendorfer, Maximilian Weininger

LICS, 2023

Reachability Poorman Discrete-Bidding Games.

Guy Avni, Tobias Meggendorfer, Suman Sadhukhan, Josef Tkadlec, Ðorde Zikelic

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.

Jan Kretínský, Tobias Meggendorfer, Maximilian Prokop, Sabine Rieder

Proceedings of the Computer Aided Verification - 35th International Conference, 2023

MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives.

S. Akshay, Krishnendu Chatterjee, Tobias Meggendorfer, Dorde Zikelic

Proceedings of the Computer Aided Verification - 35th International Conference, 2023

2022

Index appearance record with preorders.

Jan Kretínský, Tobias Meggendorfer, Clara Waldmann, Maximilian Weininger

Acta Informatica, 2022

Algorithms and Hardness Results for Computing Cores of Markov Chains.

Ali Ahmadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Roodabeh Safavi, Ðorde Zikelic

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.

Kush Grover, Jan Kretínský, Tobias Meggendorfer, Maximilian Weininger

Proceedings of the 33rd International Conference on Concurrency Theory, 2022

Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs.

Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Dorde Zikelic

Proceedings of the Computer Aided Verification - 34th International Conference, 2022

PET - A Partial Exploration Tool for Probabilistic Verification.

Tobias Meggendorfer

Proceedings of the Automated Technology for Verification and Analysis, 2022

Risk-Aware Stochastic Shortest Path.

Tobias Meggendorfer

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Verifikation von Markov Entscheidungsprozessen in diskreter Zeit.

Tobias Meggendorfer

Proceedings of the Ausgezeichnete Informatikdissertationen 2021., 2021

Verification of Discrete-Time Markov Decision Processes.

Tobias Meggendorfer

PhD thesis, 2021

2020

Of Cores: A Partial-Exploration Framework for Markov Decision Processes.

Jan Kretínský, Tobias Meggendorfer

Log. Methods Comput. Sci., 2020

An Anytime Algorithm for Reachability on Uncountable MDP.

Kush Grover, Jan Kretínský, Tobias Meggendorfer, Maximilian Weininger

CoRR, 2020

2019

Satisfiability Bounds for ω-Regular Properties in Bounded-Parameter Markov Decision Processes.

Maximilian Weininger, Tobias Meggendorfer, Jan Kretínský

Proceedings of the 58th IEEE Conference on Decision and Control, 2019

Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis.

Jan Kretínský, Alexander Manta, Tobias Meggendorfer

Proceedings of the Automated Technology for Verification and Analysis, 2019

2018

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

Jan Kretínský, Tobias Meggendorfer, Salomon Sickert

CoRR, 2018

Conditional Value-at-Risk for Reachability and Mean Payoff in Markov Decision Processes.

Jan Kretínský, Tobias Meggendorfer

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Rabinizer 4: From LTL to Your Favourite Deterministic Automaton.

Jan Kretínský, Tobias Meggendorfer, Salomon Sickert, Christopher Ziegler

Proceedings of the Computer Aided Verification - 30th International Conference, 2018

Owl: A Library for ω-Words, Automata, and LTL.

Jan Kretínský, Tobias Meggendorfer, Salomon Sickert

Proceedings of the Automated Technology for Verification and Analysis, 2018

2017

Index Appearance Record for Transforming Rabin Automata into Parity Automata.

Jan Kretínský, Tobias Meggendorfer, Clara Waldmann, Maximilian Weininger

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.

Pranav Ashok, Krishnendu Chatterjee, Przemyslaw Daca, Jan Kretínský, Tobias Meggendorfer

Proceedings of the Computer Aided Verification - 29th International Conference, 2017

Efficient Strategy Iteration for Mean Payoff in Markov Decision Processes.

Jan Kretínský, Tobias Meggendorfer

Proceedings of the Automated Technology for Verification and Analysis, 2017