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.
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
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 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.
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…
Michael Luttenberger, Philipp Meyer and Salomon Sickert-Zehnter published their article “Practical synthesis of reactive systems from LTL specifications via parity games” in Acta Informatica.
The paper Verification of Randomized Distributed Algorithms under Round-Rigid Adversaries of Marijana Lazic, Nathalie Bertrand, Igor Konnov and Josef Widder was accepted at CONCUR’19.
The paper “A Stay-in-a-Set Game without a Stationary Equilibrium” of Michael Raskin and Kristoffer Arnsfelt Hansen was accepted at GandALF’19.
The paper “Computing the Expected Execution Time of Probabilistic Workflow Nets” by Philipp Meyer, Javier Esparza and Philip Offtermatt is now published in the proceedings of TACAS’19.