Automata based interfaces for control and scheduling

  • Authors:
  • Gera Weiss;Rajeev Alur

  • Affiliations:
  • University of Pennsylvania;University of Pennsylvania

  • Venue:
  • HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose the use of formal languages of infinite words over the alphabet of task identifiers as an interface between control designs and software implementations. We argue that this approach is more flexible than the classical real-time scheduling framework based on periodic tasks, and allows composition of interfaces by language-theoretic operations. We show that finite automata over infinite words offer analyzable representation and can capture many interesting interface specifications such as exponential stability of switched linear systems.