Pages that link to "Item:Q4635904"
From MaRDI portal
The following pages link to The Complexity of Coverability in ν-Petri Nets (Q4635904):
Displaying 10 items.
- Model checking Petri nets with names using data-centric dynamic systems (Q315291) (← links)
- Ordinal recursive complexity of unordered data nets (Q529043) (← links)
- Handling infinitely branching well-structured transition systems (Q1686118) (← links)
- Small vertex cover makes Petri net coverability and boundedness easier (Q1949744) (← links)
- Extending the Rackoff technique to Affine nets (Q2957508) (← links)
- The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings (Q3295146) (← links)
- Coverability, Termination, and Finiteness in Recursive Petri Nets (Q5025058) (← links)
- The Parametric Complexity of Lossy Counter Machines (Q5092331) (← links)
- WQO dichotomy for 3-graphs (Q5919047) (← links)
- The ideal view on Rackoff's coverability technique (Q5925512) (← links)