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…

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ć

Alpine Verification Meeting

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”.