Thiagarajan's MSO decidability conjecture for grid-free trace-regular event structures

Let EN{\mathcal E}_N be a trace-regular event structure, and let MSO(EN)\operatorname{MSO}({\mathcal E}_N) denote its monadic second-order theory. The event structure is grid-free when it contains no three pairwise disjoint infinite event sets satisfying the grid conditions described in the paper. Thiagarajan's MSO decidability conjecture. The MSO\operatorname{MSO} theory of a trace-regular event structure EN{\mathcal E}_N is decidable if and only if EN{\mathcal E}_N is grid-free. The paper presents this as an open conjecture; it also records that non-grid-free systems have undecidable MSO theory.

Sources & referencesView supporting material

Primary source

Jérémie Chalopin and Victor Chepoi, “1-Safe Petri nets and special cube complexes: equivalence and applications”, arXiv:1810.03395 (2019).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.