The following pages link to On selective unboundedness of VASS (Q355513):
Displayed 7 items.
- Small vertex cover makes Petri net coverability and boundedness easier (Q1949744) (← links)
- Strategic reasoning with a bounded number of resources: the quest for tractability (Q2238736) (← links)
- Coverability Trees for Petri Nets with Unordered Data (Q2811357) (← links)
- (Q5089314) (← links)
- (Q5111264) (← links)
- (Q5111627) (← links)
- On the complexity of resource-bounded logics (Q5915568) (← links)