# Discrete Geometry Applied in Hard Real-Time Systems Validation

DGCI 2005 12th International Conference, Poitiers, Volume LNCS 3429, pages 23--33 - April 2005

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 of ressources, 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 unsing discrete geometry.

## BibTex references

@InProceedings{LGA2005_1488,

}

author | = {Largeteau, G. and Geniet, D. and Andres, E.}, | |

title | = {Discrete Geometry Applied in Hard Real-Time Systems Validation.}, | |

booktitle | = {DGCI 2005 12th International Conference, Poitiers}, | |

series | = {Lecture Notes on Computer Science}, | |

volume | = {LNCS 3429}, | |

pages | = {23--33}, | |

month | = {April}, | |

year | = {2005}, | |

editor | = {Eric Andres, Guillaume Damiand, Pascal Lienhardt}, | |

publisher | = {Springer Verlag}, | |

organization | = {International Pattern Recognition Association}, | |

keywords | = {Real-Time, operational validation, multiprocessors, ressource sharing, geometrical modelling}, |