Approximate throughput computation of stochastic marked graphs

DOI10.1016/0743-7315(92)90009-CzbMath0763.90044OpenAlexW2071128608MaRDI QIDQ1200153

Beatriz Sánchez, Hauke Jungnitz, Manuel Silva

Publication date: 17 January 1993

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-7315(92)90009-c

zbMATH Keywords

hierarchical decompositionmarked graphsqualitative theoryfork/join queueing networksmultiple cuts

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Queues and service in operations research (90B22) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (1)

Iterative Decomposition and Aggregation of Labeled GSPNs

This page was built for publication: Approximate throughput computation of stochastic marked graphs