News Archive

I am attending AAAI’25 in Philadelphia. If you’d like to connect, feel free to reach out to me!

Our paper Refuting Equivalence in Probabilistic Programs with Conditioning was accepted at TACAS’25!

Our paper Bidding Games on Markov Decision Processes with Quantitative Reachability Objectives was accepted at AAMAS’25!

Our paper Threshold UCT: Cost-Constrained Monte Carlo Tree Search with Pareto Curves was accepted for oral presentation at AAAI’25!

I am honoured that with my colleagues we contributed to the Festschrift of Joost-Pieter Katoen with our paper Asymptotic Analysis of Probabilistic Programs: When Expectations Do Not Meet Our Expectations.

I am attending PLDI’24 in Copenhagen. If you’d like to connect, feel free to reach out to me!

I am attending a Dagstuhl seminar on stochastic games.

Our paper Solving Long-run Average Reward Robust MDPs via Stochastic Games was accepted at IJCAI’24!

Giving a talk at Hong-Kong University of Science and Technology.

Passing my habilitation with the thesis Code and Design Safety of Probabilistic Systems, I have been promoted to an associate professor.

Our paper Synthesizing Resilient Strategies for Infinite-Horizon Objectives in Multi-Agent Systems was accepted at IJCAI’23!

With my colleague Milan Češka from Brno University of Technology, we are co-PIs of the Czech Science Foundation standard grant VESCAA: Verifiable and Efficient Synthesis of Controllers for Autonomous Agents

Our paper On Lexicographic Proof Rules for Probabilistic Termination was accepted in Formal Aspects of Computing.

In the PC of CONCUR’23.

Our paper Shielding in Resource-Constrained Goal POMDPs was accepted at AAAI’23 .

Our paper Efficient Strategy Synthesis for MDPs with Resource Constraints was accepted in IEEE Transactions on Automatic Control .

In the PC of AAAI 2023

Our paper On-the-fly Adaptation of Patrolling Strategies in Changing Environments was accepted at UAI’22.

In the PC of AAMAS 2022

We have two papers accepted at Formal Methods 2021: The paper On Lexicographic Proof Rules for Probabilistic Termination studies new martingale-based proof rules for almost-sure termination of probabilistic programs (you can view the full version here ). The paper Fuel in Markov Decision Processes (FiMDP): A Practical Approach to Consumption is an extended tool paper describing the FiMDP tool for strategy synthesis in Markov decision processes with resource constraints and omega-regular objectives. The tool is accessible on github and you are invited to play around with it!

Our paper Proving Non-Termination by Program Reversal was accepted at PLDI’21.

In the PC of AAMAS 2021

Our paper Qualitative Controller Synthesis for Consumption Markov Decision Processes was accepted at CAV’20.

Our paper Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications was accepted at ICAPS’20.

Our paper Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes was accepted at AAAI’20.

Giving a talk at the University of Oxford.

Giving a talk at ICALP’19.

Our paper Deciding Fast Termination for Probabilistic VASS with Nondeterminism was accepted at ATVA’19!

Giving a talk at the University of Mons.

Our paper On the Complexity of Value Iteration was accepted at ICALP’19!

On the PC of HIGHLIGHTS’19.

My research on analysis of probabilistic received funding from the Czech Science Foundation! From January 2019, I will act as the principal investigator for the grant project “Verification and Analysis of Probabilistic Programs.”

Giving an invited talk on Risk-Aware Planning in Partially Observable Markov Decision Processes at the GAMENET conference (a meeting of the COST Action European Network for Game Theory) in Krakow.

Check out our new complexity results on finite-horizon MDPs, a collaboration with N. Balaji, S. Kiefer, G.A. Pérez, and M. Shirmohammadi. Feedback is welcome.

Presenting at IJCAI’18. Check out the paper here.

Our paper Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-sum Objectives was accepted for publication at IJCAI-ECAI’18!

Our paper Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS was accepted for publication at LICS’18!

Giving a talk on martingale techniques for analysis of probabilistic programs at UT Austin.

Presenting paper Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs at POPL’18.

Our paper Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs was accepted at POPL’18!

Giving a talk on the use of martingales in analysis of probabilistic programs at AVM’17.

On the PC of DARS’17.