Philip Offtermatt successfully defended his Master’s thesis “Approaching Safety for Parameterized Systems via View Abstraction”. Furthermore, we want to announce the first PaVeS Christmas workshop. It is planned for the 16th December.
Michael Luttenberger, Philipp Meyer and Salomon Sickert-Zehnter published their article “Practical synthesis of reactive systems from LTL specifications via parity games” in Acta Informatica.
Javier Esparza attended the 13th Alpine Verification Meeting from September 9th – September 11th and gave an invited talk at September 10th with the title “Population protocols: A Case Study in Parameterized Verification of Liveness Properties of Probabilistic Distributed Algorithms”.
As in the year before , Strix won this year’s SYNTCOMP competition in the TLSF/LTL Synthesis Track. Furthermore, the techniques used in Strix will be described in detail in an article which is scheduled to be published in Acta Informatica.
The paper Verification of Randomized Distributed Algorithms under Round-Rigid Adversaries of Marijana Lazic, Nathalie Bertrand, Igor Konnov and Josef Widder was accepted at CONCUR’19.
The paper “A Stay-in-a-Set Game without a Stationary Equilibrium” of Michael Raskin and Kristoffer Arnsfelt Hansen was accepted at GandALF’19.
Chana Weil-Kennedy presented the article “Parameterized Analysis of Immediate Observation Petri Nets”, a joint work with Javier Esparza and Mikhail Raskin, at Petri Nets’19 where it received the Best Paper Award.
Michael Blondin, Javier Esparza and Stefan Jaax are presenting an article titled “Expressive Power of Broadcast Consensus Protocols” at CONCUR’19. The abstract reads: Abstract: Population protocols are a formal model of computation by identical, anonymous mobile agents interacting in pairs. Their computational power is rather limited: Angluin et al. have Read more…
Philipp Meyer held his talk at TACAS’19 about “Computing the expected execution time of probabilistic Workflow-Nets”. The slides can be found here.
Javier Esparza gave a talk at the PhDopen-talks of the University of Bordeaux about Verification of Distributed Algorithms.