On Flows in Stochastic Marked Graphs

DOI10.1017/S0269964800001984zbMATH Open1134.90322MaRDI QIDQ3416004FDOQ3416004

Authors: Francois Baccelli, Nicholas Bambos, Jean Walrand 

Publication date: 19 January 2007

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Recommendations

• Ergodic theory of stochastic Petri networks
• scientific article; zbMATH DE number 3905853
• Discrete Time Stochastic Petri Nets
• Asymptotic properties of stochastic timed event graphs
• scientific article; zbMATH DE number 714459

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Title not available (Why is that?)
• Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
• Palm probabilities and stationary queues
• Circuit theoretic analysis and synthesis of marked graphs
• Scheduling Parallel Computations

Cited In (8)

• Approximate throughput computation of stochastic marked graphs
• Graph-theoretic analysis of complex stochastic networks
• IPA for continuous stochastic marked graphs
• An upper bound on the cycle time of a stochastic marked graph using incomplete information on the transition firing time distributions
• Queueing networks of random link topology: stationary dynamics of maximal throughput schedules
• Ergodic theory of stochastic Petri networks
• Superposition properties and performance bounds of stochastic timed-event graphs
• Title not available (Why is that?)

This page was built for publication: On Flows in Stochastic Marked Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3416004)