Symbolic algorithms for infinite-state games

DOI10.1007/3-540-44685-0_36MaRDI QIDQ4791854zbMATH OpenFDO

Authors Luca De Alfaro, Rupak Majumdar, Thomas A. Henzinger

Publication date 3 February 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2154/21540536.htm

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A constraint-based approach to solving games on infinite graphs
• Improved set-based symbolic algorithms for parity games
• On the synthesis of strategies in infinite games
• Symbolic computational techniques for solving games
• scientific article; zbMATH DE number 2077117

Cited in

(26)

• Towards scalable synthesis of stochastic control systems
• Logical time control of concurrent DES
• Timed games with bounded window parity objectives
• A turn-based approach for qualitative time concurrent games
• Computable fixpoints in well-structured symbolic model checking
• Symbolic computational techniques for solving games
• New results on timed specifications
• Symbolic model checking in non-Boolean domains
• Symmetry reduction in infinite games with finite branching
• Symbolic synthesis of finite-state controllers for request-response specifications
• A symbolic finite-state approach for automated proving of theorems in combinatorial game theory
• The Symbolic Approach to Repeated Games (Abstract)
• STORMED Hybrid Games
• scientific article; zbMATH DE number 7340142 (Why is no real title available?)
• The complexity of transducer synthesis from multi-sequential specifications
• One-clock priced timed games with negative weights
• A game approach to the parametric control of real-time systems
• A constraint-based approach to solving games on infinite graphs
• Monotonic and Downward Closed Games
• Stochastic Games with Lossy Channels
• Specifications for decidable hybrid games
• A flexible toolchain for symbolic Rabin games under fair and stochastic uncertainties
• On-the-fly symbolic algorithm for timed ATL with abstractions
• Verification of continuous dynamical systems by timed automata
• Causality-based game solving
• Solving games via three-valued abstraction refinement

Describes a project that uses

Uses Software

• HyTech

This page was built for publication: Symbolic algorithms for infinite-state games

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