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.
Condon , title =
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Proves exponential memory lower bound for strategy lifting from MDPs to stochastic games and shows linear memory suffices and is necessary for optimal randomized strategies in mean-payoff-parity stochastic games.
UMB is a new binary file format for probabilistic systems that provides a unified, efficient alternative to tool-specific textual representations.
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.
-
UMB: A Unified Markov Binary Format for Probabilistic Model Checking (extended version)
UMB is a new binary file format for probabilistic systems that provides a unified, efficient alternative to tool-specific textual representations.