The report FIMU-RS-2004-08
Deeper Connections between LTL and Alternating Automata
It is known that Linear Temporal Logic (LTL) has the same expressive power as alternating 1-weak automata (A1W automata, also called alternating linear automata or very weak alternating automata). A translation of LTL formulae
Please install a newer browser for this site to function properly.