Geometrical Languages
| Autor: | Blanpain, Baptiste, Champarnaud, Jean-Marc, Dubernard, Jean-Philippe |
|---|---|
| Přispěvatelé: | Laboratoire d'Informatique, de Traitement de l'Information et des Systèmes (LITIS), Institut national des sciences appliquées Rouen Normandie (INSA Rouen Normandie), Institut National des Sciences Appliquées (INSA)-Normandie Université (NU)-Institut National des Sciences Appliquées (INSA)-Normandie Université (NU)-Université de Rouen Normandie (UNIROUEN), Normandie Université (NU)-Université Le Havre Normandie (ULH), Normandie Université (NU), GRLMC Universitat Rovira I Virgil, GRLMC Universitat Rovira I Virgili, Dubernard, Jean-Philippe, Blanpain, Baptiste |
| Jazyk: | angličtina |
| Rok vydání: | 2007 |
| Předmět: |
[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
languages discrete geometry [INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL] [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS] Computer Science::Programming Languages [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS] Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing) real-time applications [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM] temporal validation Finite automata [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL] |
| Zdroj: | Proceedings LATA'2007 LATA'2007, Mar 2007, tarragona, Spain. pp.127--138 LATA'07 (Languages and Automata Theoretical Aspects) LATA'07 (Languages and Automata Theoretical Aspects), Mar 2007, Tarragona, Spain. pp.127—138 |
| Popis: | International audience; 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|