Mean-Payoff Optimization in Continuous-Time Markov Chains with Parametric Alarms
Christel Baier, Clemens Dubslaff, \v{L}ubo\v{s} Koren\v{c}iak, and Anton\'in Ku\v{c}era, Vojt\v{e}ch \v{R}eh\'ak

TL;DR
This paper introduces an efficient algorithm for optimizing long-run average rewards in parametric continuous-time Markov chains with alarms, using symbolic policy iteration to handle large action spaces.
Contribution
It presents a novel symbolic policy iteration approach for parameter synthesis in parametric ACTMCs, improving scalability and efficiency over explicit methods.
Findings
Algorithm successfully solves realistic problem instances.
Symbolic approach outperforms explicit action-space methods.
Applicable to various alarm distributions like uniform, Dirac, Weibull.
Abstract
Continuous-time Markov chains with alarms (ACTMCs) allow for alarm events that can be non-exponentially distributed. Within parametric ACTMCs, the parameters of alarm-event distributions are not given explicitly and can be subject of parameter synthesis. An algorithm solving the -optimal parameter synthesis problem for parametric ACTMCs with long-run average optimization objectives is presented. Our approach is based on reduction of the problem to finding long-run average optimal strategies in semi-Markov decision processes (semi-MDPs) and sufficient discretization of parameter (i.e., action) space. Since the set of actions in the discretized semi-MDP can be very large, a straightforward approach based on explicit action-space construction fails to solve even simple instances of the problem. The presented algorithm uses an enhanced policy iteration on symbolic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
