The hybrid χ (Chi) formalism is suited to modeling, simulation and verification of hybrid systems. It integrates concepts from dynamics and control theory with concepts from computer science, in particular from process algebra and hybrid automata. In this paper, we first provide an overview of χ. Then, the χ formalism is related to other formalisms by means of translation schemes: a translation...

The unifying theme of my research is discrete and polyhedral geometry, especially its applications to representation theory, geometric invariant theory, and algebraic combinatorics. Researchers in these fields have found the tools of polyhedral geometry to be very rewarding in recent decades. On the one hand, polyhedral methods have yielded significant results in both theoretical and algorithmi...

Abs t r ac t . We propose a new hybrid I/O automaton model that is capable of describing both continuous and discrete behavior. The model, which extends the timed I /O automaton model of [12, 7] and the phase transition system models of [15, 2], allows communication among components using both shared variables and shared actions. The main contributions of this paper are: (1) the definition of h...

Hybrid systems combine continuous and discrete behavior. Hybrid Automata are a powerful formalism for the modeling and verification of such systems. A common problem in hybrid system verification is the good parameters problem, which consists in identifying a subset of parameters which guarantee a certain behavior of a system. Recently, a method has been presented for attacking this problem for...

We propose a new hybrid I/O automaton model that is capable of describing both continuous and discrete behavior. The model, which extends the timed I/O automaton model of 12, 7] and the phase transition system models of 15, 2], allows communication among components using both shared variables and shared actions. The main contributions of this paper are: (1) the deenition of hybrid I/O automata ...

Over-approximating the set of all reachable states of a given system is an important task for the verification of safety properties. Such an unbounded time verification is in particular challenging for hybrid systems. We recently developed an algorithm that over-approximates the set of all reachable states of a given affine hybrid automata by performing linear template-based abstract interpreta...

Hybrid automata have been introduced in both control engineering and computer science as a formal model for the dynamics of hybrid discrete-continuous systems. In the case of so-called linear hybrid automata this formalization supports semi-decision procedures for state reachability, yet no decision procedures due to inherent undecid-ability 4]. Thus, unlike nite or timed automata, already line...

This contribution aims to combine hybrid automata with CSP establishing a connection between the elements of hybrid automata and CSP processes using an approach for the decomposition of hybrid systems. As a result we obtain a transformation from hybrid automata into CSP processes, written in Hoare-CSP in the untimed parts and in real-time CSP or HCSP in the timed parts. These processes provide ...

A mathematical correctness analysis is given for a simple controlled vehicle acceleration maneuver in which the vehicle's response to controller inputs is subject to some uncertainty. The maneuver is modelled using hybrid (continuous/discrete) input/output automata. The analysis uses invariant assertion and levels of abstraction techniques. Levels of abstraction are used (a) to express the rela...