Verifying Temporal Properties

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


A very rich temporal logic, modal mu-calculus, has been described. Formulas of the logic can express liveness, safety, cyclic and other properties of processes. The next step is to provide techniques for verification, for showing when processes have, or fail to have, these features. In this chapter, we show that game theoretic ideas provide a general framework for verification.


Model Check Temporal Property Transition Graph Winning Strategy Infinite Length 
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