Formalization and Refinement Proof for Embedded Systems

Asma Bezza, Elkamel Merah, Rabea Ameur-Boulifa, Rohallah Benaboud, Toufik Messaoud Maarouk

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This article deals with the verification of refinement of embedded systems. It's about demonstrating the correctness of the refinement engendered by transformations written in Pomset. This will allow, thereafter, the design of correct systems by construction. The principle of our formal verification approach of refinement is to benefit from the power of transition system for the formal verification. For that, we propose an algorithm allowing the passage from Pomsets to Labelled Transition system (LTS), on which we can apply algorithms of formal verification of refinement which already exist. Then, we validate our approach, applying it to the communication refinement transformation.

Original languageEnglish
Title of host publicationISIA 2020 - Proceedings, 4th International Symposium on Informatics and its Applications
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781728196527
DOIs
Publication statusPublished - 15 Dec 2020
Externally publishedYes
Event4th International Symposium on Informatics and its Applications, ISIA 2020 - M'sila, Algeria
Duration: 15 Dec 202016 Dec 2020

Publication series

NameISIA 2020 - Proceedings, 4th International Symposium on Informatics and its Applications

Conference

Conference4th International Symposium on Informatics and its Applications, ISIA 2020
Country/TerritoryAlgeria
CityM'sila
Period15/12/2016/12/20

Keywords

  • Formal Methods
  • Labelled Transition System (LTS)
  • Pomset
  • Proof
  • Refinement

Fingerprint

Dive into the research topics of 'Formalization and Refinement Proof for Embedded Systems'. Together they form a unique fingerprint.

Cite this