Georg Hofferek

TL;DR: This article defines two robustness notions, combine them, and shows how to enforce them in synthesis of robust reactive systems from temporal specifications, and presents an implementation of a special case of robustness.

TL;DR: This work shows that it can explain conflicts with the design intent by explaining unrealizability, and proposes a debugging method for incorrect specifications that does not need an implementation.

TL;DR: This work presents the countertrace or the counterstrategy as an interactive game against the user, and as a graph summarizing possible plays of this game, where it is shown how model-based diagnosis can be applied to locate an error in an unrealizable specification.

TL;DR: This paper proposes implementation-extraction based on computational learning of Boolean functions as a final synthesis step in order to obtain small and fast circuits for realizable specifications in a symbolic way.