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ć

Paper at CONCUR’19

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…

Accepted Paper at Petri Nets 2019

The PaVeS-group is very happy to announce the acceptance of the paper “Parameterized Analysis of Immediate Observation Petri Nets” at Petri Nets’19. The main contribution of the paper is to prove PSPACE-completeness for the parameterized reachability, coverability and liveness property in Immediate Observation Petri Nets a certain class of Petri Read more…