Upper and lower bounds for stochastic marked graphs (Q1321817): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Complexity of network synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Marked directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unison, canon, and sluggish clocks in networks controlled by a synchronizer / 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 Evaluation of Asynchronous Concurrent Systems Using Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Parallel Computations / rank
 
Normal rank

Latest revision as of 14:28, 22 May 2024

scientific article
Language Label Description Also known as
English
Upper and lower bounds for stochastic marked graphs
scientific article

    Statements

    Upper and lower bounds for stochastic marked graphs (English)
    0 references
    0 references
    16 April 1996
    0 references
    A form of recurrence relations is used to derive efficiently computable bounds on the rate of strongly connected SMGS (stochastic marked graphs).
    0 references
    stochastic marked graphs
    0 references
    Petri nets
    0 references
    distributed computing
    0 references
    performance evaluation
    0 references
    recurrence relations
    0 references

    Identifiers