A Nice Labelling for Tree-Like Event Structures of Degree 3 - Computer Science Distributed, Parallel, and Cluster ComputingReport as inadecuate




A Nice Labelling for Tree-Like Event Structures of Degree 3 - Computer Science Distributed, Parallel, and Cluster Computing - Download this document for free, or read online. Document in PDF available to download.

Abstract: We address the problem of and#64257;nding nice labellings for event structuresof degree 3. We develop a minimum theory by which we prove that the labellingnumber of an event structure of degree 3 is bounded by a linear function of theheight. The main theorem we present in this paper states that event structuresof degree 3 whose causality order is a tree have a nice labelling with 3colors. Finally, we exemplify how to use this theorem to construct upper boundsfor the labelling number of other event structures of degree 3.



Author: Luigi Santocanale LIF

Source: https://arxiv.org/







Related documents