pith. sign in

Title resolution pending

· 1998 · DOI 10.1007/bfb0028774

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
open at publisher browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.LO 1

years

2026 1

verdicts

UNVERDICTED 1

clear filters

representative citing papers

Deciding the Common Fragment of CTL with Past and LTL

cs.LO · 2026-06-29 · unverdicted · novelty 8.0

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.

citing papers explorer

Showing 1 of 1 citing paper after filters.

  • Deciding the Common Fragment of CTL with Past and LTL cs.LO · 2026-06-29 · unverdicted · none · ref 25

    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.