 |
|
|
|
| HAL : hal-00142349, version 1 |
| arXiv : 0704.2355 |
| Fiche détaillée |  Récupérer au format |
|
|
| CONCUR 2007, Lisbon : Portugal (2007) |
|
|
|
|
| A Nice Labelling for Tree-Like Event Structures of Degree 3 |
|
|
| Luigi Santocanale 1 |
|
|
| (04/09/2007) |
|
|
|
| We address the problem of finding nice labellings for event structures of degree 3. We develop a minimum theory by which we prove that the labelling number of an event structure of degree 3 is bounded by a linear function of the height. The main theorem we present in this paper states that event structures of degree 3 whose causality order is a tree have a nice labelling with 3 colors. Finally, we exemplify how to use this theorem to construct upper bounds for the labelling number of other event structures of degree 3. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire d'informatique Fondamentale de Marseille (LIF) |
|
|
|
CNRS : UMR6166 – Université de la Méditerranée - Aix-Marseille II – Université de Provence - Aix-Marseille I |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Calcul parallèle, distribué et partagé |
|
|
| event structures – labelling – graph coloring |
|
|
|
|
|
| hal-00142349, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00142349 | |
| oai:hal.archives-ouvertes.fr:hal-00142349 | |
| Contributeur : Luigi Santocanale | |
| Soumis le : Mercredi 18 Avril 2007, 14:05:49 | |
| Dernière modification le : Mercredi 4 Mars 2009, 17:59:31 | |
