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: de Bakker, J.W., van Leeuwen, J
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2years
2026 2representative citing papers
A formal model of minimal evidence for each CTL operator is defined and paired with an implemented visualization scheme for witnesses and counterexamples.
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.
-
Visualising CTL Witnesses and Counterexamples -- Extended Version
A formal model of minimal evidence for each CTL operator is defined and paired with an implemented visualization scheme for witnesses and counterexamples.