The following pages link to (Q4722045):
Displaying 10 items.
- A unified approach for showing language inclusion and equivalence between various types of \(\omega\)-automata (Q685507) (← links)
- Control machines: A new model of parallelism for compositional specifications and their effective compilation (Q1177148) (← links)
- Solving parity games via priority promotion (Q1742991) (← links)
- Branching-time logic \(\mathsf{ECTL}^{\#}\) and its tree-style one-pass tableau: extending fairness expressibility of \(\mathsf{ECTL}^+\) (Q1989347) (← links)
- Diagnosability of fair transition systems (Q2152493) (← links)
- Robust worst cases for parity games algorithms (Q2182730) (← links)
- Checking extended CTL properties using guarded quotient structures (Q2461558) (← links)
- Reasoning About Substructures and Games (Q2957764) (← links)
- Extending Fairness Expressibility of ECTL+: A Tree-Style One-Pass Tableau Approach (Q5079769) (← links)
- Assumption-based runtime verification (Q6102167) (← links)
