Arrow Research search
Back to ICAPS

ICAPS 2018

Compiling Probabilistic Model Checking into Probabilistic Planning

Conference Paper Main Technical Track Artificial Intelligence · Automated Planning and Scheduling

Abstract

It has previously been observed that the verification of safety properties in deterministic model-checking frameworks can be compiled into classical planning. A similar connection exists between goal probability analysis on either side, yet that connection has not been explored. We fill that gap with a translation from Jani, an input language for quantitative model checkers including the Modest toolset and PRISM, into PPDDL. Our experiments motivate further cross-fertilization between both research areas, specifically the exchange of algorithms. Our study also initiates the creation of new benchmarks for goal probability analysis.

Authors

Keywords

  • Probabilistic Planning
  • Probabilistic Model Checking
  • Goal Probability Analysis

Context

Venue
International Conference on Automated Planning and Scheduling
Archive span
1990-2024
Indexed papers
1573
Paper id
489549230898252681
v2026.09.13