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

Authors:
J. -M. Champarnaud;J. -Ph. Dubernard;H. Jeanne
Affiliations:
LITIS, University of Rouen, France;LITIS, University of Rouen, France;LITIS, University of Rouen, France
Venue:
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Year:
2008

Citing 6
Cited 0

Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor

Real-Time Systems
On Context-Free Languages

Journal of the ACM (JACM)
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Automata, Languages, and Machines

Automata, Languages, and Machines
WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model

Theoretical Computer Science
Discrete geometry applied in hard real-time systems validation

DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery

Quantified Score

Hi-index	0.00

Visualization

Abstract

Our aim is to present an efficient algorithm that checks whether a binary and prolongeable regular language is geometrical or not, based on specific properties of its minimal deterministic automaton. Geometrical languages have been introduced in the framework of off-line temporal validation of real-time softwares. Actually, validation can be achieved through both a model based on regular languages and a model based on discrete geometry. Geometrical languages are intended to develop a link between these two models. The regular case is of practical interest regarding to implementation features, which motivates the design of an efficient geometricity test addressing the family of regular languages.