Reachability in networks of register protocols under stochastic schedulers
We study the almost-sure reachability problem in a distributed system obtained as the
asynchronous composition of N copies (called processes) of the same automaton (called …
asynchronous composition of N copies (called processes) of the same automaton (called …
Parameterized broadcast networks with registers: from NP to the frontiers of decidability
L Guillou, C Mascle, N Waldburger - International Conference on …, 2024 - Springer
We consider the parameterized verification of networks of agents which communicate
through unreliable broadcasts. In this model, agents have local registers whose values are …
through unreliable broadcasts. In this model, agents have local registers whose values are …
Parameterized verification of systems with global synchronization and guards
Inspired by distributed applications that use consensus or other agreement protocols for
global coordination, we define a new computational model for parameterized systems that is …
global coordination, we define a new computational model for parameterized systems that is …
Playing with probabilities in reconfigurable broadcast networks
We study verification problems for a model of network with the following characteristics: the
number of entities is parametric, communication is performed through broadcast with …
number of entities is parametric, communication is performed through broadcast with …
Modeling and efficient verification of wireless ad hoc networks
Wireless ad hoc networks, in particular mobile ad hoc networks (MANETs), are growing very
fast as they make communication easier and more available. However, their protocols tend …
fast as they make communication easier and more available. However, their protocols tend …
The complexity of verifying population protocols
Population protocols (Angluin et al. in PODC, 2004) are a model of distributed computation
in which indistinguishable, finite-state agents interact in pairs to decide if their initial …
in which indistinguishable, finite-state agents interact in pairs to decide if their initial …
Parameterized verification of broadcast networks of register automata
LNCS 8169 - Parameterized Verification of Broadcast Networks of Register Automata Page
1 Parameterized Verification of Broadcast Networks of Register Automata Giorgio …
1 Parameterized Verification of Broadcast Networks of Register Automata Giorgio …
Model checking paxos in spin
We present a formal model of a distributed consensus algorithm in the executable
specification language Promela extended with a new type of guards, called counting guards …
specification language Promela extended with a new type of guards, called counting guards …
Complexity of verification and synthesis of threshold automata
Threshold automata are a formalism for modeling and analyzing fault-tolerant distributed
algorithms, recently introduced by Konnov, Veith, and Widder, describing protocols executed …
algorithms, recently introduced by Konnov, Veith, and Widder, describing protocols executed …
Safety analysis of parameterised networks with non-blocking rendez-vous
L Guillou, A Sangnier, N Sznajder - arxiv preprint arxiv:2307.04546, 2023 - arxiv.org
We consider networks of processes that all execute the same finite-state protocol and
communicate via a rendez-vous mechanism. When a process requests a rendez-vous …
communicate via a rendez-vous mechanism. When a process requests a rendez-vous …