The Complexity of the Finite Containment Problem for Petri Nets (Q3912016)

From MaRDI portal
Revision as of 01:01, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Complexity of the Finite Containment Problem for Petri Nets
scientific article

    Statements

    title
    The Complexity of the Finite Containment Problem for Petri Nets (English)
    0 references
    author
    Ernst W. Mayr
    0 references
    Albert R. Meyer
    0 references
    publication date
    1981
    0 references
    zbMATH Keywords
    inclusion problem
    0 references
    reachability set
    0 references
    primitive recursive complexity
    0 references

    Identifiers

    DOI
    10.1145/322261.322271
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68Q85
    0 references
    03B25
    0 references
    03D15
    0 references
    zbMATH DE Number
    3723855
    0 references
    OpenAlex ID
    W1975261774
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3912016&oldid=32707118"
    Powered by MediaWiki