Lower bounds on the state complexity of population protocols
Population protocols are a model of computation in which an arbitrary number of
indistinguishable finite-state agents interact in pairs. The goal of the agents is to decide by …
indistinguishable finite-state agents interact in pairs. The goal of the agents is to decide by …
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 …
Safety Verification of Wait-Only Non-Blocking Broadcast Protocols
L Guillou, A Sangnier, N Sznajder - … on Applications and Theory of Petri …, 2024 - Springer
We study networks of processes that all execute the same finite protocol and communicate
synchronously in two different ways: a process can broadcast one message to all other …
synchronously in two different ways: a process can broadcast one message to all other …
Decidability and Complexity of Decision Problems for Affine Continuous VASS
AR Balasubramanian - arXiv preprint arXiv:2405.11085, 2024 - arxiv.org
Vector addition system with states (VASS) is a popular model for the verification of
concurrent systems. VASS consists of finitely many control states and a set of counters which …
concurrent systems. VASS consists of finitely many control states and a set of counters which …
[PDF][PDF] Safety Analysis of Parameterised Networks with
NB Rendez-Vous - irif.fr
Verification of distributed/concurrent systems. Because of their ubiquitous use in
applications 26 we rely on constantly, the development of formal methods to guarantee the …
applications 26 we rely on constantly, the development of formal methods to guarantee the …
Verification and synthesis of parameterized concurrent systems
A Majumdar - 2021 - theses.hal.science
This thesis is at the crossroad of verification and synthesis of parameterized concurrent
systems. The parameterized model checking problem asks whether a system satisfies a …
systems. The parameterized model checking problem asks whether a system satisfies a …