The following pages link to (Q3384171):
Displaying 10 items.
- Determinization and limit-determinization of Emerson-Lei automata (Q2147175) (← links)
- From LTL to unambiguous Büchi automata via disambiguation of alternating automata (Q2147688) (← links)
- LTL to self-loop alternating automata with generic acceptance and back (Q2202003) (← links)
- Practical synthesis of reactive systems from LTL specifications via parity games (Q2303871) (← links)
- Generic Emptiness Check for Fun and Profit (Q3297604) (← links)
- Dissecting \texttt{ltlsynt} (Q6151759) (← links)
- From LTL to unambiguous Büchi automata via disambiguation of alternating automata (Q6535954) (← links)
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism (Q6566473) (← links)
- Symbolic solution of Emerson-Lei games for reactive synthesis (Q6629450) (← links)
- Stochastic games with lexicographic objectives (Q6632196) (← links)
