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.
4 Antonio Casares
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2verdicts
UNVERDICTED 2representative citing papers
Prefix-independent Σ₀² objectives with neutral letters are positional over arbitrary graphs exactly when recognized by history-deterministic monotone co-Büchi automata over countable ordinals, with proofs for mean-payoff positionality and a completeness lifting from finite 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.
-
Positionality in $\Sigma_0^2$ and a completeness result
Prefix-independent Σ₀² objectives with neutral letters are positional over arbitrary graphs exactly when recognized by history-deterministic monotone co-Büchi automata over countable ordinals, with proofs for mean-payoff positionality and a completeness lifting from finite graphs.