Pages that link to "Item:Q1936244"
From MaRDI portal
The following pages link to The covering and boundedness problems for branching vector addition systems (Q1936244):
Displaying 13 items.
- Strategic reasoning with a bounded number of resources: the quest for tractability (Q2238736) (← links)
- Expand, Enlarge, and Check for Branching Vector Addition Systems (Q2842103) (← links)
- Nonelementary Complexities for Branching VASS, MELL, and Extensions (Q2946760) (← links)
- Logics of Repeating Values on Data Trees and Branching Counter Systems (Q2988368) (← links)
- IMPLICATIONAL RELEVANCE LOGIC IS 2-EXPTIME-COMPLETE (Q3188334) (← links)
- On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension (Q3449486) (← links)
- Coverability, Termination, and Finiteness in Recursive Petri Nets (Q5025058) (← links)
- (Q5111264) (← links)
- (Q5207052) (← links)
- Decidable models of integer-manipulating programs with recursive parallelism (Q5915566) (← links)
- On the complexity of resource-bounded logics (Q5915568) (← links)
- Constructive decision via redundancy-free proof-search (Q5919012) (← links)
- The ideal view on Rackoff's coverability technique (Q5925512) (← links)