The complexity of problems involving structurally bounded and conservative Petri nets (Q1183417): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(91)90004-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2002058814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4152749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the finite containment problem for Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decidability of persistence for vector addition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equality problem for vector addition systems is undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness results for single-path Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness results for conflict-free vector replacement systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n^{1.5})\) algorithm to decide boundedness for conflict-free vector replacement systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3974867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of some problems in Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel program schemata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3820016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of Conflict-Free and Persistent Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Persistence of vector replacement systems is decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the General Petri Net Reachability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Finite Containment Problem for Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the word problems for commutative semigroups and polynomial ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Petri nets and large finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3939247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3911403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The covering and boundedness problems for vector addition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multiparameter analysis of the boundedness problem for vector addition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural properties of petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3774960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3821599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5603731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal Petri nets / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:47, 15 May 2024

scientific article
Language Label Description Also known as
English
The complexity of problems involving structurally bounded and conservative Petri nets
scientific article

    Statements

    The complexity of problems involving structurally bounded and conservative Petri nets (English)
    0 references
    0 references
    28 June 1992
    0 references
    concurrency
    0 references
    Petri nets
    0 references
    upper bound
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references