Pages that link to "Item:Q3912016"
From MaRDI portal
The following pages link to The Complexity of the Finite Containment Problem for Petri Nets (Q3912016):
Displaying 26 items.
- Synchronizing sequences on a class of unbounded systems using synchronized Petri nets (Q262433) (← links)
- Error-correcting Petri nets (Q553909) (← links)
- Petri nets and large finite sets (Q1060848) (← links)
- Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states (Q1096388) (← links)
- Completeness results for conflict-free vector replacement systems (Q1113674) (← links)
- The complexity of problems involving structurally bounded and conservative Petri nets (Q1183417) (← links)
- Normal and sinkless Petri nets (Q1208921) (← links)
- The covering and boundedness problems for vector addition systems (Q1242682) (← links)
- On the finite containment problem for Petri nets (Q1819937) (← links)
- The complexity of the word problems for commutative semigroups and polynomial ideals (Q1836661) (← links)
- Verifying lossy channel systems has nonprimitive recursive complexity. (Q1853078) (← links)
- Optimal algorithms for the coverability, the subword, the containment, and the equivalence problems for commutative semigroups. (Q1854344) (← links)
- Flat Petri nets (invited talk) (Q2117150) (← links)
- Data flow analysis of asynchronous systems using infinite abstract domains (Q2233447) (← links)
- Complexity Hierarchies beyond Elementary (Q2828216) (← links)
- Nonelementary Complexities for Branching VASS, MELL, and Extensions (Q2946760) (← links)
- Classifying the computational complexity of problems (Q3781088) (← links)
- Behavioural equivalence for infinite systems — Partially decidable! (Q4633177) (← links)
- The complexity of decision procedures in relevance logic II (Q4948542) (← links)
- (Q5002821) (← links)
- On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems (Q5090985) (← links)
- The Parametric Complexity of Lossy Counter Machines (Q5092331) (← links)
- (Q5111264) (← links)
- (Q5207052) (← links)
- An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, and applications to commutative semigroups (Q5928894) (← links)
- Nonprimitive recursive complexity and undecidability for Petri net equivalences (Q5941099) (← links)
