We investigate the connections between the process algebra for hybrid systems of Bergstra and Middelburg and the formalism of\ud 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 hybrid\ud automata to the parallel composition operator of the process algebra. It turns out that the formalism of hybrid automata matches a fragment of the process algebra for hybrid systems closely. We present an adaptation of the formalism of hybrid automata that yields an exact match
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.