Foundations of Software Science and Computation Structures
From MaRDI portal
Publication:5899098
Recommendations
- Parity games on undirected graphs
- Parity games with partial information played on graphs of bounded complexity
- Parity Games on Graphs with Medium Tree-Width
- Reachability games and parity games
- Computer Science Logic
- A brief excursion to parity games
- Parity games and automata for game logic
- Qualitative concurrent parity games
- Memoryless Determinacy of Parity Games
- Static analysis of parity games: alternating reachability under parity
Cited in
(15)- Optimal strategies in weighted limit games
- On the complexity of resource-bounded logics
- Model checking memoryful linear-time logics over one-counter automata
- Reachability on prefix-recognizable graphs
- Church synthesis on register automata over linearly ordered data domains
- Energy parity games
- An automata-theoretic approach to infinite-state systems
- Countdown games, and simulation on (succinct) one-counter nets
- Bisimulation equivalence and regularity for real-time one-counter automata
- A note on emptiness for alternating finite automata with a one-letter alphabet
- Model Checking FO(R) over One-Counter Processes and beyond
- The complexity of flat freeze LTL
- The complexity of flat freeze LTL
- Optimally Resilient Strategies in Pushdown Safety Games
- An automata-theoretic approach to the verification of distributed algorithms
This page was built for publication: Foundations of Software Science and Computation Structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5899098)