The PCTL satisfiability problem resolved!
The general/finite PCTL satisfiability problems are undecidable.
Two papers at IJCAI'23!
Exciting news! Two of our research papers have been accepted at the IJCAI'23 conference.
The paper "Mean Payoff Optimization for Systems of Periodic Service & Maintenance" by D. Klaška, A. Kučera, V. Musil, and V. Řehák tackles the challenge of maximizing the long-run average payoff for agents performing periodic maintenance tasks. It performs a thorough theoretical analysis of the problem proposes efficient algorithms for constructing compact randomized maintenance schedules.
The paper "Synthesizing Resilient Strategies for Infinite-Horizon Objectives in Multi-Agent Systems" by D. Klaška, A. Kučera, M. Kurečka, V. Musil, P. Novotný and V. Řehák presents a novel specification language & strategy synthesis algorithm for creating resilient & stochastically stable strategy profiles in cooperative systems, with applications in patrolling and periodic maintenance.
