SAL-Based Symbolic Scheduling in Time-Triggered Networks

  • Authors:
  • Sebastian Voss;Maria Sorea;Klaus Echtle

  • Affiliations:
  • EADS Innovation Works, Munich, Germany;EADS Innovation Works, Munich, Germany;University of Duisburg-Essen, Essen, Germany

  • Venue:
  • IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a novel approach for combined task and message scheduling for TDM-based avionics applications that allows to automatically compute schedules with minimal end-to-end latency. Our approach relies on a symbolic encoding of the scheduling problem. The symbolic encoding is done by constructing gradually a schedule beginning in a state where no task has started and no messages have been sent on the bus yet, and proceeding one step at a time assigning starting times to tasks and slot positions to messages. We use the SAL toolset from SRI for our experiments. Experimental results demonstrate how the latest generation of model-checking tools meet the challenges of providing both a convenient modeling language and the performance to solve given scheduling problems.