Alexander Weinert

Learn More
We consider the optimization variant of the realizability problem for Prompt Linear Temporal Logic, an extension of Linear Temporal Logic (LTL) by the prompt eventually operator whose scope is bounded by some parameter. In the realizability optimization problem, one is interested in computing the minimal such bound that allows to realize a given(More)
The winning condition of a parity game with costs requires an arbitrary, but fixed bound on the distance between occurrences of odd colors and the next occurrence of a larger even one. Such games quantitatively extend parity games while retaining most of their attractive properties, i.e, determining the winner is in NP and co-NP and one player has(More)
Automata Tutor is an online tool that helps students learn basic concepts in theory of computation, such as finite automata and regular expressions. The tool provides personalized feedback when students submit incorrect solutions, and also helps teachers managing large classes by automatically grading homework assignments. Automata Tutor has already been(More)
  • 1