Games for counting abstractions

zbMATH Open1272.91014MaRDI QIDQ2848415FDOQ2848415

Authors: Jean-François Raskin, Manuel Samuelides, Laurent Van Begin 

Publication date: 26 September 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066105002379

Recommendations

• Computer Science Logic
• Monotonic and Downward Closed Games
• On the complexity of counter reachability games
• Reachability games on extended vector addition systems with states
• On the Complexity of Counter Reachability Games

Mathematics Subject Classification ID

Applications of game theory (91A80) 2-person games (91A05) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (8)

• On-the-Fly Synthesis for Strictly Alternating Games
• On the complexity of resource-bounded logics
• Qualitative analysis of VASS-induced MDPs
• Computer Science Logic
• Strategic reasoning with a bounded number of resources: the quest for tractability
• Computable fixpoints in well-structured symbolic model checking
• Monotonic and Downward Closed Games
• State of the Art in Logics for Verification of Resource-Bounded Multi-Agent Systems

This page was built for publication: Games for counting abstractions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848415)