Abstract
Off-line validation of hard real-time systems usually stands on state based models. Such approaches always deal with both space and time combinatorial explosions. This paper proposes a discrete geometrical approach to model applications and to compute operational feasability from topological properties. Thanks to this model, we can decide the feasability of real-time synchronous systems composed of periodic tasks, sharing resources, running on multiprocessor architectures. This method avoids state enumeration and therefore limits both space and time explosion: computing an automaton model takes at least 2 hours for a real application instead of at most 1 second using discrete geometry.
Chapter PDF
Similar content being viewed by others
References
Alur, R., Dill, D.: A theory of timed automata. Theoretical Computer Science 126, 183–235 (1994)
Andres, E.: Discrete linear objects in dimension n: the standard model. Graphical Models 65(1-3), 92–111 (2003)
Buttazzo, G.: Hard real-time computing systems: Predictable scheduling algorithms and applications. Kluwer Academic Publishers, Dordrecht (1997)
Choquet-geniet, A., Geniet, D., Cottet, F.: Exhaustive computation of scheduled task execution sequences of real-time application. In: Proc FTRTFT 1996 (1996)
Liu et, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in real-time environnement. Journal of the ACM 20, 46–61 (1973)
Largeteau, G., Geniet, D.: Term Validation of Distributed Hard Real-time Applications. Conference on Implementation and Application of Automata (2002)
Mok, A.K.: Fundamental design problems for the hard real-time environments. Ph.D. MIT (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Largeteau, G., Geniet, D., Andrès, É. (2005). Discrete Geometry Applied in Hard Real-Time Systems Validation. In: Andres, E., Damiand, G., Lienhardt, P. (eds) Discrete Geometry for Computer Imagery. DGCI 2005. Lecture Notes in Computer Science, vol 3429. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31965-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-31965-8_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25513-0
Online ISBN: 978-3-540-31965-8
eBook Packages: Computer ScienceComputer Science (R0)