The following pages link to Petri nets and large finite sets (Q1060848):
Displayed 20 items.
- Linearizing well quasi-orders and bounding the length of bad sequences (Q744984) (← links)
- Effective uniform bounding in partial differential fields (Q900852) (← links)
- On bounds for the effective differential Nullstellensatz (Q907329) (← 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)
- Decision problems for propositional linear logic (Q1192352) (← links)
- On the finite containment problem for Petri nets (Q1819937) (← links)
- Flat Petri nets (invited talk) (Q2117150) (← links)
- Complexity Hierarchies beyond Elementary (Q2828216) (← links)
- Model Checking the Quantitative μ-Calculus on Linear Hybrid Systems (Q3012936) (← links)
- Multiply-Recursive Upper Bounds with Higman’s Lemma (Q3012939) (← links)
- Reducibilities Among Decision Problems for HNN Groups, Vector Addition Systems and Subsystems of Peano Arithmetic (Q3035687) (← links)
- Annual Meeting of the Association for Symbolic Logic, Los Angeles, 1989 (Q3478380) (← links)
- (Q4222868) (← links)
- The complexity of decision procedures in relevance logic II (Q4948542) (← links)
- On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems (Q5090985) (← links)
- The Parametric Complexity of Lossy Counter Machines (Q5092331) (← links)
- Algorithms yield upper bounds in differential algebra (Q5879624) (← links)
- Lower bounds on the state complexity of population protocols (Q6096031) (← links)