A Nice Labelling for Tree-Like Event Structures of Degree 3 (Extended Version)
Distributed, Parallel, and Cluster Computing
2009-03-23 v1
Abstract
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.
Cite
@article{arxiv.0903.3462,
title = {A Nice Labelling for Tree-Like Event Structures of Degree 3 (Extended Version)},
author = {Luigi Santocanale},
journal= {arXiv preprint arXiv:0903.3462},
year = {2009}
}