WQO dichotomy for 3-graphs
From MaRDI portal
Publication:5919047
DOI10.1016/j.ic.2020.104541zbMath1496.68234arXiv1802.07612OpenAlexW2788399102MaRDI QIDQ5919047
Sławomir Lasota, Radosław Piórkowski
Publication date: 15 December 2020
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.07612
Graph theory (including graph drawing) in computer science (68R10) Combinatorics of partially ordered sets (06A07) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Applications of model theory (03C98)
Cites Work
- Unnamed Item
- Unnamed Item
- Ordinal recursive complexity of unordered data nets
- Decidability and complexity of Petri nets with unordered data
- Countable homogeneous multipartite graphs
- Theory of relations. Transl. from the French by P. Clote
- System modelling with high-level Petri nets
- Coloured Petri nets and the invariant-method
- Forbidden substructures and combinatorial dichotomies: WQO and universality
- A survey of homogeneous structures
- Two forbidden induced subgraphs and well-quasi-ordering
- Coverability Trees for Petri Nets with Unordered Data
- Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture
- Automata theory in nominal sets
- Towards nominal computation
- Verification of Timed-Arc Petri Nets
- Nets with Tokens Which Carry Data
- Countable Ultrahomogeneous Undirected Graphs
- Subgraphs and well‐quasi‐ordering
- The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
- The Complexity of Coverability in ν-Petri Nets
- Turing Machines with Atoms
- WQO dichotomy for 3-graphs
- Well-structured transition systems everywhere!
