相关论文: Selected Topics in Asynchronous Automata
An introduction to cellular automata (both deterministic and probabilistic) with examples. Definition of deterministic automata, dynamical properties, damage spreading and Lyapunov exponents; probabilistic automata and Markov processes,…
This chapter reviews the fundamentals of continuous and discrete Linear Time-Invariant (LTI) systems with Single Input-Single Output (SISO). We start from the general notions of signals and systems, the signal representation problem and the…
A transition from asymmetric to symmetric patterns in time-dependent extended systems is described. It is found that one dimensional cellular automata, started from fully random initial conditions, can be forced to evolve into complex…
We have developed a simple cellular automata model for nonlinearly coupled phase oscillators which can exhibit many important collective dynamical states found in other synchronizing systems. The state of our system is specified by a set of…
Mechanisms are elucidated underlying the existence of dynamical systems whose generic solutions approach asymptotically (at large time) isochronous evolutions: all their dependent variables tend asymptotically to functions periodic with the…
A signal machine is an abstract geometrical model for computation, proposed as an extension to the one-dimensional cellular automata, in which discrete time and space of cellular automata is replaced with continuous time and space in signal…
In this work, we study properties of deterministic finite-state automata with timers, a subclass of timed automata proposed by Vaandrager et al. as a candidate for an efficiently learnable timed model. We first study the complexity of the…
A recently introduced cellular automaton model for the description of traffic flow is investigated. It generalises asymmetric exclusion models which have attracted a lot of interest in the past. We calculate the so-called fundamental…
We consider small network models for mutually delay-coupled systems which typically do not exhibit stable isochronally synchronized solutions. We show that for certain coupling architectures which involve delayed self feedback to the nodes,…
The concept of boolean autonomous deterministic regular asynchronous system has its origin in switching theory, the theory of modeling the switching circuits from the digital electrical engineering. The attribute boolean vaguely refers to…
Probabilistic timed automata are classical timed automata extended with discrete probability distributions over edges. We introduce clock-dependent probabilistic timed automata, a variant of probabilistic timed automata in which transition…
We study systems of identical coupled oscillators introducing a distribution of delay times in the coupling. For arbitrary network topologies, we show that the frequency and stability of the fully synchronized states depend only on the mean…
We consider two identical oscillators with weak, time delayed coupling. We start with a general system of delay differential equations then reduce it to a phase model. With the assumption of large time delay, the resulting phase model has…
The jam phases in a two-dimensional cellular automata model of traffic flow are investigated by computer simulations. Two different types of the jam phases are found. The spatially diagonal long-range correlation obeys the power law at the…
We discuss model-checking problems as formal models of algorithmic law. Specifically, we ask for an algorithmically tractable general purpose model-checking problem that naturally models the European transport Regulation 561, and discuss…
We use a generic model for type-I excitability (known as the SNIPER or SNIC model) to describe the local dynamics of nodes within a network in the presence of non-zero coupling delays. Utilising the method of the Master Stability Function,…
Parametric timed automata (PTAs) are a powerful formalism to reason, simulate and formally verify critical real-time systems. After 25 years of research on PTAs, it is now well-understood that any non-trivial problem studied is undecidable…
The conventional nature of synchronisation is discussed in inertial frames, where it is found that theories using different synchronisations are experimentally equivalent to special relativity. In contrary, in accelerated systems only a…
In this paper, we consider partially observable timed automata endowed with a single clock. A time interval is associated with each transition specifying at which clock values it may occur. In addition, a resetting condition associated to a…
A notion of alternating timed automata is proposed. It is shown that such automata with only one clock have decidable emptiness problem over finite words. This gives a new class of timed languages which is closed under boolean operations…