LTL ∩ PCTL is decidable because an LTL formula defines a PCTL-expressible tree language iff its word language is DBW-recognizable, via a new HWTcf automata characterization of PCTL.
In:Logic and the Foundations of Game and Decision Theory (LOFT 7),Lecture Notes in Computer Science2605, Springer, pp
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LO 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
The paper introduces an ATL*-based temporal and epistemic logic framework for analyzing winning strategies in sabotage games on dynamic graphs.
citing papers explorer
-
Deciding the Common Fragment of CTL with Past and LTL
LTL ∩ PCTL is decidable because an LTL formula defines a PCTL-expressible tree language iff its word language is DBW-recognizable, via a new HWTcf automata characterization of PCTL.
-
Strategies in Sabotage Games: Temporal and Epistemic Perspectives
The paper introduces an ATL*-based temporal and epistemic logic framework for analyzing winning strategies in sabotage games on dynamic graphs.