In this paper we consider the problem of distributed leader election in unoriented Abelian Cayley graphs of degree 4. This family of graphs, denoted by C G 4, include bidimensional tori of arbitrary size and chordal rings with one arbitrary chord. We present an algorithm which assumes that the only structural knowledge available to the nodes is “I am in an Abelian Cayley Graph of degree 4”. The...

Palamidessi has shown that the π-calculus with mixed choice is powerful enough to solve the leader election problem on a symmetric ring of processes. We show that this is also possible in the calculus of Mobile Ambients (MA), without using communication or restriction. Following Palamidessi’s methods, we deduce that there is no encoding satisfying certain conditions from MA into CCS. We also sh...

Population protocols are networks of finite-state agents, interacting randomly, and updating their states using simple rules. Despite their extreme simplicity, these systems have been shown to cooperatively perform complex computational tasks, such as simulating register machines to compute standard arithmetic functions. The election of a unique leader agent is a key requirement in such computa...

This paper describes the modeling of a two-vehicle convoy and the design of a vehicle following controller that tracks the trajectory of the vehicle ahead with prescribed inter-vehicle distance. Kinematic equations of the system are formulated applying standard robotic methodology. We consider autonomous vehicle following without any information obtained from road infrastructure or communicated...

This paper deals with the automated synthesis of implementations of knowledge-based programs with respect to two synchronous semantics (clock and synchronous perfect recall). An approach to the synthesis problem based on the use of symbolic representations is described. The method has been implemented as an extension to the model checker MCK. Two applications of the implemented synthesis system...

This paper deals with multi-agent systems that, due to using the generalized proportional Caputo fractional derivative, possess memories. The information exchange between agents does not occur continuously but only at fixed given update times, and lower limit of derivative changes according times. Two types are studied, namely without a leader leader. For model linear dynamic systems, sufficien...

This paper deals with the leader-follower formation control problem while communication constraint in data transmitting is considered. From a practical point of view, we study the case in which unmanned vehicles are subject to the limited sensing, and communication is of a particular interest. A three-dimensional formation flight of multi-unmanned aerial vehicles with leader-follower configurat...

This paper is concerned with the problem of bipartite containment control design for a class nonlinear multiagent systems time-delays in agents’ states under impulsive false-data-injection attacks. The considered system subject to Markovian variation signed communication topology. graph among followers assumed be structurally balanced each switching mode. A memory distributed protocol proposed ...

We address the enumeration and the leader election problems over partially anonymous and multi-hop broadcast networks. We consider an asynchronous communication model where each process broadcasts a message and all its neighbours receive this message after arbitrary and unpredictable time. In this paper, we present necessary conditions that must be satisfied by any graph to solve these problems...