Pages that link to "Item:Q2986811"
From MaRDI portal
The following pages link to The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets (Q2986811):
Displaying 14 items.
- Ordinal recursive complexity of unordered data nets (Q529043) (← links)
- Linearizing well quasi-orders and bounding the length of bad sequences (Q744984) (← links)
- Computable fixpoints in well-structured symbolic model checking (Q2248074) (← links)
- Coverability Trees for Petri Nets with Unordered Data (Q2811357) (← links)
- Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture (Q2822649) (← links)
- Complexity Hierarchies beyond Elementary (Q2828216) (← links)
- The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings (Q3295146) (← links)
- (Q5090941) (← links)
- The Parametric Complexity of Lossy Counter Machines (Q5092331) (← links)
- Dynamic Networks of Timed Petri Nets (Q5166770) (← links)
- (Q5207052) (← links)
- Hardness Results for Coverability Problem of Well-Structured Pushdown Systems (Q5739016) (← links)
- Timed Basic Parallel Processes (Q5875376) (← links)
- The ideal view on Rackoff's coverability technique (Q5925512) (← links)
