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 Temporal Logic” by Javier Esparza at CIAA’21
- “Population Protocols: Beyond Runtime Analysis” by Javier Esparza at RP’21
- “State Complexity of Population Protocols” by Javier Esparza at FSTTCS’21
- “Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy” by A. R. Balasubramanian, Javier Esparza, Mikhail Raskin at FoSSaCS’21
- “Enforcing ω-Regular Properties in Markov Chains by Restarting” by Javier Esparza, Stefan Kiefer, Jan Kretínský, Maximilian Weininger at CONCUR’21
- “Towards efficient verification of population protocols” by Michael Blondin, Javier Esparza, Stefan Jaax, Philipp J. Meyer in Formal Methods in System Design
- “The complexity of verifying population protocols” by Javier Esparza, Stefan Jaax, Mikhail Raskin, Chana Weil-Kennedy in Distributed Computing
- “A Reduction Theorem for Randomized Distributed Algorithms Under Weak Adversaries” by Natalie Bertrand, Marijana Lazić, Josef Widder at VMCAI’21
- “Verification of randomized consensus algorithms under round-rigid adversaries” by Natalie Bertrand, Igor Konnov, Marijana Lazić, Josef Widder in
International Journal on Software Tools for Technology Transfer
- “A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks” by Hans van Ditmarsch, Éric Goubault, Marijana Lazic, Jérémy Ledent, Sergio Rajsbaum in Journal of Logical and Algebraic Methods in Programming
- “Population Protocols with Unreliable Communication” by Mikhail Raskin at ALGOSENSORS 2021
- “Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics” by A. R. Balasubramanian, Timo Lang, Revantha Ramanayake at LICS’21
- “Complexity of Coverability in Bounded Path Broadcast Networks” by A. R. Balasubramanian at FSTTCS’21
- “Adaptive Synchronisation of Pushdown Automata” by A. R. Balasubramanian, K. S. Thejaswini at CONCUR’21
- “Parameterized verification of coverability in infinite state broadcast networks” by A. R. Balasubramanian in Information and Computation
