Author:
Hofmann Martin,Lange Martin
Publisher
Springer Berlin Heidelberg
Reference48 articles.
1. Y. Gurevich and L. Harrington. Trees, automata, and games. In Proc. 14th Annual ACM Symp. on Theory of Computing, STOC’82, pages 60– 65. ACM, 1982.
2. V. Petersson and S. Vorobyov. A randomized subexponential algorithm for parity games. Nordic Journal of Computing, 8(3):324–345, 2001.
3. J. Vöge. Strategiesynthese für Paritätsspiele auf endlichen Graphen. PhD thesis, Dept. of Computer Science, RWTH Aachen, Germany, 2000.
4. E. A. Emerson and J. Y. Halpern. “Sometimes” and “not never” revisited: On branching versus linear time temporal logic. Journal of the ACM, 33(1):151–178, 1986.
5. A. Hoffman and R. M. Karp. On nonterminating stochastic games. Management Science, 12:359–370, 1966.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献