{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T21:11:12Z","timestamp":1774905072488,"version":"3.50.1"},"reference-count":25,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,7,1]],"date-time":"1992-07-01T00:00:00Z","timestamp":709948800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1992,7,1]],"date-time":"1992-07-01T00:00:00Z","timestamp":709948800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1992,7]]},"DOI":"10.1016\/0743-7315(92)90009-c","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"282-295","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":18,"title":["Approximate throughput computation of stochastic marked graphs"],"prefix":"10.1016","volume":"15","author":[{"given":"Hauke","family":"Jungnitz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beatriz","family":"S\u00e1nchez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0743-7315(92)90009-C_BIB1","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/1031382.809314","article-title":"Response time preservation: A general technique for developing approximate algorithms for queueing networks","volume":"12","author":"Aggrawal","year":"1984","journal-title":"Performance Evaluation Rev."},{"issue":"1, 2","key":"10.1016\/0743-7315(92)90009-C_BIB2","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0164-1212(86)90030-0","article-title":"On the product-form solution of a class of multiple-bus multiprocessor system models","volume":"6","author":"Ajmone Marsan","year":"1986","journal-title":"J. Systems Software"},{"key":"10.1016\/0743-7315(92)90009-C_BIB3","series-title":"Performance Models of Multiprocessor Systems","author":"Ajmone Marsan","year":"1986"},{"issue":"6","key":"10.1016\/0743-7315(92)90009-C_BIB4","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1109\/32.24734","article-title":"Time scale decomposition of a class of generalized stochastic Petri net models","volume":"15","author":"Ammar","year":"1989","journal-title":"IEEE Trans. Software Engrg."},{"issue":"10","key":"10.1016\/0743-7315(92)90009-C_BIB5","doi-asserted-by":"crossref","first-page":"1251","DOI":"10.1109\/12.5986","article-title":"Combining queueing network and generalized stochastic Petri net models for the solution of complex models of system behaviour","volume":"37","author":"Balbo","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(92)90009-C_BIB6","article-title":"A unified view of product-form approximation techniques for general closed queueing networks","author":"Baynat","year":"1990"},{"key":"10.1016\/0743-7315(92)90009-C_BIB7","first-page":"359","article-title":"Transformations and decompositions of nets","volume":"Vol. 254","author":"Berthelot","year":"1987"},{"key":"10.1016\/0743-7315(92)90009-C_BIB8_1","series-title":"Proceedings of the 3rd International Workshop on Petri Nets and Performance Models","first-page":"200","article-title":"Tight polynomial bounds for steady-state performance of marked graphs","author":"Campos","year":"1989"},{"issue":"5","key":"10.1016\/0743-7315(92)90009-C_BIB8_2","doi-asserted-by":"crossref","DOI":"10.1109\/81.139289","article-title":"An improved and more complete version, Properties and Performance Bounds for Timed Marked Graphs","volume":"39","author":"Campos","year":"1992","journal-title":"IEEE Trans. Circuits & Systems"},{"issue":"12","key":"10.1016\/0743-7315(92)90009-C_BIB9","doi-asserted-by":"crossref","first-page":"1368","DOI":"10.1109\/9.106153","article-title":"Properties and performance bounds for closed free choice synchronized monoclass queueing networks","volume":"36","author":"Campos","year":"1991","journal-title":"IEEE Trans. Automat. Control."},{"key":"10.1016\/0743-7315(92)90009-C_BIB10","series-title":"Proc. of the IEEE International Workshop on Petri Nets and Performance Models, PNPM'91","first-page":"74","article-title":"A decomposition approach for stochastic Petric nets models","author":"Ciardo","year":"1991"},{"key":"10.1016\/0743-7315(92)90009-C_BIB11","article-title":"Equivalence, reversibility and symmetry properties in fork\/join queueing networks with blocking","author":"Dallery","year":"1990"},{"issue":"2","key":"10.1016\/0743-7315(92)90009-C_BIB12","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0164-1212(86)90029-4","article-title":"One place unbounded stochastic Petri nets: Ergodic criteria and steady state solutions","volume":"1","author":"Florin","year":"1986","journal-title":"J. Systems Software"},{"key":"10.1016\/0743-7315(92)90009-C_BIB13","series-title":"Fundamentals of Queueing Theory","author":"Gross","year":"1985"},{"key":"10.1016\/0743-7315(92)90009-C_BIB14","doi-asserted-by":"crossref","unstructured":"Jungnitz, H., and Desrochers, A. A. Flow equivalent nets for the performance analysis of flexible manufacturing systems. Proceedings of the IEEE Robotics and Automation Conference 1991, pp. 122\u2013127.","DOI":"10.1109\/ROBOT.1991.131565"},{"key":"10.1016\/0743-7315(92)90009-C_BIB15","series-title":"Proceedings of the Fifth International Conference on Modelling Techniques and Tools for Computer Performance Evaluation","first-page":"259","article-title":"A subsystem identification algorithm for the approximate solution of large GSPN models","author":"Klas","year":"1991"},{"key":"10.1016\/0743-7315(92)90009-C_BIB16","series-title":"IEEE INFOCOM'87, The Conference on Computer Communication","first-page":"1054","article-title":"Markovian Petri net protocols with product from solution","author":"Lazar","year":"1987"},{"key":"10.1016\/0743-7315(92)90009-C_BIB17","series-title":"Computer System Analysis Using Queueing Network Models","author":"Lazowska","year":"1984"},{"key":"10.1016\/0743-7315(92)90009-C_BIB18","series-title":"Proceedings of the 12th International Conference on Applications and Theory of Petri Nets","first-page":"257","article-title":"Iterative decomposition and aggregation of stochastic marked graphs Petri nets","author":"Li","year":"1991"},{"key":"10.1016\/0743-7315(92)90009-C_BIB19","series-title":"Proceedings of the IEEE International Workshop on Petri Nets and Performance Models, PNPM'91","first-page":"64","article-title":"Performance Petri net analysis of communications protocol software by delay-equivalent aggregation","author":"Li","year":"1991"},{"issue":"5","key":"10.1016\/0743-7315(92)90009-C_BIB20","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1109\/TSE.1979.234214","article-title":"An approximate analytical method for general queueing networks","volume":"SE-5","author":"Marie","year":"1979","journal-title":"IEEE Trans. on Software Engineering"},{"key":"10.1016\/0743-7315(92)90009-C_BIB21","first-page":"541","article-title":"Petri nets: Properties, analysis, and applications","volume":"77","author":"Murata","year":"1989"},{"key":"10.1016\/0743-7315(92)90009-C_BIB22","year":"1989"},{"key":"10.1016\/0743-7315(92)90009-C_BIB23","series-title":"Las Redes de Petri en la Autom\u00e1tica y la Inform\u00e1tica","author":"Silva","year":"1985"},{"key":"10.1016\/0743-7315(92)90009-C_BIB24","series-title":"Advances in Petri Nets '89","first-page":"375","article-title":"Petri nets and flexible manufacturing","volume":"Vol. 266","author":"Silva","year":"1990"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159290009C?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159290009C?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:28:35Z","timestamp":1757514515000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074373159290009C"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,7]]}},"alternative-id":["074373159290009C"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(92)90009-c","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[1992,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Approximate throughput computation of stochastic marked graphs","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(92)90009-C","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1992 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}