Reachability in live and safe free-choice Petri nets is NP-complete (Q1129263)

From MaRDI portal
Revision as of 03:10, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Reachability in live and safe free-choice Petri nets is NP-complete
scientific article

    Statements

    Reachability in live and safe free-choice Petri nets is NP-complete (English)
    0 references
    0 references
    13 August 1998
    0 references
    reachability
    0 references
    Petri nets
    0 references

    Identifiers