Linearization of hybrid processes

P.C.W. Brand, van den, M.A. Reniers, P.J.L. Cuijpers

Research output: Contribution to journalArticleAcademicpeer-review

11 Citations (Scopus)
2 Downloads (Pure)

Abstract

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.
Original languageEnglish
Pages (from-to)54-104
JournalJournal of Logic and Algebraic Programming
Volume68
Issue number1-2
DOIs
Publication statusPublished - 2006

Fingerprint

Dive into the research topics of 'Linearization of hybrid processes'. Together they form a unique fingerprint.

Cite this