3 papers
cs.LO2025
Wait-Only Broadcast Protocols are Easier to Verify
Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder
We study networks of processes that all execute the same finite-state protocol and communicate via broadcasts. We are interested in two problems with a parameterized number of proc…
cs.FL2025
Verifying Parameterized Networks Specified by Vertex-Replacement Graph Grammars
Radu Iosif, Arnaud Sangnier, Neven Villani
We consider the parametric reachability problem (PRP) for families of networks described by vertex-replacement (VR) graph grammars, where network nodes run replicas of finite-state…
cs.LO2024
Phase-Bounded Broadcast Networks over Topologies of Communication
Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder
We study networks of processes that all execute the same finite state protocol and that communicate through broadcasts. The processes are organized in a graph (a topology) and only…