Departmental Papers (CIS)

Date of this Version

4-3-2007

Document Type

Conference Paper

Comments

From the 10th International Workshop, HSCC 2007, Pisa, Italy, April 3-5, 2007.

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.

Subject Area

CPS Real-Time, CPS Embedded Control

Publication Source

Lecture Notes in Computer Science: Hybrid Systems: Computation and Control

Volume

4416

Start Page

601

Last Page

613

DOI

10.1007/978-3-540-71493-4_46

Copyright/Permission Statement

The original publication is available at www.springerlink.com

Share

COinS
 

Date Posted: 27 June 2012