Verification of Compositional Frameworks in Coq

Pieter Collins; Bastiaan Laarakker; Sacha Sindorf

doi:10.1016/j.ifacol.2024.10.179

Verification of Compositional Frameworks in Coq

Pieter Collins^*, Bastiaan Laarakker^*, Sacha Sindorf^*

^*Corresponding author for this work

Research output: Contribution to journal › Conference article in journal › Academic › peer-review

Abstract

In this paper we aim to verify in Coq basic properties of compositional behavioural frameworks for dynamic systems. We analyse systems by their external behaviour rather than a state space model, and use the parallel composition operator to build complex systems from simpler subsystems. It is important that the composition is well-defined and avoids undesirable behaviour such as deadlocks. To ensure the our framework is correct, we formulate and prove the results in the proof assistant Coq. We consider discrete-time deterministic systems and timed-event systems, with a view to eventually proving results on a framework for hybrid systems.

Original language	English
Pages (from-to)	262-267
Number of pages	6
Journal	IFAC-PapersOnLine
Volume	58
Issue number	17
DOIs	https://doi.org/10.1016/j.ifacol.2024.10.179
Publication status	Published - 1 Aug 2024
Event	26th International Symposium on Mathematical Theory of Networks and Systems - University of Cambridge, Cambridge, United Kingdom Duration: 19 Aug 2024 → 23 Aug 2024 Conference number: 26th https://mtns2024.eng.cam.ac.uk/

Keywords

behaviour
causality
Composition
proof assistants

Access to Document

10.1016/j.ifacol.2024.10.179Licence: CC BY-NC-ND

Cite this

@article{42a7bca645eb4fb8a09a994cf39b93a4,

title = "Verification of Compositional Frameworks in Coq",

abstract = "In this paper we aim to verify in Coq basic properties of compositional behavioural frameworks for dynamic systems. We analyse systems by their external behaviour rather than a state space model, and use the parallel composition operator to build complex systems from simpler subsystems. It is important that the composition is well-defined and avoids undesirable behaviour such as deadlocks. To ensure the our framework is correct, we formulate and prove the results in the proof assistant Coq. We consider discrete-time deterministic systems and timed-event systems, with a view to eventually proving results on a framework for hybrid systems.",

keywords = "behaviour, causality, Composition, proof assistants",

author = "Pieter Collins and Bastiaan Laarakker and Sacha Sindorf",

note = "Publisher Copyright: Copyright {\textcopyright} 2024 The Authors.; 26th International Symposium on Mathematical Theory of Networks and Systems, MTNS 2024 ; Conference date: 19-08-2024 Through 23-08-2024",

year = "2024",

month = aug,

day = "1",

doi = "10.1016/j.ifacol.2024.10.179",

language = "English",

volume = "58",

pages = "262--267",

journal = "IFAC-PapersOnLine",

issn = "2405-8963",

publisher = "IFAC Secretariat",

number = "17",

url = "https://mtns2024.eng.cam.ac.uk/",

}

TY - JOUR

T1 - Verification of Compositional Frameworks in Coq

AU - Collins, Pieter

AU - Laarakker, Bastiaan

AU - Sindorf, Sacha

N1 - Conference code: 26th

PY - 2024/8/1

Y1 - 2024/8/1

N2 - In this paper we aim to verify in Coq basic properties of compositional behavioural frameworks for dynamic systems. We analyse systems by their external behaviour rather than a state space model, and use the parallel composition operator to build complex systems from simpler subsystems. It is important that the composition is well-defined and avoids undesirable behaviour such as deadlocks. To ensure the our framework is correct, we formulate and prove the results in the proof assistant Coq. We consider discrete-time deterministic systems and timed-event systems, with a view to eventually proving results on a framework for hybrid systems.

AB - In this paper we aim to verify in Coq basic properties of compositional behavioural frameworks for dynamic systems. We analyse systems by their external behaviour rather than a state space model, and use the parallel composition operator to build complex systems from simpler subsystems. It is important that the composition is well-defined and avoids undesirable behaviour such as deadlocks. To ensure the our framework is correct, we formulate and prove the results in the proof assistant Coq. We consider discrete-time deterministic systems and timed-event systems, with a view to eventually proving results on a framework for hybrid systems.

KW - behaviour

KW - causality

KW - Composition

KW - proof assistants

U2 - 10.1016/j.ifacol.2024.10.179

DO - 10.1016/j.ifacol.2024.10.179

M3 - Conference article in journal

SN - 2405-8963

VL - 58

SP - 262

EP - 267

JO - IFAC-PapersOnLine

JF - IFAC-PapersOnLine

IS - 17

T2 - 26th International Symposium on Mathematical Theory of Networks and Systems

Y2 - 19 August 2024 through 23 August 2024

ER -

Verification of Compositional Frameworks in Coq

Abstract

Keywords

Access to Document

Fingerprint

Cite this