*Freddy Y.C. Mang*

This dissertation investigates game-theoretic approaches to the algorithmic analysis of concurrent, reactive systems. A concurrent system comprises a number of components working concurrently; a reactive system maintains an ongoing interaction with its environment. Traditional approaches to the formal analysis of concurrent reactive systems usually view the system as an unstructured state-transition graphs; instead, we view them as collections of interacting components, where each one is an open system which accepts inputs from the other components. The interactions among the components are naturally modeled as games.

Adopting this game-theoretic view, we study three related problems pertaining to the verification and synthesis of systems. Firstly, we propose two novel game-theoretic techniques for the model-checking of concurrent reactive systems, and improve the performance of model-checking. The first technique discovers an error as soon as it cannot be prevented, which can be long before it actually occurs. This technique is based on the key observation that "unpreventability" is a local property to a module: an error is unpreventable in a module state if no environment can prevent it. The second technique attempts to decompose a model-checking proof into smaller proof obligations by constructing abstract modules automatically, using reachability and "unpreventability" information about the concrete modules. Three increasingly powerful proof decomposition rules are proposed and we show that in practice, the resulting abstract modules are often significantly smaller than the concrete modules and can drastically reduce the space and time requirements for verification. Both techniques fall into the category of compositional reasoning.

Secondly, we investigate the composition and control of synchronous systems. An essential property of synchronous systems for compositional reasoning is non-blocking. In the composition of synchronous systems, however, due to circular causal dependency of input and output signals, non-blocking is not always guaranteed. Blocking compositions of systems can be ruled out semantically, by insisting on the existence of certain fixed points, or syntactically, by equipping systems with types, which make the dependencies between input and output signals transparent. We characterize various typing mechanisms in game-theoretic terms, and study their effects on the controller synthesis problem. We show that our typing systems are general enough to capture interesting real-life synchronous systems such as all delay-insensitive digital circuits. We then study their corresponding single-step control problems --a restricted form of controller synthesis problem whose solutions can be iterated in appropriate manners to solve all LTL controller synthesis problems. We also consider versions of the controller synthesis problem in which the type of the controller is given. We show that the solution of these fixed-type control problems requires the evaluation of partially ordered (Henkin) quantifiers on boolean formulas, and is therefore harder (nondeterministic exponential time) than more traditional control questions.

Thirdly, we study the synthesis of a class of open systems, namely,
*uninitialized state machines*. The sequential synthesis
problem, which is closely related to Church's solvability problem,
asks, given a specification in the form of a binary relation between
input and output streams, for the construction of a finite-state
stream transducer that converts inputs to appropriate outputs. For
efficiency reasons, practical sequential hardware is often designed to
operate without prior initialization. Such hardware designs can be
modeled by uninitialized state machines, which are required to satisfy
their specification if started from any state. We solve the
sequential synthesis problem for uninitialized systems, that is, we
construct uninitialized finite-state stream transducers. We consider
specifications given by LTL formulas, deterministic, nondeterministic,
universal, and alternating Buechi automata. We solve this
*uninitialized synthesis problem* by reducing it to the
well-understood initialized synthesis problem. While our solution is
straightforward, it leads, for some specification formalisms, to upper
bounds that are exponentially worse than the complexity of the
corresponding initialized problems. However, we prove lower bounds to
show that our simple solutions are optimal for all considered
specification formalisms. The lower bound proofs require nontrivial
generic reductions.

Ph.D. thesis, University of California at Berkeley, May 2002, 116 pages.

Download PostScript / PDF document.