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.

[1]  L. Gurvits.  Stability of discrete linear inclusion , 1995 .

[2]  Hermann Kopetz,et al.  Real-time systems , 2018, CSC '73.

[3]  Alan Burns,et al.  A framework for scheduling in safety-critical embedded control systems , 1999, Proceedings Sixth International Conference on Real-Time Computing Systems and Applications. RTCSA'99 (Cat. No.PR00306).

[4]  Thomas A. Henzinger,et al.  Interface Theories for Component-Based Design , 2001, EMSOFT.

[5]  Giorgio Buttazzo,et al.  Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications , 1997 .

[6]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[7]  Edward A. Lee,et al.  What's Ahead for Embedded Software? , 2000, Computer.

[8]  Patricia Balbastre Betoret,et al.  Control tasks delay reduction under static and dynamic scheduling policies , 2000, Proceedings Seventh International Conference on Real-Time Computing Systems and Applications.

[9]  Kousha Etessami,et al.  Optimizing Büchi Automata , 2000, CONCUR.

[10]  Nancy A. Lynch,et al.  Hybrid I/O automata , 1995, Inf. Comput..

[11]  J. Tsitsiklis,et al.  The boundedness of all products of a pair of matrices is undecidable , 2000 .

[12]  Alan Burns,et al.  The End Of The Line For Static Cyclic Scheduling? , 1993, Fifth Euromicro Workshop on Real-Time Systems.

[13]  A. Morse,et al.  Stability of switched systems with average dwell-time , 1999, Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304).

[14]  Anton Cervin,et al.  Improved scheduling of control tasks , 1999, Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99.

[15]  Luciano Lavagno,et al.  Scheduling for Embedded Real-Time Systems , 1998, IEEE Des. Test Comput..

[16]  Insup Lee,et al.  Compositional real-time scheduling framework , 2004, 25th IEEE International Real-Time Systems Symposium.

[17]  Oded Maler,et al.  Job-Shop Scheduling Using Timed Automata , 2001, CAV.

[18]  Phill Schultz.  Mortality of 2 X2 Matrices , 1977 .

[19]  S. Shankar Sastry,et al.  Scanning the issue - special issue on modeling and design of embedded software , 2003, Proceedings of the IEEE.

[20]  Daniel Liberzon,et al.  Switching in Systems and Control , 2003, Systems & Control: Foundations & Applications.

[21]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.