Alexander Weinert

Alexander Weinert

About Me

I am a Ph.D. student in the Reactive Systems Group at the Computer Science Department at Saarland University.

Contact

Reactive Systems Group
Saarland University
Building: E 1.1, Room: 1.16.1
eMail: weinert at react.uni-saarland.de
Office Hours: Whenever the door is open

Presentations

  • VLDL Satisfiability and Model Checking via Tree Automata.
    Dec 12, 2017, Kanpur, India, FSTTCS 2017. Slides. Handout.
  • Quantitative Reductions and Vertex-Ranked Games.
    Sep 13th, 2017, London, UK, Highlights 2017. Slides. Handout.
  • Easy to Win, Hard to Master: Playing Infinite Games Optimally.
    Apr 26th, 2017, Saarbrücken, Germany, Thesis Proposal Talk. Slides. Handout.
  • Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs.
    Dec 13th, 2016, Brussels, Belgium, MFV Seminar. Slides. Handout.
  • Approximating Optimal Bounds in Prompt-LTL Realizability in Doubly-exponential Time.
    Sep 16th, 2016, Catania, Italy, GandALF 2016. Slides. Handout.
  • Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs.
    Sep 9th, 2016, Brussels, Belgium, Highlights 2016. Slides. Handout.
  • Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs.
    Aug 31st, 2016, Marseille, France, CSL 2016. Slides. Handout.

Publications

[NWZ18] Robust, Expressive, and Quantitative Linear Temporal Logics: Pick any Two for Free.
Joint work with Daniel Neider and Martin Zimmermann. arXiv. August 2018.
[MNSTWZ18] From LTL to rLTL Monitoring: Improved Monitorability through Robust Semantics.
Joint work with Corto Mascle, Daniel Neider, Maximilian Schwenger, Paulo Tabuada, and Martin Zimmermann. arXiv. July 2018.
[W18] Quantitative Reductions and Vertex-Ranked Infinite Games.
GandALF 2018. September 2018.
[WZ18] Visibly Linear Dynamic Logic.
Joint work with Martin Zimmermann, TCS 747. November 2018.
[DWZ17] Synthesizing Optimally Resilient Controllers.
Joint work with Daniel Neider and Martin Zimmermann, CSL 2018. September 2018.
[SWZ18] Parity Games with Weights.
Joint work with Sven Schewe and Martin Zimmermann, CSL 2018. September 2018.
[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.
[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.

Teaching

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