声明
List of Figures
List of Tables
List of Symbols
List of Abbreviations
Chapter 1 Introduction
1.1 Formal Verification
1.2 Temporal Logic
1.3 Parity Games
1.4 Contributions
1.5 The Organization of the Thesis
Chapter 2 Preliminaries
2.1 Syntax of ν TL
2.2 Semantics of ν TL
2.3 The Fragment G-mu
2.4 ν TLf
2.5 Basic Notions of Parity Games
2.6 Summary
Chapter 3 The Expressive Power of G-mu
3.1 Comparison with D-mu
3.2 Regular Expressions andω-Regular Expressions
3.3 Translatingω-Regular Expressions into G-mu Formulas
3.4 Summary
Chapter 4 A Decision Procedure for G-mu
4.1 GPF of G-mu Formulas
4.2 Goal Progression Form Graph
4.3 A Decision Procedure Based on GPG
4.4 Model Checking Based on GPG
4.5 Related Work
4.6 Summary
Chapter 5 A Decision Procedure forνTLf
5.1 PFF ofνTLf Formulas
5.2 Present Future Form Graph
5.3 A Decision Procedure Based on PFG
5.4 Model Checking Based on PFG
5.5 Summary
Chapter 6 An Improved Recursive Algorithm for Parity Games
6.1 The Recursive Algorithm for Parity Games
6.2 A Preprocessing Algorithm for Parity Games
6.3 The Recursive Algorithm with an Extra Conditional Statement
6.4 Related Work
6.5 Summary
Chapter 7 Conclusions and Future Works
7.1 Conclusions
7.2 Future Works
参考文献
致谢
Biography