Strategy Synthesis for Global Window PCTL - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Strategy Synthesis for Global Window PCTL

Résumé

Given a Markov decision process (MDP) M and a formula Φ, the strategy synthesis problem asks if there exists a strategy σ s.t. the resulting Markov chain M[σ] satisfies Φ. This problem is known to be undecidable for the probabilistic temporal logic PCTL. We study a class of formulae that can be seen as a fragment of PCTL where a local, bounded horizon property is enforced all along an execution. Moreover, we allow for linear expressions in the probabilistic inequalities. This logic is at the frontier of decidability, depending on the type of strategies considered. In particular, strategy synthesis is decidable when strategies are deterministic while the general problem is undecidable.
Fichier principal
Vignette du fichier
LIPIcs.ICALP.2022.115.pdf (1.17 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04442282 , version 1 (06-02-2024)

Identifiants

Citer

Benjamin Bordais, Damien Busatto-Gaston, Shibashis Guha, Jean-François Raskin. Strategy Synthesis for Global Window PCTL. 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022), Aug 2022, Paris, France. pp.115:1--115:20, ⟨10.4230/LIPIcs.ICALP.2022.115⟩. ⟨hal-04442282⟩
27 Consultations
9 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More