arXiv Open Access 2009

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

Luigi Santocanale

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.DC

Penulis (1)

Luigi Santocanale

Format Sitasi

APA MLA BibTeX

Santocanale, L. (2009). A Nice Labelling for Tree-Like Event Structures of Degree 3 (Extended Version). https://arxiv.org/abs/0903.3462

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2009
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓