Discrete geometry applied in hard real-time systems validation

Authors:
Gaëlle Largeteau;Dominique Geniet;Éric Andrès
Affiliations:
LISI, Université de Poitiers & ENSMA, Futuroscope Chasseneuil, France;LISI, Université de Poitiers & ENSMA, Futuroscope Chasseneuil, France;IRCOM-SIC, SP2MI, Futuroscope, France
Venue:
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
Year:
2005

Citing 6
Cited 6

A theory of timed automata

Theoretical Computer Science
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications

Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Exhaustive Computation of the Scheduled Task Execution Sequences of a Real-Time Application

FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Discrete linear objects in dimension n: the standard model

Graphical Models - Special issue: Discrete topology and geometry for image and object representation
Term validation of distributed hard real-time applications

CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata

WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model

Theoretical Computer Science
Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L)

CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Regular geometrical languages and tiling the plane

CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Real-time scheduling using regularity criteria and a geometrical approach

International Journal of Critical Computer-Based Systems
Geometricity of binary regular languages

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Integrating PFairness within a model based scheduling tool

VECoS'10 Proceedings of the Fourth international conference on Verification and Evaluation of Computer and Communication Systems

Quantified Score

Hi-index	0.00

Visualization

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.