Log In Sign Up

WQO dichotomy for 3-graphs

by   Sławomir Lasota, et al.

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.


page 1

page 2

page 3

page 4


Tuza's Conjecture for Threshold Graphs

Tuza famously conjectured in 1981 that in a graph without k+1 edge-disjo...

Smooth approximations and CSPs over finitely bounded homogeneous structures

We develop the novel machinery of smooth approximations, and apply it to...

1-Safe Petri nets and special cube complexes: equivalence and applications

Nielsen, Plotkin, and Winskel (1981) proved that every 1-safe Petri net ...

On Tuza's conjecture in co-chain graphs

In 1981, Tuza conjectured that the cardinality of a minimum set of edges...

On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets

Synthesis consists in deciding whether a given labeled transition system...

Cubic graphs, their Ehrhart quasi-polynomials, and a scissors congruence phenomenon

The scissors congruence conjecture for the unimodular group is an analog...

The Asymmetric Maximum Margin Bias of Quasi-Homogeneous Neural Networks

In this work, we explore the maximum-margin bias of quasi-homogeneous ne...