Polynomial-time DTMC model checking against FDFA ω-regular properties, plus FUFA model with single-exponential LTL translation and greater succinctness than FDFA or unambiguous Büchi automata.
A Unified Translation of Linear Temporal Logic to -Automata , year =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
SemML 2.0 outperforms prior LTL synthesis tools on SYNTCOMP by solving more instances faster with comparable solution quality.
citing papers explorer
-
Probabilistic Model Checking via Families of Deterministic and Unambiguous Finite Automata
Polynomial-time DTMC model checking against FDFA ω-regular properties, plus FUFA model with single-exponential LTL translation and greater succinctness than FDFA or unambiguous Büchi automata.
-
SemML 2.0: Synthesizing Controllers for LTL
SemML 2.0 outperforms prior LTL synthesis tools on SYNTCOMP by solving more instances faster with comparable solution quality.