An improved timed automata model for computing exact worst-case delays of AFDX periodic flows

Author

Adnan, Muhammad ; Scharbarg, Jean-Luc ; Ermont, Jérôme ; Fraboul, Christian

Author_Institution

ENSEEIHT, Univ. de Toulouse, Toulouse, France

fYear

2011

fDate

5-9 Sept. 2011

Firstpage

1

Lastpage

4

Abstract

In Avionics Switched Ethernet network (AFDX), guarantees on worst-case end-to-end (E2E) communication delays are obtained thanks to safe upper bounds computed by Network Calculus and Trajectory Approaches. Up to now, the computation of an exact worst-case delay is intractable, except for very small configurations. This paper proposes a modified timed automata approach which increases the size of the configuration for which an exact worst-case can be obtained. This is achieved thanks to a drastic reduction of the search space.

Keywords

automata theory; delays; local area networks; real-time systems; AFDX periodic flow; avionics switched Ethernet network; network calculus; timed automata model; trajectory approach; worst-case end-to-end communication delay; Aerospace electronics; Analytical models; Automata; Clocks; Computational modeling; Delay; Upper bound; AFDX network; Timed Automata; UPPAAL Modelling; Worst case delay analysis;

fLanguage

English

Publisher

ieee

Conference_Titel

Emerging Technologies & Factory Automation (ETFA), 2011 IEEE 16th Conference on

Conference_Location

Toulouse

ISSN

1946-0740

Print_ISBN

978-1-4577-0017-0

Electronic_ISBN

1946-0740

Type

conf

DOI

10.1109/ETFA.2011.6059162

Filename

6059162