<div dir="ltr"><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-size:11pt;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-variant-numeric:normal;font-variant-east-asian:normal;vertical-align:baseline;white-space:pre-wrap">A postdoctoral position in automated verification and automata learning is open at the Max Planck Institute for Software Systems in Saarbrücken, Germany, in the group of Prof. Joël Ouaknine. The project is a joint collaboration with Prof. Alexandra Silva (Cornell University) and Prof. James Worrell (Oxford University). The post is based in Saabrücken, but the successful candidate will have the opportunity occasionally to travel to Cornell (Ithaca, USA) and Oxford (UK).</span></p><br><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-size:11pt;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-variant-numeric:normal;font-variant-east-asian:normal;vertical-align:baseline;white-space:pre-wrap">Active automata learning has become an important technique in model-based verification, as it enables the automated inference of models. There is a gap between the existing learning algorithms and the expressive models that have been used in e.g. probabilistic model checking. The goal of this project is two-fold: on the one hand, we want to design active learning algorithms for probabilistic automata and study the limits of learnability; on the other hand, we want to explore their use in practical scenarios, including randomised routing.</span></p><br><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-size:11pt;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-variant-numeric:normal;font-variant-east-asian:normal;vertical-align:baseline;white-space:pre-wrap">Qualifications:</span></p><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-size:11pt;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-variant-numeric:normal;font-variant-east-asian:normal;vertical-align:baseline;white-space:pre-wrap">-- A PhD awarded (or nearing completion) in Computer Science, Mathematics, or a closely related discipline.</span></p><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-size:11pt;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-variant-numeric:normal;font-variant-east-asian:normal;vertical-align:baseline;white-space:pre-wrap">-- Knowledge and publications across some areas of: logic in computer science, formal verification, automata theory, programming language theory, probabilistic systems, learning, randomised algorithms, concurrency theory, program synthesis.</span></p><br><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-size:11pt;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-variant-numeric:normal;font-variant-east-asian:normal;vertical-align:baseline;white-space:pre-wrap">This position is available on a full time basis for one year in the first instance, with the possibility of renewal(s).</span></p><br><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-size:11pt;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-variant-numeric:normal;font-variant-east-asian:normal;vertical-align:baseline;white-space:pre-wrap">For informal enquiries, please contact Prof. Joël Ouaknine <<a href="mailto:joel@mpi-sws.org" target="_blank">joel@mpi-sws.org</a>>.</span></p></div>