Automata Based Interfaces for Control and Scheduling

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.

• Type: Conference
• Year: 2007
• Where: HYBRID
• Authors: Gera Weiss, Rajeev Alur
• Keywords: Classical Real-time Scheduling, HYBRID 2007, Hybrid Systems, Interesting Interface Specifications, Infinite Words