B
Barbara Jobstmann
Researcher at École Polytechnique Fédérale de Lausanne
Publications - 49
Citations - 3409
Barbara Jobstmann is an academic researcher from École Polytechnique Fédérale de Lausanne. The author has contributed to research in topics: Liveness & Markov decision process. The author has an hindex of 26, co-authored 49 publications receiving 3191 citations. Previous affiliations of Barbara Jobstmann include Graz University of Technology & Centre national de la recherche scientifique.
Papers
More filters
Journal ArticleDOI
Synthesis of Reactive(1) designs
TL;DR: This work addresses the problem of automatically synthesizing digital designs from linear-time specifications by considering various classes of specifications that can be synthesized with effort quadratic in the number of states of the reactive system, where effort in symbolic steps is measured.
Book ChapterDOI
Program repair as a game
TL;DR: A conservative method to automatically fix faults in a finite state program by considering the repair problem as a game is presented and the problem of finding a memoryless strategy is NP-complete and a heuristic is presented.
Book ChapterDOI
Better Quality in Synthesis through Quantitative Objectives
TL;DR: In this paper, the synthesis of optimal implementations requires the solution of lexicographic mean-payoff games (for safety requirements), and games with both lexicoographic mean payoff and parity objectives (for liveness requirements).
Posted Content
Better Quality in Synthesis through Quantitative Objectives
TL;DR: It is shown how automata with lexicographic mean-payoff conditions can be used to express many interesting quantitative properties for reactive systems, and how quantitative properties to measure the "goodness" of an implementation are used.
Proceedings ArticleDOI
Optimizations for LTL Synthesis
Barbara Jobstmann,Roderick Bloem +1 more
TL;DR: This work constitutes the first implementation of a synthesis algorithm for full LTL by careful optimization of all intermediate automata, and uses an incremental algorithm to compute the emptiness of nondeterministic Buchi tree automata.