The PaVeS group contributed to FoSSaCS’22 with two papers: “Separators in Continuous Petri Nets” by Miachel Blondin and Javier Esparza “Parameterized Analysis of Reconfigurable Broadcast Networks” by A. R. Balasubramanian, Lucie Guillou and Chana Weil-Kennedy
Philipp Czerner, Roland Guttenberg, Martin Helfrich, and Javier Esparza contribute to SAND’21 with their paper “Fast and Succinct Population Protocols for Presburger Arithmetic” (preprint). There contribution is recognized with SAND’s Best Paper Award.
A long time passed since the last news. This is, however, not due to a lack of activity but a lack of reporting. Thus, we use this post to report various publications from last year and the beginning of this year: “Back to the Future: A Fresh Look at Linear Read more…
The PaVeS group contributed with two accepted papers to GandALF’21: “Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent” by A. R. Balasubramanian and Chana Weil-Kennedy and “Abduction of trap invariants in parameterized systems” by Javier Esparza, Mikhail Raskin and Christoph Welzel.
Christoph Welzel presented the article “Computing Parameterized Invariants of Parameterized Petri Nets”, a joint work with Javier Esparza and Mikhail Raskin, at Petri Nets’21 where it received the Best Paper Award.
The PaVeS group contributed with two accepted papers to PODC’21: “Lower Bounds on the State Complexity of Population Protocols” by Philipp Czerner and Javier Esparza, and “Decision Power of Weak Asynchronous Models of Distributed Computing” by Philipp Czerner, Roland Guttenberg, Martin Helfrich, and Javier Esparza. Additionally, Roland Guttenberg presented this Read more…
The paper “Computing Parameterized Invariants of Parameterized Petri Nets” by Javier Esparza, Mikhail Raskin and Christoph Welzel was accepted at Petri nets’21.
In this year’s test-of-time awards of CONCUR the paper “Reachability Analysis of Pushdown Automata: Application to Model-checking” of Ahmed Bouajjani, Javier Esparza, and Oded Maler is recognized as “a breakthrough paper that opened the way for the analysis of pushdown automata via model-checking techniques”.
The PaVeS group; namely, Chana Weil-Kennedy and Mikhail Raskin, published in RP’20 their paper Efficient Restrictions of Immediate Observation Petri Nets.
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