The following pages link to (Q3203012):
Displaying 13 items.
- Games for the \(\mu\)-calculus (Q671352) (← links)
- Progress measures, immediate determinacy, and a subset construction for tree automata (Q1337694) (← links)
- Fixed point characterization of infinite behavior of finite-state systems (Q1389678) (← links)
- Linear temporal logic -- from infinite to finite horizon (Q2147173) (← links)
- Mechanizing the Powerset Construction for Restricted Classes of ω-Automata (Q3510798) (← links)
- Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique (Q3518271) (← links)
- Short Witnesses and Accepting Lassos in ω-Automata (Q3564867) (← links)
- Lower Bounds for Complementation of ω-Automata Via the Full Automata Technique (Q3591446) (← links)
- (Q3838838) (← links)
- Determinization and Complementation of Streett Automata (Q4412828) (← links)
- Automated temporal reasoning about reactive systems (Q6560389) (← links)
- An automata-theoretic approach to linear temporal logic (Q6560392) (← links)
- Fast symbolic algorithms for omega-regular games under strong transition fairness (Q6566589) (← links)