Home // ICONS 2016, The Eleventh International Conference on Systems // View article

Proving Transformation Correctness of Refactorings for Discrete and Continuous Simulink Models

Authors:
Sebastian Schlesinger
Paula Herber
Thomas Göthel
Sabine Glesner

Keywords: formal verification; transformation correctness; refactoring; MATLAB/Simulink; approximate bisimulation

Abstract:
MATLAB/Simulink is a state-of-the-art tool for model-driven engineering of embedded systems. Simulink enables engineers to model continuous and discrete parts of a system together in hybrid models. In such models, complexity reduction via refactoring plays an important role. However, formal verification of the equivalence between a hybrid Simulink model and its refactored counterpart is still an open problem. One challenge is that for many refactorings, equivalent behaviour can only be shown to be `close' to each other rather than being the `same'. To solve this problem, we propose a methodology to show behavioural equivalence based on approximate bisimulation. Our main contributions are a sound abstract representation for Simulink models that serves as a basis for proving equivalence, that we adapt the concept of approximate bisimulations to the operational Simulink semantics, and a methodology that enables the designer to prove transformation correctness. Our approach is applicable to both discrete and continuous Simulink models. With that, we provide an ideal starting point for the verification of hybrid models that integrate discrete and continuous model parts.

Pages: 45 to 50

Copyright: Copyright (c) IARIA, 2016

Publication date: February 21, 2016

Published in: conference

ISSN: 2308-4243

ISBN: 978-1-61208-451-0

Location: Lisbon, Portugal

Dates: from February 21, 2016 to February 25, 2016