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
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Presents sound abstract interpretation plus controlled unsoundness techniques to produce tighter, efficient, terminating approximations of fixed points for non-monotone processes.
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.
-
Bounding Fixed Points of Non-Monotone Processes: Theory to Practice
Presents sound abstract interpretation plus controlled unsoundness techniques to produce tighter, efficient, terminating approximations of fixed points for non-monotone processes.