Pages that link to "Item:Q2811357"
From MaRDI portal
The following pages link to Coverability Trees for Petri Nets with Unordered Data (Q2811357):
Displaying 6 items.
- Ordinal recursive complexity of unordered data nets (Q529043) (← links)
- Handling infinitely branching well-structured transition systems (Q1686118) (← links)
- Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture (Q2822649) (← links)
- (Q5009439) (← links)
- (Q5136306) (← links)
- WQO dichotomy for 3-graphs (Q5919047) (← links)