Timing analysis of the ARINC 629 databus for real-time applications

Audsley, Neil; Grigg, Alan

doi:10.1016/s0141-9331(97)00020-3

Cited by 11 publications

(8 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These solutions are not portable from one tool to another from different vendors because there are not covered by the standard and each vendor may choose a different approach. Also, the requirement specific to the avionics industry of using a scheduler [8] makes the handling of periodicity by the abstract layer useless by definition. The implementation at the concrete layer requires dispatching messages arriving through the triSend() method to the appropriate message type data buffer that is then used by the scheduler as shown on Fig.…”

Section: Fig 5 Separation Of Concerns For Receiving Periodic Messagesmentioning

confidence: 99%

Challenges of Testing Periodic Messages in Avionics Systems Using TTCN-3

Stepien

Peyton

2013

Testing Software and Systems

View full text Add to dashboard Cite

Abstract. The TTCN-3 language was conceived initially for testing telecommunications protocols that consist of sequences of discrete messages between communicating entities. TTCN-3 has a clear model of separation of concerns between an abstract layer, where test behavior is specified, and a concrete layer, where messages are encoded / decoded and sent and received to/from the system under test. This model, however, is cumbersome for testing protocols with periodic messages as used in avionics systems. This paper presents an innovative approach to addressing issues involving periodic messages in TTCN-3, based on our experiences working with avionics systems. Extensions to the TTCN-3 standard are proposed, based on our approach. We also demonstrate how the approach can be used for test system certification and requirements verification for avionics systems.

show abstract

Section: Fig 5 Separation Of Concerns For Receiving Periodic Messagesmentioning

confidence: 99%

Challenges of Testing Periodic Messages in Avionics Systems Using TTCN-3

Stepien

Peyton

2013

Testing Software and Systems

View full text Add to dashboard Cite

show abstract

“…This is carried-out in many analyses such as [10]- [12]. Inspired by this, and the technique proposed in [8] to avoid situations where previous analysis would be optimistic, we can compute of a message stream considering that nodes never skip slots by reasoning as follows.…”

Section: A Queuing Time Equationmentioning

confidence: 99%

“…It is difficult however to compute , so instead we find such that . Based on this, we can state that Combining these equations gives us (12) at the bottom of the page.…”

Section: B Determining the Number Of Skipped Slotsmentioning

confidence: 99%

“…Nodes are given time slots in a pre-specified order; they have a terminal gap (TG) specifying an idle time interval between nodes (similar to our ) and they permit slot skipping. Unfortunately, the only available analysis of ARINC 629 [12] is not accurate in the sense that it does neither take into account effects like the and the , nor the local scheduling of output queues.…”

Section: E Numerical Examplementioning

confidence: 99%

See 1 more Smart Citation

Analyzing TDMA With Slot Skipping

Andersson

Pereira

Tovar

2008

IEEE Trans. Ind. Inf.

View full text Add to dashboard Cite

Distributed real-time systems, such as factory automation systems, require that computer nodes communicate with a known and low bound on the communication delay. This can be achieved with traditional time division multiple access (TDMA). But improved flexibility and simpler upgrades are possible through the use of TDMA with slot-skipping (TDMA/SS), meaning that a slot is skipped whenever it is not used and consequently the slot after the skipped slot starts earlier. We propose a schedulability analysis for TDMA/SS. We assume knowledge of all message streams in the system, and that each node schedules messages in its output queue according to deadline monotonic. Firstly, we present a non-exact (but fast) analysis and then, at the cost of computation time, we also present an algorithm that computes exact queuing times.

show abstract

“…The problem of synthesizing timeouts as continuous parameters has been studied in variety of engineering contexts such as vehicle communication systems [25] and avionic subsystems [3,36]. To the best of our knowledge, no generic framework for synthesis of timeouts in stochastic continuous-time systems has been developed so far.…”

Section: Introductionmentioning

confidence: 99%

Optimizing Performance of Continuous-Time Stochastic Systems Using Timeout Synthesis

Brázdil

KorenăźIak

Krăźál

et al. 2015

Quantitative Evaluation of Systems

View full text Add to dashboard Cite

Abstract. We consider parametric version of fixed-delay continuous-time Markov chains (or equivalently deterministic and stochastic Petri nets, DSPN) where fixeddelay transitions are specified by parameters, rather than concrete values. Our goal is to synthesize values of these parameters that, for a given cost function, minimize expected total cost incurred before reaching a given set of target states. We show that under mild assumptions, optimal values of parameters can be effectively approximated using translation to a Markov decision process (MDP) whose actions correspond to discretized values of these parameters. To this end we identify and overcome several interesting phenomena arising in systems with fixed delays.

show abstract

Timing analysis of the ARINC 629 databus for real-time applications

Cited by 11 publications

References 1 publication

Challenges of Testing Periodic Messages in Avionics Systems Using TTCN-3

Challenges of Testing Periodic Messages in Avionics Systems Using TTCN-3

Analyzing TDMA With Slot Skipping

Optimizing Performance of Continuous-Time Stochastic Systems Using Timeout Synthesis

Contact Info

Product

Resources

About