pith. sign in

Title resolution pending

· 2014 · DOI 10.1007/978-3-642-54792-8_15

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
open at publisher browse 2 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.FL 1 cs.LO 1

years

2026 2

verdicts

UNVERDICTED 2

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 2 of 2 citing papers.

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

    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.

  • Complementing Emerson-Lei Elevator Automata (Technical Report) cs.FL · 2026-06-25 · unverdicted · none · ref 10 · 2 links

    Introduces Emerson-Lei elevator automata and a complementation algorithm with better asymptotic complexity than known methods for unrestricted Emerson-Lei automata.