Wait-only broadcast protocols are easier to verify

DOI10.4230/LIPICS.MFCS.2025.53MaRDI QIDQ7310226zbMATH OpenFDO

Authors Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder

Publication date 5 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2025.53

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 3646295 (Why is no real title available?)
• scientific article; zbMATH DE number 2080048 (Why is no real title available?)
• scientific article; zbMATH DE number 1392309 (Why is no real title available?)
• Liveness in broadcast networks
• On the complexity of the linear-time μ-calculus for Petri Nets
• On the reachability problem for 5-dimensional vector addition systems
• Parameterized verification of ad hoc networks
• Reachability in vector addition systems is Ackermann-complete
• Reachability in vector addition systems is primitive-recursive in fixed dimension
• Reasoning about systems with many processes
• Safety analysis of parameterised networks with non-blocking rendez-vous
• The power of well-structured systems
• The reachability problem for Petri nets is not primitive recursive
• Vector Addition System Reversible Reachability Problem

This page was built for publication: Wait-only broadcast protocols are easier to verify

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310226)