A Nice Labelling for Tree-Like Event Structures of Degree 3 - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

A Nice Labelling for Tree-Like Event Structures of Degree 3

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 (227.35 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00142349 , version 1 (18-04-2007)

Identifiants

Citer

Luigi Santocanale. A Nice Labelling for Tree-Like Event Structures of Degree 3. CONCUR 2007, Sep 2007, Lisbon, Portugal. pp.151-165, ⟨10.1007/978-3-540-74407-8_11⟩. ⟨hal-00142349⟩
83 Consultations
63 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More