A nice labelling for tree-like event structures of degree 3

  • Authors:
  • Luigi Santocanale

  • Affiliations:
  • LIF, Université de Provence, 39 rue F. Joliot Curie, 13453 Marseille Cedex 13, France

  • Venue:
  • Information and Computation
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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 index of an event structure of degree 3 is bounded by a linear function of the height. The main theorem of the paper states that event structures of degree 3 whose causality order is a tree have a nice labelling with 3 colors. We exemplify how to use this theorem to construct upper bounds for the index of other event structures of degree 3.