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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Reachability in cyclic extended free-choice systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free Choice Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm to decide liveness of bounded free choice nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handles and reachability analysis of free choice nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999014 / rank
 
Normal rank

Revision as of 14:48, 28 May 2024

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