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

Luigi Santocanale (1)

1 LIF - Laboratoire d'informatique Fondamentale de Marseille - UMR 6166

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.

Domains: Distributed, Parallel, and Cluster Computing [cs.DC]

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⟩