@inproceedings{de91a136af2a4d509f6aa2b8c15aa6ec,
title = "Embeddings of hybrid automata in process algebra",
abstract = "We study the expressive power of two modelling formalisms, viz. hybrid automata and µCRL t . The automaton based language of hybrid automata is a popular formalism that is used for describing and analysing the behaviours of hybrid systems. The process algebraic language µCRL t is designed for specifying real-time and data-dependent systems and to reason about such systems. We show that every hybrid automaton can be translated to a µCRL t expression without loss of information, i.e. the translation is equivalence preserving. This proves that µCRL t is at least as expressive as the modelling language of hybrid automata. Subsequently, we extend the standard model of a hybrid automaton to deal with communications via shared continuous variables. We show that the resulting enhanced hybrid automata can also be embedded in µCRL t .",
author = "T.A.C. Willemse",
year = "2004",
doi = "10.1007/978-3-540-24756-2_19",
language = "English",
isbn = "3-540-21377-5",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "343--362",
editor = "E. Boiten and J. Derrick and G. Smith",
booktitle = "Integrated Formal Methods (Proceedings IFM 2004, Canterbury, UK, April 4-7, 2004)",
address = "Germany",
}