Petri nets and large finite sets
From MaRDI portal
Publication:1060848
DOI10.1016/0304-3975(84)90029-XzbMath0569.68046MaRDI QIDQ1060848
Publication date: 1984
Published in: Theoretical Computer Science (Search for Journal in Brave)
upper boundmodels of arithmeticcomplexity of the Karp-Miller decision procedureFinite Containment Problem for pairs of Petri nets
Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Models of arithmetic and set theory (03C62)
Related Items
Algorithms yield upper bounds in differential algebra ⋮ Reducibilities Among Decision Problems for HNN Groups, Vector Addition Systems and Subsystems of Peano Arithmetic ⋮ Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states ⋮ Completeness results for conflict-free vector replacement systems ⋮ Annual Meeting of the Association for Symbolic Logic, Los Angeles, 1989 ⋮ Lower bounds on the state complexity of population protocols ⋮ Effective uniform bounding in partial differential fields ⋮ On bounds for the effective differential Nullstellensatz ⋮ Unnamed Item ⋮ The complexity of problems involving structurally bounded and conservative Petri nets ⋮ Decision problems for propositional linear logic ⋮ Model Checking the Quantitative μ-Calculus on Linear Hybrid Systems ⋮ Multiply-Recursive Upper Bounds with Higman’s Lemma ⋮ The complexity of decision procedures in relevance logic II ⋮ Linearizing well quasi-orders and bounding the length of bad sequences ⋮ The Parametric Complexity of Lossy Counter Machines ⋮ On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems ⋮ On the finite containment problem for Petri nets ⋮ Complexity Hierarchies beyond Elementary ⋮ Flat Petri nets (invited talk)
Cites Work
