We investigate the connections between the process algebra for hybrid systems of Bergstra and Middelburg and the formalism of hybrid automata of Henzinger et al. We give interpretations of hybrid automata in the process algebra for hybrid systems and compare them with the standard interpretation of hybrid automata as timed transition systems. We also relate the synchronized product operator on ...

Polygonal hybrid systems are a subclass of planar hybrid automata which can be represented by piecewise constant differential inclusions. Here, we identify and compute an important object of such systems’ phase portrait, namely invariance kernels. An invariant set is a set of initial points of trajectories which keep rotating in a cycle forever and the invariance kernel is the largest of such s...

Verification algorithms for networks of nonlinear hybrid automata (HA) can aid us understand and control biological processes such as cardiac arrhythmia, formation of memory, and genetic regulation. We present an algorithm for over-approximating reach sets of networks of nonlinear HA which can be used for sound and relatively complete invariant checking. First, it uses automatically computed in...

It is shown that a trivial version of polarization is sufficient to produce separating systems of polynomial invariants: if two points in the direct sum of the G–modules W and m copies of V can be separated by polynomial invariants, then they can be separated by invariants depending only on ≤ 2 dim(V ) variables of type V ; when G is reductive, invariants depending only on ≤ dim(V ) + 1 variabl...

This paper proposes a fast robust model predictive control using polyhedral invariant sets for uncertain polytopic discrete-time systems. A sequence of nested polyhedral invariant sets corresponding to a sequence of state feedback gains is constructed off-line. Thus, most of the computational burdens are moved off-line. At each sampling time, when the measured state lies between two adjacent po...

Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to represent the whole set of solutions of complex linear constraints combining both integral and real variables. In this paper, the closed convex hull of arithmetic automata is proved rational polyhedral. Moreover an algorithm comp...

We start by introducing a notion of hybrid automata with a clear identiication of the signature component. Hybrid automata intermix discrete and continuous behavior, extending non-deterministic automata with attributes that evolve continuously with time according to evolution laws. Adopting a categorial approach to aggregating and interconnecting hybrid automata we look at a suitable deenition ...

A hybrid automaton is a model of a system with interacting continuous and discrete dynamics. It has been successfully employed in emerging applications on the border between computer science and control theory. In this paper, hybrid automata are formally introduced. Some results on existence and uniqueness of executions for hybrid automata are obtained. Continuous dependence on initial states a...

Let P be a polyhedron in H$ of finite volume such that the group Γ(P) generated by reflections in the faces of P is a discrete subgroup of IsomH$. Let Γ+(P) denote the subgroup of index 2 consisting entirely of orientation-preserving isometries so that Γ+(P) is a Kleinian group of finite covolume. Γ+(P) is called a polyhedral group. As discussed in [12] and [13] for example (see §2 below), asso...

The framework of Hybrid automata—introduced by Alur, Courcourbetis, Henzinger, and Ho—provides a formal modeling and analysis environment to analyze the interaction between the discrete and the continuous parts of hybrid systems. Hybrid automata can be considered as generalizations of finite state automata augmented with a finite set of real-valued variables whose dynamics in each state is gove...