A polynomial-time algorithm to decide liveness of bounded free choice nets (Q1193656)

From MaRDI portal
Revision as of 19:36, 14 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
A polynomial-time algorithm to decide liveness of bounded free choice nets
scientific article

    Statements

    A polynomial-time algorithm to decide liveness of bounded free choice nets (English)
    0 references
    0 references
    27 September 1992
    0 references
    Petri nets
    0 references
    linear algebraic calculation of deadlocks and traps
    0 references
    polynomial time algorithm
    0 references
    liveness
    0 references
    bounded free choice nets
    0 references

    Identifiers