|Reactive Systems Group|
|Building: E 1.1, Room: 1.16.1|
|Phone:||+49 681 302 5661|
|eMail:||weinert at react.uni-saarland.de|
|Office Hours:||Whenever the door is open|
|[W17b]||VLDL Satisfiability and Model Checking via Tree Automata.
FSTTCS 2017. December 2017.
|[WZ17]||Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs.
Joint work with Martin Zimmermann, LMCS 13(3). September 2017.
|[DWZ17]||Synthesizing Optimally Resilient Controllers.
Joint work with Daniel Neider and Martin Zimmermann, arXiv. September 2017.
|[W17]||Quantitative Reductions and Vertex-Ranked Infinite Games.
arXiv. April 2017.
|[WZ16]||Visibly Linear Dynamic Logic.
Joint work with Martin Zimmermann, FSTTCS 2016. December 2016.
|[TWZ16]||Approximating Optimal Bounds in Prompt-LTL Realizability in Doubly-exponential Time.
Joint work with Leander Tentrup and Martin Zimmermann, GandALF 2016. September 2016.
|[WZ16]||Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs.
Joint work with Martin Zimmermann, CSL 2016. August 2016.
|[AWWA15]||Automata Tutor and what we learned from building an online teaching tool.
Joint work with Loris D’Antoni, Matthew Weaver, and Rajeev Alur, BEATCS 117. October 2015.
|[Wei15b]||Analyzing Arithmetic Prolog Programs by Symbolic Execution.
Master Thesis. August 2015.
|[Wei15a]||Problem Generation for DFA Construction.
Technical Report UCB/EECS-2015-170. June 2015.
|Summer 2016||Assistant for the advanced lecture Infinite Games|
|Summer 2013||Tutor for the lecture Formale Systeme, Automaten, Prozesse at the Chair for Logic and Theory of Discrete Systems|
|Summer 2012||Tutor for the lecture Formale Systeme, Automaten, Prozesse at the Chair for Logic and Theory of Discrete Systems|