52 citations · 146 across the 41 of their papers we have counts for
5 papers · 1 filter
On Probabilistic Parallel Programs with Process Creation and Synchronisation
Stefan Kiefer, Dominik Wojtczak
We initiate the study of probabilistic parallel programs with dynamic process creation and synchronisation. To this end, we introduce probabilistic split-join systems (pSJSs), a mo…
Runtime Analysis of Probabilistic Programs with Unbounded Recursion
Tomas Brazdil, Stefan Kiefer, Antonin Kucera +1
We study termination time and recurrence time in programs with unbounded recursion, which are either randomized or operate on some statistically quantified inputs. As the underlyin…
Parikh's Theorem: A simple and direct automaton construction
Javier Esparza, Pierre Ganty, Stefan Kiefer +1
Parikh's theorem states that the Parikh image of a context-free language is semilinear or, equivalently, that every context-free language has the same Parikh image as some regular…
Space-efficient scheduling of stochastically generated tasks
Tomáš Brázdil, Javier Esparza, Stefan Kiefer +1
We study the problem of scheduling tasks for execution by a processor when the tasks can stochastically generate new tasks. Tasks can be of different types, and each type has a fix…
Computing the Least Fixed Point of Positive Polynomial Systems
Javier Esparza, Stefan Kiefer, Michael Luttenberger
We consider equation systems of the form X_1 = f_1(X_1, ..., X_n), ..., X_n = f_n(X_1, ..., X_n) where f_1, ..., f_n are polynomials with positive real coefficients. In vector form…