| | |
Summary: Software Tools for Technology Transfer manuscript No.
(will be inserted by the editor)
Symbolic Computational Techniques for Solving Games ?
Rajeev Alur, P. Madhusudan, Wonhong Nam
Department of Computer and Information Science
University of Pennsylvania
Philadelphia, PA, USA.
e-mail: falur, madhusudan, wnamg@cis.upenn.edu
Received: date / Revised version: date
Abstract. Games are useful in modular speci cation
and analysis of systems where the distinction among the
choices controlled by di erent components (for instance,
the system and its environment) is made explicit. In this
paper, we formulate and compare various symbolic com-
putational techniques for deciding 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
safety game of the form \Always p".
For reachability games, the rst technique employs
|
