A new algorithm for strategy synthesis in LTL games

Lecture Notes in Computer Science

Volumn 3440, Issue , 2005, Pages 477-492

  Harding, Aidan ^a   Ryan, Mark ^a   Schobbens, Pierre Yves ^b  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^b UNIVERSITY OF NAMUR   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FINITE AUTOMATA; GAME THEORY; OPTIMIZATION; PROBLEM SOLVING; SPECIFICATIONS;

DETERMINIZATION; FINITE-STATE REACTIVE SYSTEMS; LTL GAMES; OPTIMAL SOLUTIONS;

ALGORITHMS;

EID: 24644435078     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31980-1_31     Document Type: Conference Paper

References (20)

1. R. Alur, T. A. Henzinger, and O. Kupferman. Alternating-time temporal logic. Journal of the ACM, 49(5):672-713, 2002.
2. R. Alur and S. La Torre. Deterministic generators and games for LTL fragments. ACM Transactions on Computational Logic, 5(1):1-25, January 2004.
3. SMV 10-11-02p1. http://www-cad.eecs.berkeley.edu/~kenmcinil/smv/, November 2002.
4. E. Clarke, O. Grumberg, and K. Hamaguchi. Another look at LTL model checking. In David L. Dill, editor, CAV94, volume 818, pages 415-427. Springer-Verlag, 1994.
5. CuDD: Colorado university decision diagram package, release 2.30. http://vlsi.colorado.edu/~fabio/CUDD/, February 2001.
6. E. A. Emerson. Handbook of Theoretical Computer Science Volume B, chapter Temporal and Modal Logic, pages 995-1072. Elsevier, 1990.
7. E. A. Emerson and C. Lei. Efficient model checking in fragments of the prepositional model mu-calculus. In IEEE Symposium on Logic in Computer Science, pages 267-278, June 1986.
8. E. Grädel, W. Thomas, and T. Wilke, editors. Automata, Logic, and Infinite Games. Number 2500 in Lecture Notes In Computer Science. Springer, 2002.
9. S. Kremer and J.-F. Raskin. A game-based verification of non-repudiation and fair exchange protocols. Journal Of Computer Security, 11(3):399-429, 2003.
10. O. Kupferman and M. Y. Vardi. Module checking. In 8th Conference on Computer-Aided Verification, volume 1102 of LNCS, pages 75-86, 1996.
11. C. Löding. Optimal bounds for the transformation of ω-automata. In Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science, number 1738 in LNCS, pages 97-109. Springer, 1999.
12. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proceedings Of 16th ACM Symposium On Principles Of Programming Languages, pages 179-190, 1989.
13. R. Rosner. Modular Synthesis of Reactive Systems. PhD thesis, Weizmann Institute of Science, Rehovot, Israel, 1992.
14. S. Safra. Complexity of Automata on Infinite Objects. PhD thesis, The Weizmann Institute of Science, Rehovot, Israel, March 1989.
15. K. Schneider. Improving automata generation for linear temporal logic by considering the automaton hierarchy. Lecture Notes in Computer Science, 2250, 2001.
16. F. Somenzi, K. Ravi, and R. Bloem. Analysis of symbolic sec hull algorithms. In Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design, pages 88-105. Springer-Verlag, 2002.
17. S. Tasiran, R. Hojati, and R. K. Brayton. Language containment using non-deterministic omega-automata. In Proceedings of Advanced Research Working Conference on Correct Hardware Design and Verification Methods, CHARME'95, number 987 in Lecture Notes In Computer Science, pages 261-277, 1995.
18. W. Thomas. Handbook of Theoretical Computer Science Volume B, chapter Automata on Infinite Objects, pages 133-192. Elsevier, 1990.
19. W. Thomas. On the synthesis of strategies in infinite games. In Symposium on Theoretical Aspects of Computer Science, pages 1-13, 1995.
20. N. Wallmeier, P. Hütten, and W. Thomas. Symbolic synthesis of finite-state controllers for request-response specifications. In Proceedings of the 8th International Conference on the Implementation and Application of Automata, CIAA, volume 2759 of Lecture Notes in Computer Science, pages 11-22, 2003.