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.
Automatic Verification of Finite-State Concur- rent Systems Using Temporal Logic Specifications.ACM Transactions on Programming Languages and Systems1986,8(2), 244–263
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
Biprofile deviation logic proves soundness and completeness of H_bp for Dev(N) frames and introduces typed manipulation witnesses, boundary-row theorem, and factor-closure criterion for auditing report changes.
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.
-
Biprofile Deviation Logic: Report-Replacement Frames and Audit Witnesses
Biprofile deviation logic proves soundness and completeness of H_bp for Dev(N) frames and introduces typed manipulation witnesses, boundary-row theorem, and factor-closure criterion for auditing report changes.