Foundations of Software Science and Computation Structures
DOI10.1007/11690634zbMATH Open1180.68180OpenAlexW2504714231MaRDI QIDQ5899098FDOQ5899098
Authors: Olivier Serre
Publication date: 2 May 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11690634
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
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60) Games involving graphs (91A43)
Cited In (15)
- Optimal strategies in weighted limit games
- On the complexity of resource-bounded logics
- Church synthesis on register automata over linearly ordered data domains
- Model checking memoryful linear-time logics over one-counter automata
- Reachability on prefix-recognizable graphs
- 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)