The paper “Probabilistic Programming Meets Automata Theory: Exact Inference using Weighted Automata” by Dominik Geißler (TU Berlin) and Tobias Winkler has been accepted for publication in Theoretical Computer Science. The paper introduces probability generating automata (PGA), a class of weighted automata used to encode distributions over nonnegative integers. PGAs can be manipulated via standard automata-theoretic […]

The paper “Weighted Automata for Exact Inference in Discrete Probabilistic Programs” by Dominik Geißler (TU Berlin) and Tobias Winkler has been accepted for presentation at ICTAC 2025. The paper explores the use of weighted automata for performing inference in probabilistic programs over integer variables.

Tom Biskup has received the Berthold Vöcking Master Award 2023 for his thesis “Invariant-based Strategy Synthesis for Nondeterministic Probabilistic Programs”. The thesis addresses the problem of making provably good decisions in face of stochastic uncertainty which is key in, e.g., complex planning tasks. Tom’s solution draws on well-known principles from deductive program verification such as […]

Christina Gehnen has received an award from the Fachgruppe Informatik at RWTH for her Bachelor’s thesis entitled “Automata-based Model Checking of Recursive Systems“. Congratulations!