Discrete Geometry Applied in Hard Real-Time Systems Validation
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.
KeywordsReal-time operational validation multiprocessors resource sharing geometrical modeling
- [CHO96]Choquet-geniet, A., Geniet, D., Cottet, F.: Exhaustive computation of scheduled task execution sequences of real-time application. In: Proc FTRTFT 1996 (1996)Google Scholar
- [LG02]Largeteau, G., Geniet, D.: Term Validation of Distributed Hard Real-time Applications. Conference on Implementation and Application of Automata (2002)Google Scholar
- [Mok83]Mok, A.K.: Fundamental design problems for the hard real-time environments. Ph.D. MIT (1983)Google Scholar