Switched Region Stabilization of Polynomial Dynamical Systems Abstract: We consider the problem of automatically synthesizing region stabilizing controllers for polynomial dynamical systems. The goal of our synthesis is to produce switching controllers that can switch between finitely many modes to … Continue reading →
Counterexamples in Probabilistic Verification The topic of this thesis is roughly to be classified into the formal verification of probabilistic systems. In particular, the generation of counterexamples for discrete-time Markov Models is investigated. A counterexample for discrete-time Markov Chains (DTMCs) … Continue reading →
Abschlussveranstaltung Graduiertenkolleg AlgoSyn 10.00 Begrüßung 10.15 Präsentation Rückblick auf 9 Jahre AlgoSyn 11.00 Vortrag Sascha Geulen: Learning-based Control Strategies for Hybrid Electric Vehicles 12.00 Vortrag Johanna Nellen: simulation results of learning-based control strategies 13.00 Mittagspause 13.30 Koordination der Abschlussarbeiten und … Continue reading →
Algorithmic Formal Methods in Continuous Control Abstract: Algorithmic formal methods such as model checking and reactive synthesis were originally developed in the context of discrete systems such as hardware circuits and software. Over the last few years, these techniques have … Continue reading →
Referent: Dipl.-Inform. Friedrich Gretz Titel: Semantics and Loop Invariant Synthesis for Probabilistic Programs Abstract: In this thesis we consider sequential probabilistic programs. Such programs are a means to model randomised algorithms in computer science. They facilitate the formal analysis of … Continue reading →
