| | |
Summary: Automata Based Interfaces for
Control and Scheduling
Gera Weiss and Rajeev Alur
University of Pennsylvania
{gera,alur}@seas.upenn.edu
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 flex-
ible than the classical real-time scheduling framework based on periodic
tasks, and allows composition of interfaces by language-theoretic opera-
tions. 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.
1 Introduction
Modern software engineering heavily relies on clearly specified interfaces for sepa-
ration of concerns among designers implementing components and programmers
using those components. The interface of a component describes the function-
ality and constraints on the correct usage in a succinct manner. For example,
the interface of a Java class describes all the methods it supports, along with
the types of input and output parameters for each method, and client code is
|
