Related papers: Synchronization of P Systems with Simplex Channels
We propose two uniform solutions to an open question: the Firing Squad Synchronization Problem (FSSP), for hyperdag and symmetric neural P systems, with anonymous cells. Our solutions take e_c+5 and 6e_c+7 steps, respectively, where e_c is…
In this paper, we present a 4-state solution to the Firing Squad Synchronization Problem (FSSP) based on hybrid rule 60/102 Cellular Automata(CA). This solution solves the problem on the line of length 2^n with two generals. Previous work…
In cellular automata with multiple speeds for each cell $i$ there is a positive integer $p_i$ such that this cell updates its state still periodically but only at times which are a multiple of $p_i$. Additionally there is a finite upper…
The firing squad synchronization problem (FSSP) on cellular automata has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed for not only one-dimensional arrays but…
We present different classes of solutions to the Firing Squad Synchronization Problem on networks of different shapes. The nodes are finite state processors that work at unison discrete steps. The networks considered are the line, the ring…
We construct a time-optimal quasi-solution of the firing mob synchronisation problem over finite, connected, and undirected multigraphs whose maximum degrees are uniformly bounded by a constant. It is only a quasi-solution because its…
In this paper, we come back on the notion of local simulation allowing to transform a cellular automaton into a closely related one with different local encoding of information. This notion is used to explore solutions of the Firing Squad…
Complex systems in a wide variety of areas such as biological modeling, image processing, and language recognition can be modeled using networks of very simple machines called finite automata. Connecting subsystems modeled using finite…
The firing squad synchronization problem (FSSP, for short) is a problem in automata theory introduced in 1957 by John Myhill. Its goal is to design a finite automaton A such that, if copies of A are placed in a line and connected and are…
We consider several problems relating to strongly-connected directed networks of identical finite-state processors that work synchronously in discrete time steps. The conceptually simplest of these is the Wake Up and Report Problem; this is…
We consider the problem of how to reduce the cost of communication that is required for the parallel training of a neural network. The state-of-the-art method, Bulk Synchronous Parallel Stochastic Gradient Descent (BSP-SGD), requires many…
This paper investigates the autonomous synchronization problem for discrete-time heterogeneous multiagent systems. The synchronization problem is transformed into the asymptotic decoupling problem of stable modes in a class of discrete-time…
Firing Squad Synchronisation on Cellular Automata is the dynamical synchronisation of finitely many cells without any prior knowledge of their range. This can be conceived as a signal with an infinite speed. Most of the proposed…
The paper investigates the synchronization of a network of identical linear state-space models under a possibly time-varying and directed interconnection structure. The main result is the construction of a dynamic output feedback coupling…
Finding single source shortest path is a very ubiquitous problem. But with the increasing size of large datasets in important application like social network data-mining, network topology determination-efficient parallelization of these…
Synchronization among autonomous agents via local interactions is one of the benchmark problems in multi-agent control. Whereas synchronization algorithms for identical agents have been thoroughly studied, synchronization of heterogeneous…
We study the problem of computing isochrones in road networks, where the objective is to identify the region that is reachable from a given source within a certain amount of time. While there is a wide range of practical applications for…
Continuous and discrete models for firefighting problems are well-studied in Theoretical Computer Science. We introduce a new, discrete, and more general framework based on a hexagonal cell graph to study firefighting problems in varied…
Dual-functional radar communication (DFRC) system has recently attracted significant academic attentions as an enabling solution for realizing radar-communication spectrum sharing. During the DFRC transmission, however, the critical…
Automata networks are a very general model of interacting entities, with applications to biological phenomena such as gene regulation. In many contexts, the order in which entities update their state is unknown, and the dynamics may be very…