1 citations · 1 across the 3 of their papers we have counts for
4 papers
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…
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…
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…
Safety Verification of Wait-Only Non-Blocking Broadcast Protocols
Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder
Broadcast protocols are programs designed to be executed by networks of processes. Each process runs the same protocol, and communication between them occurs in synchronously in tw…