Games through Nested Fixpoints
From MaRDI portal
Publication:3636869
DOI10.1007/978-3-642-02658-4_24zbMath1242.68160OpenAlexW1827439371MaRDI QIDQ3636869
Thomas Martin Gawlitza, Helmut Seidl
Publication date: 30 June 2009
Published in: Computer Aided Verification (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02658-4_24
Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (8)
Average-energy games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Improving Strategies via SMT Solving ⋮ Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games ⋮ Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games ⋮ Unnamed Item ⋮ Looking at mean-payoff and total-payoff through windows
This page was built for publication: Games through Nested Fixpoints
