Computing the exact worst-case End-to-end delays in a Spacewire network using Timed Automata

Abstract : Spacewire is a real-time communication network for use onboard satellites. It has been designed to transmit both payload and control/command data. To guarantee that communications respect the real-time constraints, designers use tools to compute the worst-case end-to-end delays. Among these tools, recursive flow analysis and Network Calculus approaches have been studied. This paper proposes to use the model-checking approach based on timed automata to compute the exact worstcase end-to-end delays and two case studies are presented.
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01228709
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Friday, November 13, 2015 - 4:00:26 PM
Last modification on : Thursday, June 27, 2019 - 4:27:48 PM
Long-term archiving on : Friday, April 28, 2017 - 5:07:52 PM

File

ermont_12637.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01228709, version 1
  • OATAO : 12637

Collections

Citation

Jérôme Ermont, Christian Fraboul. Computing the exact worst-case End-to-end delays in a Spacewire network using Timed Automata. 19th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2013), Apr 2013, Philadelphie, PA, United States. pp. 5-8. ⟨hal-01228709⟩

Share

Metrics

Record views

85

Files downloads

65