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

摘要

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.