The paper introduces oPSL, an extension of Probabilistic Strategy Logic with observability and degree-of-observability operators, and claims a decidable model checking problem with 3EXPSPACE complexity.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2024 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Probabilistic Strategy Logic with Degrees of Observability
The paper introduces oPSL, an extension of Probabilistic Strategy Logic with observability and degree-of-observability operators, and claims a decidable model checking problem with 3EXPSPACE complexity.