arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1802.07612cs.LO
收藏

3-图的WQO二分法

WQO dichotomy for 3-graphs

Sławomir Lasota, Radosław Piórkowski

摘要:

我们调查数据丰富的模型,如Petri网的数据,其中的过渡的可执行性是由所涉及的数据值之间的关系。在这种模型中,各种决策问题的可判定性状态可能依赖于数据域的结构。根据WQO二分法猜想,如果一个数据域是同构的,那么它要么表现出良好的准序(在这种情况下,可判定性遵循标准参数),要么基本上所有的决策问题都是不可判定的。我们证实了猜想的数据域是3-图(图2色边)。在技术层面上,这一结果是一个重要的一步,超出了已知的分类结果均匀的结构。

英文摘要:

We investigate data-enriched models, like Petri nets with data, where executability of a transition is conditioned by a relation between data values involved. Decidability status of various decision problems in such models may depend on the structure of data domain. According to the WQO Dichotomy Conjecture, if a data domain is homogeneous then it either exhibits a well quasi-order (in which case decidability follows by standard arguments), or essentially all the decision problems are undecidable for Petri nets over that data domain. We confirm the conjecture for data domains being 3-graphs (graphs with 2-colored edges). On the technical level, this results is a significant step beyond known classification results for homogeneous structures.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑