The following pages link to (Q4525725):
Displaying 12 items.
- Experiments with deterministic \(\omega\)-automata for formulas of linear temporal logic (Q860862) (← links)
- Linear temporal logic -- from infinite to finite horizon (Q2147173) (← links)
- Certifying inexpressibility (Q2233423) (← links)
- Bounded model checking of infinite state systems (Q2369883) (← links)
- Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition (Q3189650) (← links)
- Generic Emptiness Check for Fun and Profit (Q3297604) (← links)
- The Quest for a Tight Translation of Büchi to co-Büchi Automata (Q3586001) (← links)
- Multi-Valued Reasoning about Reactive Systems (Q5060674) (← links)
- On Repetition Languages (Q5089230) (← links)
- Rabin vs. Streett Automata (Q5136307) (← links)
- How Deterministic are Good-For-Games Automata? (Q5136308) (← links)
- On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words (Q6094518) (← links)
