Publikationen von Martin Zimmermann

Publikationen am Lehrstuhl für Informatik 7

[Zim13] M. Zimmermann. Optimal Bounds in Parametric LTL Games. Theoretical Computer Science, 493:30-45, 2013. Journal version of [Zim11]. (c) Elsevier.
[ pdf | ps | Abstract ]
[FZ12a] J. Fearnley and M. Zimmermann. Playing Muller Games in a Hurry. International Journal of Foundations of Computer Science, 23:649-668, 2012. Journal version of [FZ10]. International Journal of Foundations of Computer Science (c) 2012 World Scientific Publishing Company.
[ pdf | ps | Abstract ]
[FZ12b] W. Fridman and M. Zimmermann. Playing Pushdown Parity Games in a Hurry. In M. Faella and A. Murano, editors, Proceedings of the Third International Symposium on Games, Automata, Logic, and Formal Verification, GandALF 2012, volume 96 of Electronic Proceedings in Theoretical Computer Science, pages 183-196, 2012.
[ pdf | ps | Abstract ]
[NRZ12] D. Neider, R. Rabinovich, and M. Zimmermann. Down the Borel Hierarchy: Solving Muller Games via Safety Games. In M. Faella and A. Murano, editors, Proceedings of the Third International Symposium on Games, Automata, Logic, and Formal Verification, GandALF 2012, volume 96 of Electronic Proceedings in Theoretical Computer Science, pages 169-182, 2012.
[ pdf | ps | Abstract ]
[Zim12] M. Zimmermann. Solving Infinite Games with Bounds. PhD thesis, RWTH Aachen University, 2012.
[ pdf | Abstract ]
[FLZ11] W. Fridman, C. Löding, and M. Zimmermann. Degrees of Lookahead in Context-free Infinite Games. In Marc Bezem, editor, Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL, volume 12 of Leibniz International Proceedings in Informatics (LIPIcs), pages 264-276, Dagstuhl, Germany, 2011. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
[ pdf | ps | http | Abstract ]
[NRZ11] D. Neider, R. Rabinovich, and M. Zimmermann. Solving Muller Games via Safety Games. Technical Report AIB-2011-14, RWTH Aachen, 2011.
[ pdf | ps | Abstract ]
[Zim11] M. Zimmermann. Optimal Bounds in Parametric LTL Games. In G. D'Agostino and S. La Torre, editors, Proceedings of the Second International Symposium on Games, Automata, Logic, and Formal Verification, GandALF 2011, volume 54 of Electronic Proceedings in Theoretical Computer Science, pages 146-161, 2011. Note: the proof of Theorem 10 contains an error. The journal version [Zim13] presents a 3EXPTIME algorithm for the optimization problems. See also Chapter 3 of my PhD thesis [Zim12].
[ pdf | ps | Abstract ]
[FZ10] J. Fearnley and M. Zimmermann. Playing Muller Games in a Hurry. In A. Montanari, M. Napoli, and M. Parente, editors, Proceedings of the First International Symposium on Games, Automata, Logic, and Formal Verification, GandALF 2010, volume 25 of Electronic Proceedings in Theoretical Computer Science, pages 146-161, 2010. Conference version of [FZ12a].
[ pdf | ps | Abstract ]
[FLZ10] W. Fridman, C. Löding, and M. Zimmermann. Degrees of Lookahead in Context-free Infinite Games. Technical Report AIB-2010-20, RWTH Aachen, December 2010.
[ pdf | ps | Abstract ]
[Zim10] M. Zimmermann. Parametric LTL Games. Technical Report AIB-2010-11, RWTH Aachen, 2010.
[ pdf | ps | Abstract ]
[Zim09a] M. Zimmermann. Time-optimal Winning Strategies for Poset Games. In S. Maneth, editor, Proceedings of the 14th International Conference on Implementation and Application of Automata, CIAA 2009, volume 5642 of Lecture Notes in Computer Science, pages 217-226. Springer, 2009. Note: this document slightly differs from the printed version because an error in Corollary 1 has been corrected. (c) Springer.
[ pdf | ps | Abstract ]
[Zim09b] M. Zimmermann. Time-optimal Winning Strategies for Poset Games. Technical Report AIB-2009-13, RWTH Aachen, May 2009. Full version of [Zim09a]. Note: this document slightly differs from the original because an error in Corollary 1 has been corrected.
[ pdf | ps | Abstract ]
[Zim09c] M. Zimmermann. Time-optimal Winning Strategies in Infinite Games. Diplomarbeit, RWTH Aachen, 2009.
[ pdf | Abstract ]