Temporal Boundary Analysis on Startup Algorithm for Time-Triggered Architecture with Bus Topology

DOI

10.2991/aeecs-18.2018.48How to use a DOI?

Keywords

time-triggered architecture, startup algorithm, temporal boundary analysis, arbitrary nodes.

Abstract

The Time-triggered Architecture (TTA) is seen as a widely-recognized design framework for the domain of large distributed embedded real-time systems. This paper derives an elaborated startup scheme and discusses the temporal boundary of it for real-time systems based on TTA, which normally require predictable communication in TDMA environments. The scheme presents an arrival time window (ATW) with a dedicated lower time boundary for contention resolution during startup phase without detecting collisions directly. Although many previous model checking approaches have been taken for analyzing the temporal attributes of the startup algorithm, it is hard to model the startup scenario at arbitrary number of nodes and arbitrary propagation between them. This paper gives the upper boundary of startup time for systems based on TTA with arbitrary number of nodes towards the dedicated startup scheme by formal deduction.

Copyright

© 2018, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Bao-yue Yan
AU  - Xiang Long
AU  - Mu Li
PY  - 2018/03
DA  - 2018/03
TI  - Temporal Boundary Analysis on Startup Algorithm for Time-Triggered Architecture with Bus Topology
BT  - Proceedings of the 2018 2nd International Conference on Advances in Energy, Environment and Chemical Science (AEECS 2018)
PB  - Atlantis Press
SP  - 285
EP  - 291
SN  - 2352-5401
UR  - https://doi.org/10.2991/aeecs-18.2018.48
DO  - 10.2991/aeecs-18.2018.48
ID  - Yan2018/03
ER  -