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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Hesitant tree automata characterize FO over infinite trees equivalently to PolPCTL and CTLsf, yielding a normal form in PolCTLs and revealing that FO is limited to safety or co-safety per branch.
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.
-
Automaton-based Characterisations of First Order Logic over Infinite Trees
Hesitant tree automata characterize FO over infinite trees equivalently to PolPCTL and CTLsf, yielding a normal form in PolCTLs and revealing that FO is limited to safety or co-safety per branch.