1,583 research outputs found
A Design Strategy for Deadlock-Free Concurrent Systems
When building concurrent systems, it would be useful to have a collection of reusable processes
to perform standard tasks. However, without knowing certain details of the inner workings of
these components, one can never be sure that they will not cause deadlock when connected to
some particular network.
Here we describe a hierarchical method for designing complex networks of communicating
processeswhich are deadlock-free.We use this to define a safe and simple method for specifying
the communication interface to third party software components. This work is presented using
the CSP model of concurrency and the occam2.1 programming language
Feedback topology and XOR-dynamics in Boolean networks with varying input structure
We analyse a model of fixed in-degree Random Boolean Networks in which the
fraction of input-receiving nodes is controlled by a parameter gamma. We
investigate analytically and numerically the dynamics of graphs under a
parallel XOR updating scheme. This scheme is interesting because it is
accessible analytically and its phenomenology is at the same time under
control, and as rich as the one of general Boolean networks. Biologically, it
is justified on abstract grounds by the fact that all existing interactions
play a dynamical role. We give analytical formulas for the dynamics on general
graphs, showing that with a XOR-type evolution rule, dynamic features are
direct consequences of the topological feedback structure, in analogy with the
role of relevant components in Kauffman networks. Considering graphs with fixed
in-degree, we characterize analytically and numerically the feedback regions
using graph decimation algorithms (Leaf Removal). With varying gamma, this
graph ensemble shows a phase transition that separates a tree-like graph region
from one in which feedback components emerge. Networks near the transition
point have feedback components made of disjoint loops, in which each node has
exactly one incoming and one outgoing link. Using this fact we provide
analytical estimates of the maximum period starting from topological
considerations
Cellular automaton supercolliders
Gliders in one-dimensional cellular automata are compact groups of
non-quiescent and non-ether patterns (ether represents a periodic background)
translating along automaton lattice. They are cellular-automaton analogous of
localizations or quasi-local collective excitations travelling in a spatially
extended non-linear medium. They can be considered as binary strings or symbols
travelling along a one-dimensional ring, interacting with each other and
changing their states, or symbolic values, as a result of interactions. We
analyse what types of interaction occur between gliders travelling on a
cellular automaton `cyclotron' and build a catalog of the most common
reactions. We demonstrate that collisions between gliders emulate the basic
types of interaction that occur between localizations in non-linear media:
fusion, elastic collision, and soliton-like collision. Computational outcomes
of a swarm of gliders circling on a one-dimensional torus are analysed via
implementation of cyclic tag systems
A brief history of learning classifier systems: from CS-1 to XCS and its variants
© 2015, Springer-Verlag Berlin Heidelberg. The direction set by Wilson’s XCS is that modern Learning Classifier Systems can be characterized by their use of rule accuracy as the utility metric for the search algorithm(s) discovering useful rules. Such searching typically takes place within the restricted space of co-active rules for efficiency. This paper gives an overview of the evolution of Learning Classifier Systems up to XCS, and then of some of the subsequent developments of Wilson’s algorithm to different types of learning
- …