Develops polynomial-time PMC for FDFA and introduces FUFA for succinct ω-regular specs with improved LTL translation.
A Novel Learning Algorithm for B\"uchi Automata based on Family of DFA s and Classification Trees
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Probabilistic Model Checking via Families of Deterministic and Unambiguous Finite Automata
Develops polynomial-time PMC for FDFA and introduces FUFA for succinct ω-regular specs with improved LTL translation.