摘要: The purpose of this tutorial is to survey the essentials algorithmic theory infinite games, its role in automatic program synthesis and verification, some challenges current research.
springer.com
core.ac.uk
sci-hub.se 参考文章(18)
Wolfgang Thomas, On the synthesis of strategies in infinite games symposium on theoretical aspects of computer science. pp. 1- 13 ,(1995) , 10.1007/3-540-59042-0_57
Jens Vöge, Marcin Jurdziński, A Discrete Strategy Improvement Algorithm for Solving Parity Games computer aided verification. pp. 202- 215 ,(2000) , 10.1007/10722167_18
P. Madhusudan, P.S. Thiagarajan, Distributed Controller Synthesis for Local Specifications international colloquium on automata languages and programming. pp. 396- 407 ,(2001) , 10.1007/3-540-48224-5_33
Colin Stirling, Modal and Temporal Properties of Processes ,(2001)
S. Dziembowski, M. Jurdzinski, I. Walukiewicz, How much memory is needed to win infinite games logic in computer science. pp. 99- 110 ,(1997) , 10.1109/LICS.1997.614939
Handbook of Formal Languages Springer-Verlag. ,(1997) , 10.1007/978-3-642-59126-6
Eugene Asarin, Oded Maler, As Soon as Possible: Time Optimal Control for Timed Automata acm international conference hybrid systems computation and control. pp. 19- 30 ,(1999) , 10.1007/3-540-48983-5_6
Eugene Asarin, Oded Maler, Amir Pnueli, Joseph Sifakis, Controller Synthesis for Timed Automata 1 IFAC Proceedings Volumes. ,vol. 31, pp. 447- 452 ,(1998) , 10.1016/S1474-6670(17)42032-5
A. Pneuli, R. Rosner, Distributed reactive systems are hard to synthesize foundations of computer science. pp. 746- 757 ,(1990) , 10.1109/FSCS.1990.89597
Wolfgang Thomas, Languages, automata, and logic Handbook of formal languages, vol. 3. pp. 389- 455 ,(1997) , 10.1007/978-3-642-59126-6_7