A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Symbolic computational techniques for solving games
2005
International Journal on Software Tools for Technology Transfer (STTT)
Games are useful in modular specification and analysis of systems where the distinction among the choices controlled by different components (for instance, the system and its environment) is made explicit. In this paper, we formulate and compare various symbolic computational techniques for deciding the existence of winning strategies. The game structure is given implicitly, and the winning condition is either a reachability game of the form "p until q" (for state predicates p and q) or a
doi:10.1007/s10009-004-0179-0
fatcat:dfovppghm5e5vdahquqdz6ml2i