Approximate throughput computation of stochastic marked graphs
type: Item
instance of: scholarly article
title: Approximate throughput computation of stochastic marked graphs
zbMATH Open document ID: 0763.90044
DOI: 10.1016/0743-7315(92)90009-C
author: Hauke Jungnitz
author: Beatriz Sánchez
author: Manuel Silva
published in: Journal of Parallel and Distributed Computing
publication date: 1993-01-17T00:00:00Z
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 60K20
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 90B15
zbMATH DE Number: 96801
zbMATH Keywords: marked graphs
zbMATH Keywords: fork/join queueing networks
zbMATH Keywords: qualitative theory
zbMATH Keywords: multiple cuts
zbMATH Keywords: hierarchical decomposition
MaRDI profile type: Publication
full work available at URL: 0743-7315(92)90009-c
OpenAlex ID: W2071128608
description: scientific article; zbMATH DE number 96801