MICS Seminar: Benjamin Bisping
Benjamin Bisping (Télécom SudParis): Energy games—and how everything is a shortest-path problem
Donnerstag 2 April, 14:00Passed
Abstract
Many things, inside and outside of computer science, can be understood as questions of “how hard” it is to get from some A to some B. Of course, everyone knows how to solve shortest-path problems … but what if there are several resources one has to think of? What if they are intertwined? What if some environment can interfere with our plans? Surprisingly, there still are easy algorithms! This space of problems is captured by “Galois energy games” (Lemke & Bisping, CONCUR’25). We'll get a feeling for this game model and take a quick look at two applications: to semantics of distributed systems and to attack trees in cybersecurity.
Biography
Benjamin Bisping (https://bbisping.de) tries to help computers and humans get along reliably through research in formal verification and semantics of concurrent systems. He is currently a Postdoc in a cybersecurity project with Orange at Institut Polytechnique de Paris. His PhD research at TU Berlin focused on behavioral equivalences, modal logics, and game theory, leading to publications at CAV, TACAS, and CONCUR and to machine-checked formalizations in the Archive of Formal Proofs. Also, he likes to turn theory into tools and computer games.
