A structure to decide reachability in Petri nets (Q1193891): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q127976180, #quickstatements; #temporary_batch_1722490750963
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4190106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the reachability problem for 5-dimensional vector addition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel program schemata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a partial solution to a linear system of equations in positive integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3702518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4720790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3911403 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127976180 / rank
 
Normal rank

Latest revision as of 06:39, 1 August 2024

scientific article
Language Label Description Also known as
English
A structure to decide reachability in Petri nets
scientific article

    Statements

    A structure to decide reachability in Petri nets (English)
    0 references
    0 references
    27 September 1992
    0 references
    Petri nets
    0 references
    reachability
    0 references
    precovering graph
    0 references

    Identifiers