1-Safe Petri Nets and Special Cube Complexes

Author:

Chalopin Jérémie1ORCID,Chepoi Victor2ORCID

Affiliation:

1. CNRS, Aix-Marseille Université, and Université de Toulon, France

2. Aix-Marseille Université, CNRS, and Université de Toulon, Marseille, France

Abstract

Nielsen et al. [35] proved that every 1-safe Petri net N unfolds into an event structure E N . By a result of Thiagarajan [46], these unfoldings are exactly the trace-regular event structures. Thiagarajan [46] conjectured that regular event structures correspond exactly to trace-regular event structures. In a recent paper (Chalopin and Chepoi [12]), we disproved this conjecture, based on the striking bijection between domains of event structures, median graphs, and CAT(0) cube complexes. However, we proved that Thiagarajan’s conjecture is true for regular event structures whose domains are principal filters of universal covers of finite special cube complexes. In the current article, we prove the converse: To any finite 1-safe Petri net N , one can associate a finite special cube complex X N such that the domain of the event structure E N (obtained as the unfolding of N ) is a principal filter of the universal cover X̃ N of X N . This establishes a bijection between 1-safe Petri nets and finite special cube complexes and provides a combinatorial characterization of trace-regular event structures. Using this bijection and techniques from graph theory and geometry (MSO theory of graphs, bounded treewidth, and bounded hyperbolicity), we disprove yet another conjecture by Thiagarajan (from the paper with Yang [48]) that the monadic second-order logic of a 1-safe Petri net (i.e., of its event structure unfolding) is decidable if and only if its unfolding is grid-free. It was proven by Thiagarajan and Yang [48] that the MSO logic is undecidable if the unfolding is not grid-free. Our counterexample is the trace-regular event structure that arises from a virtually special square complex Z. The domain of this event structure Ė Z is the principal filter of the universal cover Z̃ of Z in which to each vertex we added a pendant edge. The graph of the domain of Ė Z has bounded hyperbolicity (and, thus, the event structure Ė Z is grid-free) but has infinite treewidth. Using results of Seese, Courcelle, and Müller and Schupp, we show that this implies that the MSO theory of the event structure Ė Z is undecidable.

Funder

ANR Project DISTANCIA

Publisher

Association for Computing Machinery (ACM)

Subject

Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science

Reference49 articles.

Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Hyperbolic models for CAT(0) spaces;Advances in Mathematics;2024-07

2. First-order logic axiomatization of metric graph theory;Theoretical Computer Science;2024-04

3. Distributed Asynchronous Games With Causal Memory are Undecidable;Logical Methods in Computer Science;2022-09-08

4. Medians in median graphs and their cube complexes in linear time;Journal of Computer and System Sciences;2022-06

5. Large facing tuples and a strengthened sector lemma;Tunisian Journal of Mathematics;2022-03-30

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3