5,007 research outputs found
Leader Election in Anonymous Rings: Franklin Goes Probabilistic
We present a probabilistic leader election algorithm for anonymous, bidirectional, asynchronous rings. It is based on an algorithm from Franklin, augmented with random identity selection, hop counters to detect identity clashes, and round numbers modulo 2. As a result, the algorithm is finite-state, so that various model checking techniques can be employed to verify its correctness, that is, eventually a unique leader is elected with probability one. We also sketch a formal correctness proof of the algorithm for rings with arbitrary size
Towards Efficient Verification of Population Protocols
Population protocols are a well established model of computation by
anonymous, identical finite state agents. A protocol is well-specified if from
every initial configuration, all fair executions reach a common consensus. The
central verification question for population protocols is the
well-specification problem: deciding if a given protocol is well-specified.
Esparza et al. have recently shown that this problem is decidable, but with
very high complexity: it is at least as hard as the Petri net reachability
problem, which is EXPSPACE-hard, and for which only algorithms of non-primitive
recursive complexity are currently known.
In this paper we introduce the class WS3 of well-specified strongly-silent
protocols and we prove that it is suitable for automatic verification. More
precisely, we show that WS3 has the same computational power as general
well-specified protocols, and captures standard protocols from the literature.
Moreover, we show that the membership problem for WS3 reduces to solving
boolean combinations of linear constraints over N. This allowed us to develop
the first software able to automatically prove well-specification for all of
the infinitely many possible inputs.Comment: 29 pages, 1 figur
Certified Impossibility Results for Byzantine-Tolerant Mobile Robots
We propose a framework to build formal developments for robot networks using
the COQ proof assistant, to state and to prove formally various properties. We
focus in this paper on impossibility proofs, as it is natural to take advantage
of the COQ higher order calculus to reason about algorithms as abstract
objects. We present in particular formal proofs of two impossibility results
forconvergence of oblivious mobile robots if respectively more than one half
and more than one third of the robots exhibit Byzantine failures, starting from
the original theorems by Bouzid et al.. Thanks to our formalization, the
corresponding COQ developments are quite compact. To our knowledge, these are
the first certified (in the sense of formally proved) impossibility results for
robot networks
Survey on Data-Centric based Routing Protocols for Wireless Sensor Networks
The great concern for energy that grew with the technological advances in the
field of networks and especially in sensor network has triggered various
approaches and protocols that relate to sensor networks. In this context, the
routing protocols were of great interest. The aim of the present paper is to
discuss routing protocols for sensor networks. This paper will focus mainly on
the discussion of the data-centric approach (COUGAR, rumor, SPIN, flooding and
Gossiping), while shedding light on the other approaches occasionally. The
functions of the nodes will be discussed as well. The methodology selected for
this paper is based on a close description and discussion of the protocol. As a
conclusion, open research questions and limitations are proposed to the reader
at the end of this paper
Mode d'emploi pour la vérification des protocoles de population
International audienceCet article est consacré à la vérification basée sur le modèle model-checking du modèle des protocoles de population introduit par Angluin et al.~\cite{AngluinADFP2006}. Ces deux dernières années, la vérification des protocoles de population par model-checking a fait l'objet denombreuses études et de nouveaux outils ont été proposés. Nous montrons dans cet article que, dans une certaine mesure, les outils classiques de model-checking tels que Spin et Prism peuvent être utilisés pour effectuer les vérifications. Pour cela, nous appliquons la technique d'abstraction par comptage pour obtenir des modèles abstraits de protocoles de population qui peuvent être vérifiés efficacement par les outils de model-checking existants. Le problème essentiel pour la complexité de la vérification des protocoles de population concerne la condition d'équité forte. Cette dernière ne peut être utilisée directement avec Spin même pour des exemples de relativement petite taille. Nous montrons qu'on peut cependant remplacer dans de nombreux cas cette équité par une équité faible efficacement vérifiable en Spin. Plus notable encore, nous montrons que la vérification avec la condition d'équité forte est équivalente à un problème de vérification d'un modèle probabiliste. Ainsi, le model-checker probabiliste Prism s'avère être un outil de vérification adapté aux protocoles de population
Multiagent autonomous energy management
The objective of this thesis is to design distributed software agents for reliable operation of integrated electric power systems of modern electric warships. The automatic reconfiguration of electric shipboard power systems is an important step toward improved fight-through and self-healing capabilities of naval warships. The improvements are conceptualized by redesigning the electric power system and its controls. This research focuses on a new scheme for an energy management system in the form of distributed control/software agents. Multiagent systems provide an ideal level of abstraction for modeling complex applications where distributed and heterogeneous entities need to cooperate to achieve a common goal. The agents\u27 task is to ensure supply of the various load demands while taking into consideration system constraints and load and supply path priorities. A self-stabilizing maximum flow algorithm is investigated to allow implementation of the agents\u27 strategies and find a global solution by only considering local information and a minimum amount of communication. (Abstract shortened by UMI.)
Constraint-based automatic symmetry detection
10.1109/ASE.2013.66930622013 28th IEEE/ACM International Conference on Automated Software Engineering, ASE 2013 - Proceedings15-2
- …