On the performance evaluation of multi-guarded marked graphs with single-server semantics (Q708894): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Bounds and Policies for Dynamic Routing in Loss Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4861739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential Petri nets: representing continuous systems in a discrete-event world / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the minimum cycle mean in a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance bounds for queueing networks and scheduling policies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3857698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proof for the Queuing Formula: <i>L</i> = λ<i>W</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3323698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bounds for bulk arrival queues / rank
 
Normal rank

Revision as of 08:48, 3 July 2024

scientific article
Language Label Description Also known as
English
On the performance evaluation of multi-guarded marked graphs with single-server semantics
scientific article

    Statements

    On the performance evaluation of multi-guarded marked graphs with single-server semantics (English)
    0 references
    0 references
    0 references
    0 references
    15 October 2010
    0 references
    early evaluation
    0 references
    throughput bounds
    0 references
    Petri nets
    0 references
    marked graphs
    0 references

    Identifiers