{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:57:55Z","timestamp":1725569875157},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642169007"},{"type":"electronic","value":"9783642169014"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16901-4_28","type":"book-chapter","created":{"date-parts":[[2010,11,8]],"date-time":"2010-11-08T12:40:06Z","timestamp":1289220006000},"page":"420-435","source":"Crossref","is-referenced-by-count":1,"title":["Closed Form Approximations for Steady State Probabilities of a Controlled Fork-Join Network"],"prefix":"10.1007","author":[{"given":"Jonathan","family":"Billington","sequence":"first","affiliation":[]},{"given":"Guy Edward","family":"Gallasch","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"28_CR1","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1145\/65950.65957","volume":"36","author":"F. Baccelli","year":"1989","unstructured":"Baccelli, F., Massey, W.A., Towsley, D.: Acyclic fork-join queuing networks. Journal of the ACM\u00a036(3), 615\u2013642 (1989)","journal-title":"Journal of the ACM"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1137\/0144074","volume":"44","author":"L. Flatto","year":"1984","unstructured":"Flatto, L., Hahn, S.: Two Parallel Queues Created by Arrivals with Two Demands I. SIAM Journal of Applied Mathematics\u00a044, 1041\u20131053 (1984)","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1137\/0145052","volume":"45","author":"L. Flatto","year":"1985","unstructured":"Flatto, L.: Two Parallel Queues Created by Arrivals with Two Demands II. SIAM Journal of Applied Mathematics\u00a045, 861\u2013878 (1985)","journal-title":"SIAM Journal of Applied Mathematics"},{"issue":"4","key":"28_CR4","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1109\/32.4676","volume":"14","author":"R. Nelson","year":"1988","unstructured":"Nelson, R., Towsley, D., Tantawi, A.N.: Performance Analysis of Parallel Processing Systems. IEEE Transactions on Software Engineering\u00a014(4), 532\u2013540 (1988)","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"6","key":"28_CR5","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1109\/12.2213","volume":"37","author":"R. Nelson","year":"1988","unstructured":"Nelson, R., Tantawi, A.N.: Approximate Analysis of Fork\/Join Synchronization in Parallel Queues. IEEE Transactions on Computers\u00a037(6), 739\u2013743 (1988)","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"28_CR6","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1109\/12.16501","volume":"38","author":"C. Kim","year":"1989","unstructured":"Kim, C., Agrawala, A.K.: Analysis of the Fork-Join Queue. IEEE Transactions on Computers\u00a038(2), 250\u2013255 (1989)","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"28_CR7","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1109\/12.76416","volume":"40","author":"Y.C. Liu","year":"1991","unstructured":"Liu, Y.C., Perros, H.G.: A Decomposition Procedure for the Analysis of a Closed Fork\/Join Queueing System. IEEE Transactions on Computers\u00a040(3), 365\u2013370 (1991)","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"28_CR8","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1109\/71.674321","volume":"9","author":"J.C.S. Lui","year":"1998","unstructured":"Lui, J.C.S., Muntz, R.R., Towsley, D.: Computing Performance Bounds of Fork-Join Parallel Programs under a Multiprocessing Environment. IEEE Transactions on Parallel and Distributed Systems\u00a09(3), 295\u2013311 (1998)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"28_CR9","first-page":"145","volume":"20","author":"A. Makowski","year":"1994","unstructured":"Makowski, A., Varma, S.: Interpolation Approximations for Symmetric Fork-Join Queues. Performance Evaluation\u00a020, 145\u2013165 (1994)","journal-title":"Performance Evaluation"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Varki, E.: Mean value technique for closed fork-join networks. In: SIGMETRICS 1999: Proceedings of the 1999 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pp. 103\u2013112 (1999)","DOI":"10.1145\/301453.301484"},{"issue":"11","key":"28_CR11","doi-asserted-by":"publisher","first-page":"1146","DOI":"10.1109\/71.969125","volume":"12","author":"E. Varki","year":"2001","unstructured":"Varki, E.: Response Time Analysis of Parallel Computer and Storage Systems. IEEE Transactions on Parallel and Distributed Systems\u00a012(11), 1146\u20131161 (2001)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1016\/j.peva.2006.11.002","volume":"64","author":"P. Harrison","year":"2007","unstructured":"Harrison, P., Zertal, S.: Queueing models of RAID systems with maxima of waiting times. Performance Evaluation\u00a064, 664\u2013689 (2007)","journal-title":"Performance Evaluation"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Song, J.S., Zipkin, P.: Supply Chain Operations: Assemble-to-Order Systems. In: Handbook in OR&MS, ch. 11, vol.\u00a011, pp. 561\u2013596. Elsevier, Amsterdam (2003)","DOI":"10.1016\/S0927-0507(03)11011-0"},{"volume-title":"Build to Order: The Road to the 5-Day Car","year":"2008","key":"28_CR14","unstructured":"Parry, G., Graves, A. (eds.): Build to Order: The Road to the 5-Day Car. Springer, London (2008)"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Bause, F., Kritzinger, P.S.: Stochastic Petri Nets - An Introduction to the Theory, 2nd edn. Vieweg (2002)","DOI":"10.1007\/978-3-322-86501-4"},{"key":"28_CR16","volume-title":"Modelling with Generalized Stochastic Petri Nets","author":"M. Ajmone Marsan","year":"1995","unstructured":"Ajmone Marsan, M., Balbo, G., Conte, G., Donatelli, S., Franceschinis, G.: Modelling with Generalized Stochastic Petri Nets. John Wiley and Sons, Chichester (1995)"},{"key":"28_CR17","series-title":"Article 32","first-page":"10","volume-title":"Proc. 1st Int. Conference on Performance Evaluation Methodologies and Tools, Pisa, Italy, International Conference Proceedings Series","author":"N. Lilith","year":"2006","unstructured":"Lilith, N., Billington, J., Freiheit, J.: Approximate Closed-Form Aggregation of a Fork-Join Structure in Generalised Stochastic Petri Nets. In: Proc. 1st Int. Conference on Performance Evaluation Methodologies and Tools, Pisa, Italy, International Conference Proceedings Series, vol.\u00a0180, Article 32, 10 pages. ACM Press, New York (2006)"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Do\u011fan\u00e7ay, K.: An Asymptotic Convergence Result for the Aggregation of Closed Fork-Join Generalised Stochastic Petri Nets. In: Proc. IEEE Region 10 Conference, TENCON 2009, Singapore, November 23-26, 6 pages (2009)","DOI":"10.1109\/TENCON.2009.5396055"},{"key":"28_CR19","unstructured":"Billington, J., Gallasch, G.E.: Steady State Markov Analysis of a Controlled Fork-Join Network. Technical Report CSEC-41, Computer Systems Engineering Centre, University of South Australia (June 30, revised July 15, 2010)"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Gallasch, G.E., Billington, J.: A Study of the Convergence of Steady State Probabilities in a Closed Fork-Join Network. In: Proc. 8th International Symposium on Automated Technology for Verification and Analysis (ATVA 2010), Singapore, September 21-24. LNCS, vol. 6252, pp. 143\u2013157. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-15643-4_12"},{"key":"28_CR21","unstructured":"University of Ilmenau: TimeNET, http:\/\/www.tu-ilmenau.de\/TimeNET"}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16901-4_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T00:12:24Z","timestamp":1559779944000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16901-4_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642169007","9783642169014"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16901-4_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}