相关论文: Selected Topics in Asynchronous Automata

Stochastic automata are a formal compositional model for concurrent stochastic timed systems, with general distributions and non-deterministic choices. Measures of interest are defined over schedulers that resolve the nondeterminism. In…

In the following pages we discuss infinite sequences defined on a finite alphabet, and more specially those which are generated by finite automata. We have divided our paper into seven parts which are more or less self-contained. Needless…

Existence of a new type of oscillating synchronization that oscillates between three different types of synchronizations (anticipatory, complete and lag synchronizations) is identified in unidirectionally coupled nonlinear time-delay…

The control properties of discrete-time switched linear systems (SLS) with switching signals generated by logical dynamic systems are studied using the semi-tensor product (STP) approach. With the algebraic state space representation…

Cellular Automata are discrete--time dynamical systems on a spatially extended discrete space which provide paradigmatic examples of nonlinear phenomena. Their stochastic generalizations, i.e., Probabilistic Cellular Automata, are discrete…

This article deals with stability of continuous-time switched linear systems under constrained switching. Given a family of linear systems, possibly containing unstable dynamics, we characterize a new class of switching signals under which…

A specification theory combines notions of specifications and implementations with a satisfaction relation, a refinement relation and a set of operators supporting stepwise design. We develop a complete specification framework for real-time…

We consider the problem of estimating timing of measurements and actuation in distributed sensor and control systems with central processing. The focus is on direct timing estimation for scenarios where clock synchronization is not feasible…

Languages based on the theory of timed automata are a well established approach for modelling and analysing real-time systems, with many applications both in industrial and academic context. Model checking for timed automata has been…

Descriptive complexity may be useful to design programs in a natural declarative way. This is important for parallel computation models such as cellular automata, because designing parallel programs is considered difficult. Our paper…

Asynchronous programming has appeared as a programming style that overcomes undesired properties of concurrent programming. Typically in asynchronous models of programming, methods are posted into a post list for latter execution. The order…

Number-conserving (or {\em conservative}) cellular automata have been used in several contexts, in particular traffic models, where it is natural to think about them as systems of interacting particles. In this article we consider several…

Self-regulatory models are common in nature, as described e.g. in (\cite{mur}), (\cite{ha}) and (\cite{Gb}).\\ Let us consider a system made up of a number of glands as a motivation. Each gland secretes a hormone that allows secretion in…

The task of implementing a supervisory controller is non-trivial, even though different theories exist that allow automatic synthesis of these controllers in the form of automata. One of the reasons for this discord is due to the…

A synopsis is offered of the properties of discrete and integer-valued, hence "natural", cellular automata (CA). A particular class comprises the "Hamiltonian CA" with discrete updating rules that resemble Hamilton's equations. The…

We consider a system of coupled oscillators with finite inertia and time-delayed interaction, and investigate the interplay between inertia and delay both analytically and numerically. The phase velocity of the system is examined; revealed…

The paper addresses the problem of computing maximal expected time to termination of probabilistic timed automata (PTA) models, under the condition that the system will, eventually, terminate. This problem can exhibit high computational…

We introduce a notion of synchronization for higher-dimensional automata, based on coskeletons of cubical sets. Categorification transports this notion to the setting of categorical transition systems. We apply the results to study the…

This paper deals with stability of discrete-time switched linear systems whose all subsystems are unstable and the set of admissible switching signals obeys pre-specified restrictions on switches between the subsystems and dwell times on…

Synchronization is a phenomenon where interacting particles lock their motion and display non-trivial dynamics. Despite intense efforts studying synchronization in systems without clear classical limits, no comprehensive theory has been…