In this paper we define and study the class of stopwatch automata which are timed automata augmented with stopwatches and unobservable behaviour. In particular, we investigate the expressive power of this class of automata, and show as a main result that any finite or infinite timed language accepted by a linear hybrid automaton is also acceptable by a stopwatch automaton. The consequences of t...

Hybrid automata are the prevailing formalisms to reason about systems that consist of discrete and continuous functions. Several specializations like o-minimal hybrid automata have been considered that should (1) retain as much expressibility as possible, and (2) lead to decidable (reachability) problems. However, the discrete transitions of o-minimal automata require constant resets of the con...

We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuous dynamics. A number of analysis problems, such as reachability testing and controller synthesis, are decidable for classes of ominimal hybrid automata. We generalize existing decidability results for controller synthesis on h...

Hybrid automata are well-studied formal models for dynamical systems. However, the analysis of hybrid automata is extremely difficult, and even state-of-the-art tools can only analyze systems with few continuous variables and simple dynamics. Because the reachability problem for general hybrid automata is undecidable, we give a path-oriented reachability analysis procedure for a class of nonlin...

We study reversible quantum cellular automata with the restriction that these are also Clifford operations. This means that tensor products of Pauli operators (or discrete Weyl operators) are mapped to tensor products of Pauli operators. Therefore Clifford quantum cellular automata are induced by symplectic cellular automata in phase space. We characterize these symplectic cellular automata and...

Polygonal hybrid systems are a subclass of planar hybrid automata which can be represented by piecewise constant differential inclusions. One way of analysing such systems (and hybrid systems in general) is through the study of their phase portrait, which characterise the systems’ qualitative behaviour. In this paper we identify and compute an important object of polygonal hybrid systems’ phase...

We introduce the framework of hybrid automata as a model and speci cation language for hybrid systems. Hybrid automata can be viewed as a generalization of timed automata, in which the behavior of variables is governed in each state by a set of di erential equations. We show that many of the examples considered in the workshop can be de ned by hybrid automata. While the reachability problem is ...

the main goal of the present study was to implement a hybrid pattern of cellular automata model and particle swarm optimization algorithm based on tm and etm+ imagery of landsat satellite from 1988 to 2010 for simulating the urban sprawling. in this study, an alternative model was implemented in two ways: the first method was based on two images (1988 and 2010) and the second one was based on t...

optimizing the database queries is one of hard research problems. exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. the use of evolutionary methods, beca...

In this paper we investigate the stability of hybrid systems in closed-loop with Model Predictive Controllers (MPC) and we derive a priori sufficient conditions for Lyapunov asymptotic stability and exponential stability. A general theory is presented which proves that Lyapunov stability is achieved for both terminal cost and constraint set and terminal equality constraint hybrid MPC, even thou...