We propose a new hybrid automaton model that is capable of describing both continuous and discrete behavior. The model, which extends the timed automaton model of [33, 42] and the phase transition system models of [36, 2] , allows communication among components using both shared variables and shared actions. The main contributions of this paper are: (1) a definition of hybrid automata and of an implementation relation based on hybrid traces, (2) a definition of a simulation between hybrid automata and a proof that existence of a simulation implies the implementation relation, (3) a definition of composition and hiding operations on hybrid automata and a proof that these operations respect the implementation relation, (4) a definition of hybrid I/O automata, which specialize hybrid automata by an additional distinction between input and output, and a proof that the results on simulation relations, composition and hiding carry over to this new setting, and (5) a definition of receptiveness for hybrid I/O automata and a proof that, assuming certain compatibility conditions, receptiveness is preserved by composition.
I/O hybrid automata REF is an extension of hybrid automata with explicit inputs and outputs.
Hybrid I/O Automata
Computer Science