The following pages link to Computer Science Logic (Q5292620):
Displaying 16 items.
- Petri games: synthesis of distributed systems with causal memory (Q515654) (← links)
- On decidability and complexity of low-dimensional robot games (Q2009641) (← links)
- Weighted automata on infinite words in the context of attacker-defender games (Q2013554) (← links)
- Computable fixpoints in well-structured symbolic model checking (Q2248074) (← links)
- Elementary team strategies in a monotone game (Q2581719) (← links)
- On Robot Games of Degree Two (Q2799175) (← links)
- Games for counting abstractions (Q2848415) (← links)
- Weighted Automata on Infinite Words in the Context of Attacker-Defender Games (Q3195698) (← links)
- (Q3574140) (← links)
- Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness (Q3613069) (← links)
- On-the-Fly Synthesis for Strictly Alternating Games (Q5100753) (← links)
- Monotonic and Downward Closed Games (Q5450572) (← links)
- Stochastic Games with Lossy Channels (Q5458349) (← links)
- Church synthesis on register automata over linearly ordered data domains (Q6151760) (← links)
- Realizability problem for constraint LTL (Q6178458) (← links)
- Round- and context-bounded control of dynamic pushdown systems (Q6564172) (← links)
