The reachability problem for Petri nets is not elementary (Q5212744)

From MaRDI portal
Revision as of 23:52, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article; zbMATH DE number 7160486
Language Label Description Also known as
English
The reachability problem for Petri nets is not elementary
scientific article; zbMATH DE number 7160486

    Statements

    The reachability problem for Petri nets is not elementary (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    30 January 2020
    0 references
    Petri nets
    0 references
    reachability problems
    0 references
    vector addition systems
    0 references

    Identifiers

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