Finding a Witness Path for Non-liveness in Free-Choice Nets (Q3011888): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Free Choice Petri Nets / 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: A structure to decide reachability in Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the General Petri Net Reachability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Algorithms for Deciding the Siphon-Trap Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entscheidbarkeit bei Petri Netzen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying CEGAR to the Petri Net State Equation / rank
 
Normal rank

Latest revision as of 06:28, 4 July 2024

scientific article
Language Label Description Also known as
English
Finding a Witness Path for Non-liveness in Free-Choice Nets
scientific article

    Statements

    Finding a Witness Path for Non-liveness in Free-Choice Nets (English)
    0 references
    0 references
    0 references
    29 June 2011
    0 references
    0 references
    Petri net
    0 references
    free-choice
    0 references
    siphon
    0 references
    trap
    0 references
    commoner-hack
    0 references
    0 references