Conference
Marijana Lazić in the Program Committee of CAV’21
The PaVeS group is proud to announce that our member Marijana Lazić is part of the Program Committee of CAV’21.
Conference
PaVeS at RP’20
The PaVeS group; namely, Chana Weil-Kennedy and Mikhail Raskin, published in RP’20 their paper Efficient Restrictions of Immediate Observation Petri Nets.
Conference
PaVeS at FoSSaCS
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
Conference
Accepted paper at VMCAI’2021
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.
Conference
Marijana Lazić organizes FRIDA workshop
The PaVeS group is proud to announce that our member Marijana Lazić organizes the FRIDA’20 workshop which is part of QONFEST’20.
Conference
Publication of CAV’20 contribution
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.
Conference
PaVeS at CONCUR
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…
Conference
PaVeS at ATVA
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ć
Conference
Another contribution to LICS20
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.
Conference
News collection for 1st quarter of 2020
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…