The following pages link to CONCUR 2003 - Concurrency Theory (Q5900563):
Displaying 20 items.
- Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems (Q388224) (← links)
- Automatic synthesis of switching controllers for linear hybrid systems: safety control (Q391117) (← links)
- MR4UM: a framework for adding fault tolerance to UML state diagrams (Q391245) (← links)
- A survey of stochastic \(\omega \)-regular games (Q414898) (← links)
- On timed alternating simulation for concurrent timed games (Q715043) (← links)
- Synthesizing bounded-time 2-phase fault recovery (Q903518) (← links)
- Solving games via three-valued abstraction refinement (Q979079) (← links)
- To give a surprise exam, use game theory (Q1299770) (← links)
- Controller synthesis for dynamic hierarchical real-time plants using timed automata (Q1693828) (← links)
- On subgame perfect equilibria in turn-based reachability timed games (Q1996016) (← links)
- Logical time control of concurrent DES (Q2058560) (← links)
- Timed games with bounded window parity objectives (Q2112117) (← links)
- A turn-based approach for qualitative time concurrent games (Q2117153) (← links)
- A game of timing and visibility (Q2427134) (← links)
- Graph Games and Reactive Synthesis (Q3176385) (← links)
- Model Checking Real-Time Systems (Q3176387) (← links)
- Symbolic Model Checking in Non-Boolean Domains (Q3176389) (← links)
- Strict Divergence for Probabilistic Timed Automata (Q3184704) (← links)
- Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation (Q3648824) (← links)
- Realizability of Real-Time Logics (Q3648828) (← links)
