Exposing Structure

  • Colin Stirling
Part of the Texts in Computer Science book series (TCS)


In the previous chapter, an alternative characterization of when a process has a property was presented in terms of games. Simple property checking games were presented where the verifier has a winning strategy for a game if, and only if, the process satisfies the formula. When the state space of a finite state process is large, a proof using games may become unwieldy. Moreover, we should like to be able to cope with processes that have infinite state spaces. Plays of games involving such processes may have infinitely many different positions. The question then arises as to when there can be a finitely presented strategy, as a summary of the successful strategy for a player.


Choice Function Winning Strategy Proof Tree Infinite State Terminal Goal 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2001

Authors and Affiliations

  • Colin Stirling
    • 1
  1. 1.Division of InformaticsUniversity of EdinburghEdinburghUK

Personalised recommendations