Geometrical Languages - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

Geometrical Languages

Résumé

Our aim is to introduce and generalize a class of languages used in off-line temporal validation of real-time softwares. Computing the feasibility of an application consists in checking whether there exists a sequence of execution which allows each task to run without any time error. This can be done with a model based on automata and languages. Because of certain properties of these languages, a model based on discrete geometry can also be used to make the computing time smaller. In this paper, we develop the link between languages and geometry, by defining a new class of languages, which we call geometrical languages. The main result is an algorithm that checks wether a given regular language is geometrical or not, by means of equations with positive integer variables.
Fichier principal
Vignette du fichier
Article_LATA2007.pdf (207.2 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00452953 , version 1 (03-02-2010)

Identifiants

  • HAL Id : hal-00452953 , version 1

Citer

Baptiste Blanpain, Jean-Marc Champarnaud, Jean-Philippe Dubernard. Geometrical Languages. LATA'07 (Languages and Automata Theoretical Aspects), Mar 2007, Tarragona, Spain. pp.127—138. ⟨hal-00452953⟩
141 Consultations
52 Téléchargements

Partager

Gmail Facebook X LinkedIn More