1,936 research outputs found
A Max-Plus Model of Asynchronous Cellular Automata
This paper presents a new framework for asynchrony. This has its origins in
our attempts to better harness the internal decision making process of cellular
automata (CA). Thus, we show that a max-plus algebraic model of asynchrony
arises naturally from the CA requirement that a cell receives the state of each
neighbour before updating. The significant result is the existence of a
bijective mapping between the asynchronous system and the synchronous system
classically used to update cellular automata. Consequently, although the CA
outputs look qualitatively different, when surveyed on "contours" of real time,
the asynchronous CA replicates the synchronous CA. Moreover, this type of
asynchrony is simple - it is characterised by the underlying network structure
of the cells, and long-term behaviour is deterministic and periodic due to the
linearity of max-plus algebra. The findings lead us to proffer max-plus algebra
as: (i) a more accurate and efficient underlying timing mechanism for models of
patterns seen in nature, and (ii) a foundation for promising extensions and
applications.Comment: in Complex Systems (Complex Systems Publications Inc), Volume 23,
Issue 4, 201
Properties of Distributed Time Arc Petri Nets
In recent work we started a research on a distributed-timed extension of Petri nets where time parameters are associated with tokens and arcs carry constraints that qualify the age of tokens required for enabling. This formalism enables to model e.g. hardware architectures like GALS. We give a formal definition of process semantics for our model and investigate several properties of local versus global timing: expressiveness, reachability and coverability
Optimal Schedules for Asynchronous Transmission of Discrete Packets
In this paper we study the distribution of dynamic data over a broadcast channel to a large number of
passive clients. Clients obtain the information by accessing the channel and listening for the next available
packet. This scenario, referred to as packet-based or discrete broadcast, has many practical applications such
as the distribution of weather and traffic updates to wireless mobile devices, reconfiguration and reprogramming
of wireless sensors and downloading dynamic task information in battlefield networks.
The optimal broadcast protocols require a high degree of synchronization between the server and the
wireless clients. However, in typical wireless settings such degree of synchronization is difficult to achieve
due to the inaccuracy of internal clocks. Moreover, in some settings, such as military applications, synchronized
transmission is not desirable due to jamming. The lack of synchronization leads to large delays
and excessive power consumption. Accordingly, in this work we focus on the design of optimal broadcast
schedules that are robust to clock inaccuracy. We present universal schedules for delivery of up-to-date
information with minimum waiting time in asynchronous settings
Asynchronous Networks and Event Driven Dynamics
Real-world networks in technology, engineering and biology often exhibit
dynamics that cannot be adequately reproduced using network models given by
smooth dynamical systems and a fixed network topology. Asynchronous networks
give a theoretical and conceptual framework for the study of network dynamics
where nodes can evolve independently of one another, be constrained, stop, and
later restart, and where the interaction between different components of the
network may depend on time, state, and stochastic effects. This framework is
sufficiently general to encompass a wide range of applications ranging from
engineering to neuroscience. Typically, dynamics is piecewise smooth and there
are relationships with Filippov systems. In the first part of the paper, we
give examples of asynchronous networks, and describe the basic formalism and
structure. In the second part, we make the notion of a functional asynchronous
network rigorous, discuss the phenomenon of dynamical locks, and present a
foundational result on the spatiotemporal factorization of the dynamics for a
large class of functional asynchronous networks
Separation of Circulating Tokens
Self-stabilizing distributed control is often modeled by token abstractions.
A system with a single token may implement mutual exclusion; a system with
multiple tokens may ensure that immediate neighbors do not simultaneously enjoy
a privilege. For a cyber-physical system, tokens may represent physical objects
whose movement is controlled. The problem studied in this paper is to ensure
that a synchronous system with m circulating tokens has at least d distance
between tokens. This problem is first considered in a ring where d is given
whilst m and the ring size n are unknown. The protocol solving this problem can
be uniform, with all processes running the same program, or it can be
non-uniform, with some processes acting only as token relays. The protocol for
this first problem is simple, and can be expressed with Petri net formalism. A
second problem is to maximize d when m is given, and n is unknown. For the
second problem, the paper presents a non-uniform protocol with a single
corrective process.Comment: 22 pages, 7 figures, epsf and pstricks in LaTe
Communication cost of consensus for nodes with limited memory
Motivated by applications in blockchains and sensor networks, we consider a
model of nodes trying to reach consensus on their majority bit. Each node
is assigned a bit at time zero, and is a finite automaton with bits of
memory (i.e., states) and a Poisson clock. When the clock of rings,
can choose to communicate, and is then matched to a uniformly chosen node
. The nodes and may update their states based on the state of the
other node. Previous work has focused on minimizing the time to consensus and
the probability of error, while our goal is minimizing the number of
communications. We show that when , consensus can be
reached at linear communication cost, but this is impossible if
. We also study a synchronous variant of the model, where
our upper and lower bounds on for achieving linear communication cost are
and , respectively. A key step is to
distinguish when nodes can become aware of knowing the majority bit and stop
communicating. We show that this is impossible if their memory is too low.Comment: 62 pages, 5 figure
- …