Modular strategies for recursive game graphs

DOI10.1016/j.tcs.2005.11.017zbMath1088.68099OpenAlexW1984451181MaRDI QIDQ2368953

Salvatore La Torre, Rajeev Alur, P. Madhusudan

Publication date: 28 April 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://repository.upenn.edu/cgi/viewcontent.cgi?article=1179&context=cis_papers

zbMATH Keywords

Model-checkingGames in verificationPushdown systems

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (5)

Hyperplane separation technique for multidimensional mean-payoff games ⋮ Automata-theoretic decision of timed games ⋮ Program synthesis for interactive-security systems ⋮ Visibly pushdown modular games ⋮ Nash equilibria in symmetric graph games with partial observation

Uses Software

• SLAM
• SPIN
• Bebop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The theory of ends, pushdown automata, and second-order logic
• Infinite games played on finite graphs
• Deciding emptiness for stack automata on infinite trees
• On full abstraction for PCF: I, II and III
• Pushdown processes: Games and model-checking
• Module checking
• Alternating-time temporal logic
• Alternation
• Think globally, act locally: decentralized supervisory control
• Church's Problem Revisited
• Synthesis of interface specifications for Java classes
• Solving Sequential Conditions by Finite-State Strategies
• Computer Aided Verification
• Reachability analysis of pushdown automata: Application to model-checking

This page was built for publication: Modular strategies for recursive game graphs