scientific article; zbMATH DE number 4037227
From MaRDI portal
Publication:3776647
Recommendations
- Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states
- A multiparameter analysis of the boundedness problem for vector addition systems
- SOME COMPLEXITY RESULTS FOR RINGS OF PETRI NETS
- Flat Petri nets (invited talk)
- The complexity of problems involving structurally bounded and conservative Petri nets
Cited in
(18)- Petri nets and large finite sets
- Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states
- An \(O(n^{1.5})\) algorithm to decide boundedness for conflict-free vector replacement systems
- Completeness results for conflict-free vector replacement systems
- The complexity of problems involving structurally bounded and conservative Petri nets
- \(B\)-fairness and structural \(B\)-fairness in Petri net models of concurrent systems
- On the finite containment problem for Petri nets
- A multiparameter analysis of the boundedness problem for vector addition systems
- Flat Petri nets (invited talk)
- Complexity results for problems of communication-free Petri nets and related formalisms
- Completeness results for generalized communication-free Petri nets with arbitrary arc multiplicities
- On functions weakly computable by Petri nets and vector addition systems
- scientific article; zbMATH DE number 4024806 (Why is no real title available?)
- SOME COMPLEXITY RESULTS FOR RINGS OF PETRI NETS
- The Reachability Problem for Petri Nets Is Not Elementary
- Completeness results for generalized communication-free Petri nets with arbitrary edge multiplicities
- Results on equivalence, boundedness, liveness, and covering problems of BPP-Petri nets
- Complexity results for 1-safe nets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3776647)
