Exponential Determinization for ω‐Automata with a Strong Fairness Acceptance Condition

DOI10.1137/S0097539798332518zbMath1120.68072OpenAlexW2024901060MaRDI QIDQ3446820

Shmuel Safra

Publication date: 26 June 2007

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539798332518

zbMATH Keywords

verification\(\omega\)-automatareactive systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (max. 100)

Linear temporal logic -- from infinite to finite horizon ⋮ Deciding Parity Games in Quasi-polynomial Time ⋮ Latticed-LTL synthesis in the presence of noisy inputs ⋮ Alternating good-for-MDPs automata ⋮ Certifying inexpressibility ⋮ Bridging the gap between fair simulation and trace inclusion ⋮ Using partial orders for the efficient verification of deadlock freedom and safety properties ⋮ \( \omega \)-automata ⋮ Automata on infinite trees

This page was built for publication: Exponential Determinization for ω‐Automata with a Strong Fairness Acceptance Condition