The PaVeS group contributes to three papers in FoSSaCS’21: Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy by A. R. Balasubramanian, Javier Esparza and Mikhail Raskin, Runtime Analysis of Broadcast Consensus Protocols by Stefan Jaax and Philipp Czerner Certifying Inexpressibility by Orna Kupermann and Salomon Sickert
The PaVeS group is happy to announce that the joint work of Marijana Lazić with Nathalie Bertrand and Josef Widder “A Reduction Theorem for Randomized Distributed Algorithms under Weak Adversaries” was accepted at VMCAI’2021.
The PaVeS group is proud to announce that our member Marijana Lazić organizes the FRIDA’20 workshop which is part of QONFEST’20.
The paper “Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling” by Michael Blondin, Javier Esparza, Martin Helfrich, Antonín Kučera and Philipp J. Meyer is now published in the proceedings of CAV’20.
The PaVeS project contributes to CONCUR’20 with three articles: “Flatness and Complexity of Immediate Observation Petri Nets” by Chana Weil-Kennedy, Javier Esparza and Mikhail Raskin, “A Classification of Weak Asynchronous Models of Distributed Computing” by Fabian Reiter and Javier Esparza, and “Characterizing consensus in the Heard-of model” by Balasubramanian A. Read more…
The PaVeS project is represented at ATVA’20 with two contributions: Peregrine 2.0: Explaining Correctness of Population Protocols through Stage Graphs by Javier Esparza, Martin Helfrich, Stefan Jaax, and Philipp J. Meyer Complexity of Verification and Synthesis of Threshold Automata by A. R. Balasubramanian, Javier Esparza and Marijana Lazić
As mentioned in the previous news the PaVeS group contributed successfully to LICS’20. Another contribution of a PaVeS member is the paper “The Complexity of Reachability in Affine Vector Addition Systems with States” of Mikhail Raskin and Michael Blondin.
There are good news to be announced for the 1st quarter of 2020: The paper “An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata” by Salomon Sickert and Javier Esparza was accepted at LICS’20. The paper “Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling” Read more…
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…