{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T05:26:11Z","timestamp":1741152371257,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642198342"},{"type":"electronic","value":"9783642198359"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-19835-9_28","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T15:03:16Z","timestamp":1300114996000},"page":"296-310","source":"Crossref","is-referenced-by-count":3,"title":["On Probabilistic Parallel Programs with Process Creation and Synchronisation"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Kiefer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominik","family":"Wojtczak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Allender, E., B\u00fcrgisser, P., Kjeldgaard-Pedersen, J., Miltersen, P.B.: On the complexity of numerical analysis. In: IEEE Conf. on Computational Complexity, pp. 331\u2013339 (2006)","DOI":"10.1109\/CCC.2006.30"},{"key":"28_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-65371-1","volume-title":"Branching Processes","author":"K.B. Athreya","year":"1972","unstructured":"Athreya, K.B., Ney, P.E.: Branching Processes. Springer, Heidelberg (1972)"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/11539452_36","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"A. Bouajjani","year":"2005","unstructured":"Bouajjani, A., M\u00fcller-Olm, M., Touili, T.: Regular symbolic analysis of dynamic networks of pushdown systems. In: Jayaraman, K., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 473\u2013487. Springer, Heidelberg (2005)"},{"key":"28_CR4","unstructured":"Br\u00e1zdil, T., Esparza, J., Kiefer, S.: On the memory consumption of probabilistic pushdown automata. In: Proceedings of FSTTCS, pp. 49\u201360 (2009)"},{"key":"28_CR5","unstructured":"Br\u00e1zdil, T., Kiefer, S., Ku\u010dera, A., Va\u0159ekov\u00e1, I.H.: Runtime analysis of probabilistic programs with unbounded recursion (2010) (submitted for publication), http:\/\/arxiv.org\/abs\/1007.1710"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Canny, J.: Some algebraic and geometric computations in PSPACE. In: STOC 1988, pp. 460\u2013467 (1988)","DOI":"10.1145\/62212.62257"},{"key":"28_CR7","unstructured":"Dailey, D., Leiserson, C.E.: Using Cilk to write multiprocessor chess programs. The Journal of the International Computer Chess Association (2002)"},{"issue":"2","key":"28_CR8","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.scico.2006.05.008","volume":"63","author":"J.S. Danaher","year":"2006","unstructured":"Danaher, J.S., Lee, I.A., Leiserson, C.E.: Programming with exceptions in JCilk. Science of Computer Programming (SCP)\u00a063(2), 147\u2013171 (2006)","journal-title":"Science of Computer Programming (SCP)"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-30538-5_2","volume-title":"FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science","author":"J. Esparza","year":"2004","unstructured":"Esparza, J., Etessami, K.: Verifying probabilistic procedural programs. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol.\u00a03328, pp. 16\u201331. Springer, Heidelberg (2004)"},{"issue":"6","key":"28_CR10","doi-asserted-by":"publisher","first-page":"2282","DOI":"10.1137\/090749591","volume":"39","author":"J. Esparza","year":"2010","unstructured":"Esparza, J., Kiefer, S., Luttenberger, M.: Computing the least fixed point of positive polynomial systems. SIAM Journal on Computing\u00a039(6), 2282\u20132335 (2010)","journal-title":"SIAM Journal on Computing"},{"key":"28_CR11","first-page":"12","volume-title":"LICS 2004","author":"J. Esparza","year":"2004","unstructured":"Esparza, J., Ku\u010dera, A., Mayr, R.: Model checking probabilistic pushdown automata. In: LICS 2004, pp. 12\u201321. IEEE, Los Alamitos (2004)"},{"key":"28_CR12","first-page":"117","volume-title":"LICS 2005","author":"J. Esparza","year":"2005","unstructured":"Esparza, J., Ku\u010dera, A., Mayr, R.: Quantitative analysis of probabilistic pushdown automata: Expectations and variances. In: LICS 2005, pp. 117\u2013126. IEEE, Los Alamitos (2005)"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-31980-1_17","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K. Etessami","year":"2005","unstructured":"Etessami, K., Yannakakis, M.: Algorithmic verification of recursive probabilistic state machines. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, pp. 253\u2013270. Springer, Heidelberg (2005)"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Etessami, K., Yannakakis, M.: Recursive concurrent stochastic games. Logical Methods in Computer Science\u00a04(4) (2008)","DOI":"10.2168\/LMCS-4(4:7)2008"},{"issue":"1","key":"28_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1462153.1462154","volume":"56","author":"K. Etessami","year":"2009","unstructured":"Etessami, K., Yannakakis, M.: Recursive markov chains, stochastic grammars, and monotone systems of nonlinear equations. Journal of the ACM\u00a056(1), 1\u201366 (2009)","journal-title":"Journal of the ACM"},{"issue":"2","key":"28_CR16","first-page":"65","volume":"12","author":"R. Feldmann","year":"1989","unstructured":"Feldmann, R., Monien, B., Mysliwietz, P., Vornberger, O.: Distributed game-tree search. ICCA Journal\u00a012(2), 65\u201373 (1989)","journal-title":"ICCA Journal"},{"key":"28_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-51866-9","volume-title":"The Theory of Branching Processes","author":"T.E. Harris","year":"1963","unstructured":"Harris, T.E.: The Theory of Branching Processes. Springer, Heidelberg (1963)"},{"key":"28_CR18","unstructured":"Kiefer, S., Wojtczak, D.: On probabilistic parallel programs with process creation and synchronisation. Technical report, arxiv.org (2010), http:\/\/arxiv.org\/abs\/1012.2998"},{"key":"28_CR19","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s00224-004-1170-6","volume":"39","author":"C. L\u00f6ding","year":"2006","unstructured":"L\u00f6ding, C.: Reachability problems on regular ground tree rewriting graphs. Theory of Computing Systems\u00a039, 347\u2013383 (2006)","journal-title":"Theory of Computing Systems"},{"issue":"2","key":"28_CR20","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1145\/355637.355640","volume":"1","author":"M.A. Malcolm","year":"1975","unstructured":"Malcolm, M.A., Simpson, R.B.: Local versus global strategies for adaptive quadrature. ACM Transactions on Mathematical Software\u00a01(2), 129\u2013146 (1975)","journal-title":"ACM Transactions on Mathematical Software"},{"issue":"1-2","key":"28_CR21","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1006\/inco.1999.2826","volume":"156","author":"R. Mayr","year":"2000","unstructured":"Mayr, R.: Process rewrite systems. Information and Computation\u00a0156(1-2), 264\u2013286 (2000)","journal-title":"Information and Computation"},{"issue":"3","key":"28_CR22","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0747-7171(10)80003-3","volume":"13","author":"J. Renegar","year":"1992","unstructured":"Renegar, J.: On the computational complexity and geometry of the first-order theory of the reals. Parts I\u2013III. Journal of Symbolic Computation\u00a013(3), 255\u2013352 (1992)","journal-title":"Journal of Symbolic Computation"},{"key":"28_CR23","doi-asserted-by":"crossref","unstructured":"Yannakakis, M., Etessami, K.: Checking LTL properties of recursive Markov chains. In: QEST 2005, pp. 155\u2013165 (2005)","DOI":"10.1109\/QEST.2005.8"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19835-9_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T07:44:27Z","timestamp":1741074267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19835-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642198342","9783642198359"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19835-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}