|
Title
|
|
|
|
Towards the verification of hybrid co-simulation algorithms
| |
|
Author
|
|
|
|
| |
|
Abstract
|
|
|
|
| Engineering modern systems is becoming increasingly difficult due to the heterogeneity between different subsystems. Modelling and simulation techniques have traditionally been used to tackle complexity, but with increasing heterogeneity of the subsystems, it becomes impossible to find appropriate modelling languages and tools to specify and analyse the system as a whole. Co-simulation is a technique to combine multiple models and their simulators in order to analyse the behaviour of the whole system over time. Past research, however, has shown that the naïve combination of simulators can easily lead to incorrect simulation results, especially when co-simulating hybrid systems. This paper shows: (i) how co-simulation of a family of hybrid systems can fail to reproduce the order of events that should have occurred (event ordering); (ii) how to prove that a co-simulation algorithm is correct (w.r.t. event ordering), and if it is incorrect, how to obtain a counterexample; and (iii) how to correct an incorrect co-simulation algorithm. We apply the above method to two well known co-simulation algorithms used with the FMI Standard, and we show that one of them is incorrect for the family of hybrid systems under study, under the restrictions of the standard. The conclusion is that either the standard needs to be revised, or one of the algorithms should be avoided. |
| |
|
Language
|
|
|
|
English
| |
|
Source (journal)
|
|
|
|
Lecture notes in computer science. - Berlin, 1973, currens
| |
|
Source (book)
|
|
|
|
Software Technologies: Applications and Foundations
| |
|
Publication
|
|
|
|
Berlin
:
2018
| |
|
ISSN
|
|
|
|
0302-9743
[print]
1611-3349
[online]
| |
|
ISBN
|
|
|
|
978-3-030-04770-2
| |
|
DOI
|
|
|
|
10.1007/978-3-030-04771-9_1
| |
|
Volume/pages
|
|
|
|
11176
(2018)
, p. 5-20
| |
|
Full text (Publisher's DOI)
|
|
|
|
| |
|
Full text (open access)
|
|
|
|
| |
|