Automated Conflict-Free Concurrent Implementation of Timed Component-Based Models

Correct implementation of concurrent real-time systems has always been a tedious task due to their inherent complex structure; concurrency introduces a great deal of non-determinism, which can potentially conflict with meeting timing constraints. In this paper, we focus on model-based concurrent imp...

Full description

Saved in:
Bibliographic Details
Published inNASA Formal Methods pp. 359 - 374
Main Authors Triki, Ahlem, Bonakdarpour, Borzoo, Combaz, Jacques, Bensalem, Saddek
Format Book Chapter
LanguageEnglish
Published Cham Springer International Publishing 2015
SeriesLecture Notes in Computer Science
Subjects
Online AccessGet full text
ISBN3319175238
9783319175232
ISSN0302-9743
1611-3349
DOI10.1007/978-3-319-17524-9_25

Cover

Loading…
More Information
Summary:Correct implementation of concurrent real-time systems has always been a tedious task due to their inherent complex structure; concurrency introduces a great deal of non-determinism, which can potentially conflict with meeting timing constraints. In this paper, we focus on model-based concurrent implementation of timed models. Our abstract models consist of a set of components interacting with each other using multi-party interactions. Each component is internally subject to a set of timing constraints. We propose a chain of transformations that starts with an abstract model as input and generates correct-by-construction executable code as output. We show that all transformed models are observationally equivalent to the abstract model through bisimulation proofs and, hence, all functional properties of the abstract model are preserved. To facilitate developing the proofs of correctness, each transformation obtains a model by incorporating a subset of physical constraints (e.g., type of communication and global clock synchronization)
Bibliography:This research was partially funded by projects Artemis AIPP Arrowhead and French BGLE Manycorelabs.
ISBN:3319175238
9783319175232
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-319-17524-9_25