Article Dans Une Revue Information and Computation Année : 2010

A Nice Labelling for Tree-Like Event Structures of Degree 3 (Extended Version)

Résumé

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.

Fichier principal
Vignette du fichier
0.pdf (3.91 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-00369451 , version 1 (19-03-2009)

Licence

Identifiants

Citer

Luigi Santocanale. A Nice Labelling for Tree-Like Event Structures of Degree 3 (Extended Version). Information and Computation, 2010, 208 (6), pp.652--665. ⟨10.1016/j.ic.2009.05.006⟩. ⟨hal-00369451⟩
295 Consultations
199 Téléchargements

Altmetric

Partager

  • More