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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Sastry, S., et al.: Modeling and design of embedded software. Proceedings of the IEEE 91(1) (2003)
Lee, E.A.: What’s ahead for embedded software. IEEE Computer, 18–26 (2000)
Kopetz, H.: Real-Time Systems: Design Principles for Distributed Embedded Applications. Kluwer Academic Publishers, Dordrecht (2000)
Buttazo, G.: Hard real-time computing systems: Predictable scheduling algorithms and applications. Kluwer Academic Publishers, Dordrecht (1997)
Shin, I., Lee, I.: Compsitional real-time scheduling framework. In: Proceedings of the 25th IEEE Real-Time Systems Symposium, IEEE Computer Society Press, Los Alamitos (2004)
Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 133–191. Elsevier Science Publishers, Amsterdam (1990)
Balarin, F., et al.: Scheduling for embedded real-time systems. IEEE Design and Test of Computers 15(1), 71–82 (1998), doi:10.1109/54.655185
Lynch, N., Segala, R., Vaandrager, F.: Hybrid I/O automata. Information and Computation 185(1), 105–157 (2003)
de Alfaro, L., Henzinger, T.: Interface theories for component-based design. In: Henzinger, T.A., Kirsch, C.M. (eds.) EMSOFT 2001. LNCS, vol. 2211, pp. 148–165. Springer, Heidelberg (2001)
Abdeddaïm, Y., Maler, O.: Job-shop scheduling using timed automata. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 478–492. Springer, Heidelberg (2001)
Balbastre, P., Ripoll, I., Crespo, A.: Control tasks delay reduction under static and dynamic scheduling policies. In: RTCSA’00, p. 522 (2000)
Bate, I., Burns, A.: A framework for scheduling in safety-critical embedded control systems. In: RTCSA ’99: Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications, Washington, DC, USA, p. 46. IEEE Computer Society Press, Los Alamitos (1999)
Cervin, A.: Improved scheduling of control tasks. In: Proceedings of the 11th Euromicro Conference on Real-Time Systems, York, UK, June 1999, pp. 4–10 (1999)
Audsley, N., Tindell, K., Burns, A.: The end of the line for static cyclic scheduling? In: Real-Time Systems 1993, Proceedings of the Fifth Euromicro Workshop on on Real-Time Systems (1993)
Blondel, V.D., Tsitsiklis, J.N.: The boundedness of all products of a pair of matrices is undecidable. Systems Control Lett. 41(2), 135–140 (2000)
Hespanha, J., Morse, A.: Stability of switched systems with average dwell-time (1999)
Liberzon, D.: Switching in systems and control. Systems & Control: Foundations & Applications. Birkhäuser Boston Inc., Boston (2003)
Schultz, P.: Research Problems: Mortality of 2 × 2 Matrices. Amer. Math. Monthly 84(6), 463–464 (1977)
Gurvits, L.: Stability of discrete linear inclusion. Linear Algebra Appl. 231, 47–85 (1995)
Etessami, K., Holzmann, G.J.: Optimizing Büchi automata. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, p. 153. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Weiss, G., Alur, R. (2007). Automata Based Interfaces for Control and Scheduling. In: Bemporad, A., Bicchi, A., Buttazzo, G. (eds) Hybrid Systems: Computation and Control. HSCC 2007. Lecture Notes in Computer Science, vol 4416. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71493-4_46
Download citation
DOI: https://doi.org/10.1007/978-3-540-71493-4_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71492-7
Online ISBN: 978-3-540-71493-4
eBook Packages: Computer ScienceComputer Science (R0)