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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3683542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3771633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial order behaviour and structure of Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3773359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial Newton method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of some problems in Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3782791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859263 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:20, 16 May 2024

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