Mathematical programming approach to the Petri nets reachability problem (Q856211): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3773358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal verification of parallel programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel program schemata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3771634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471845 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4220896 / rank
 
Normal rank

Latest revision as of 11:18, 25 June 2024

scientific article
Language Label Description Also known as
English
Mathematical programming approach to the Petri nets reachability problem
scientific article

    Statements

    Mathematical programming approach to the Petri nets reachability problem (English)
    0 references
    0 references
    0 references
    0 references
    7 December 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    Petri nets
    0 references
    reachability problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references