Pages that link to "Item:Q5895527"
From MaRDI portal
The following pages link to Timed Parity Games: Complexity and Robustness (Q5895527):
Displaying 15 items.
- Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems (Q388224) (← links)
- Robust reachability in timed automata and games: a game-based approach (Q481098) (← links)
- Logical time control of concurrent DES (Q2058560) (← links)
- Timed games with bounded window parity objectives (Q2112117) (← links)
- Timed network games (Q2112796) (← links)
- A turn-based approach for qualitative time concurrent games (Q2117153) (← links)
- Synthesising succinct strategies in safety games with an application to real-time scheduling (Q2636511) (← links)
- Shrinking timed automata (Q2637311) (← links)
- Efficient On-the-Fly Algorithms for Partially Observable Timed Games (Q3510829) (← links)
- Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width (Q4927428) (← links)
- Timed network games with clocks (Q5005123) (← links)
- Differential Game Logic (Q5277902) (← links)
- CONCUR 2005 – Concurrency Theory (Q5897475) (← links)
- CONCUR 2003 - Concurrency Theory (Q5900563) (← links)
- Parity games on temporal graphs (Q6629452) (← links)