Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media New York
About this chapter
Cite this chapter
Stirling, C. (2001). Exposing Structure. In: Modal and Temporal Properties of Processes. Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3550-5_7
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3550-5_7
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-3153-5
Online ISBN: 978-1-4757-3550-5
eBook Packages: Springer Book Archive