Research output: Chapter in Book/Report/Conference proceeding › Chapter (peer-reviewed)

**Hybrid Relations in Isabelle/UTP.** / Foster, Simon David.

Research output: Chapter in Book/Report/Conference proceeding › Chapter (peer-reviewed)

Foster, SD 2019, Hybrid Relations in Isabelle/UTP. in *7th International Symposium on Unifying Theories of Programming (UTP).* Lecture Notes in Computer Science, Springer.

Foster, S. D. (Accepted/In press). Hybrid Relations in Isabelle/UTP. In *7th International Symposium on Unifying Theories of Programming (UTP) *(Lecture Notes in Computer Science). Springer.

Foster SD. Hybrid Relations in Isabelle/UTP. In 7th International Symposium on Unifying Theories of Programming (UTP). Springer. 2019. (Lecture Notes in Computer Science).

@inbook{acb86a0b0f3a491eb071f123b2066da4,

title = "Hybrid Relations in Isabelle/UTP",

abstract = "We describe our UTP theory of hybrid relations, which extends the relational calculus with continuous variables and differential equations. This enables the use of UTP in modelling and verification of hybrid systems, supported by our mechanisation in Isabelle/UTP. The hybrid relational calculus is built upon the same foundation as the UTP’s theory of reactive processes, which is accomplished through a generalised trace algebra and a model of piecewise-continuous functions. From this foundation, we give semantics to hybrid programs, including ordinary differential equations and preemption, and show how the theory can be used to reason about sequential hybrid systems.",

author = "Foster, {Simon David}",

year = "2019",

month = "7",

day = "12",

language = "English",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

booktitle = "7th International Symposium on Unifying Theories of Programming (UTP)",

}

TY - CHAP

T1 - Hybrid Relations in Isabelle/UTP

AU - Foster, Simon David

PY - 2019/7/12

Y1 - 2019/7/12

N2 - We describe our UTP theory of hybrid relations, which extends the relational calculus with continuous variables and differential equations. This enables the use of UTP in modelling and verification of hybrid systems, supported by our mechanisation in Isabelle/UTP. The hybrid relational calculus is built upon the same foundation as the UTP’s theory of reactive processes, which is accomplished through a generalised trace algebra and a model of piecewise-continuous functions. From this foundation, we give semantics to hybrid programs, including ordinary differential equations and preemption, and show how the theory can be used to reason about sequential hybrid systems.

AB - We describe our UTP theory of hybrid relations, which extends the relational calculus with continuous variables and differential equations. This enables the use of UTP in modelling and verification of hybrid systems, supported by our mechanisation in Isabelle/UTP. The hybrid relational calculus is built upon the same foundation as the UTP’s theory of reactive processes, which is accomplished through a generalised trace algebra and a model of piecewise-continuous functions. From this foundation, we give semantics to hybrid programs, including ordinary differential equations and preemption, and show how the theory can be used to reason about sequential hybrid systems.

M3 - Chapter (peer-reviewed)

T3 - Lecture Notes in Computer Science

BT - 7th International Symposium on Unifying Theories of Programming (UTP)

PB - Springer

ER -