Hybrid process algebra

We develop an algebraic theory, called hybrid process algebra (HyPA), for the description and analysis of hybrid systems. HyPA is an extension of the process algebra ACP, with the disrupt operator from LOTOS and with flow clauses and re-initialization clauses for the description of continuous behavior and discontinuities. The semantics of HyPA is defined by means of deduction rules that associate a hybrid transition system with each process term. A large set of axioms is presented for a notion of bisimilarity. HyPA may be regarded as an algebraic approach to hybrid automata, although the specific semantics of re-initialization clauses makes HyPA a little more expressive.