TY - JOUR
T1 - Linearization of hybrid processes
AU - Brand, van den, P.C.W.
AU - Reniers, M.A.
AU - Cuijpers, P.J.L.
PY - 2006
Y1 - 2006
N2 - HyPA is a formalism that is suitable for the algebraic analysis of hybrid systems, i.e., systems with continuous (physical) as well as discrete (computational) components. Linearization is a useful first step in this analysis, because it reduces the complexity of model descriptions by transforming them into so-called linear form. We present an algorithm for the linearization of hybrid processes modeled in a subset of hybrid process algebra (HyPA) and prove its correctness. This algorithm is able to linearize most HyPA constructs, except recursive parallelism, the empty process, and disrupts that are not a flow prefix. We also extend HyPA with an abstraction operator, which is used in the linearization algorithm.
AB - HyPA is a formalism that is suitable for the algebraic analysis of hybrid systems, i.e., systems with continuous (physical) as well as discrete (computational) components. Linearization is a useful first step in this analysis, because it reduces the complexity of model descriptions by transforming them into so-called linear form. We present an algorithm for the linearization of hybrid processes modeled in a subset of hybrid process algebra (HyPA) and prove its correctness. This algorithm is able to linearize most HyPA constructs, except recursive parallelism, the empty process, and disrupts that are not a flow prefix. We also extend HyPA with an abstraction operator, which is used in the linearization algorithm.
U2 - 10.1016/j.jlap.2005.10.003
DO - 10.1016/j.jlap.2005.10.003
M3 - Article
VL - 68
SP - 54
EP - 104
JO - Journal of Logic and Algebraic Programming
JF - Journal of Logic and Algebraic Programming
SN - 1567-8326
IS - 1-2
ER -