3度树型事件结构的一个好标号(扩展版)
A Nice Labelling for Tree-Like Event Structures of Degree 3 (Extended Version)
摘要:
我们解决的问题,找到好的标签的事件结构度3。我们开发了一个最小的理论,我们证明了3度的事件结构的标签数是有界的高度的线性函数。本文给出的主要定理表明,因果序为树的3度事件结构具有3种颜色的良好标记。最后,我们讨论了如何利用这个定理来构造其他3度事件结构的标号数的上界。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。