{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T09:01:24Z","timestamp":1766048484045,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642548291"},{"type":"electronic","value":"9783642548307"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54830-7_3","type":"book-chapter","created":{"date-parts":[[2014,3,21]],"date-time":"2014-03-21T13:30:31Z","timestamp":1395408631000},"page":"43-57","source":"Crossref","is-referenced-by-count":3,"title":["Analysis of Probabilistic Basic Parallel Processes"],"prefix":"10.1007","author":[{"given":"R\u00e9mi","family":"Bonnet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Kiefer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anthony Widjaja","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Ben Henda, N., Mayr, R.: Decisive Markov chains. Logical Methods in Computer Science 3(4:7) (2007)","DOI":"10.2168\/LMCS-3(4:7)2007"},{"key":"3_CR2","unstructured":"Bonnet, R., Kiefer, S., Lin, A.W.: Analysis of probabilistic basic parallel processes. Technical report, arxiv.org (2014), http:\/\/arxiv.org\/abs\/1401.4130"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.ic.2011.10.005","volume":"210","author":"T. Br\u00e1zdil","year":"2012","unstructured":"Br\u00e1zdil, T., Esparza, J., Kiefer, S., Luttenberger, M.: Space-efficient scheduling of stochastically generated tasks. Information and Computation\u00a0210, 87\u2013110 (2012)","journal-title":"Information and Computation"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S1571-0661(05)80597-3","volume":"22","author":"L. Alfaro de","year":"1999","unstructured":"de Alfaro, L.: From fairness to chance. Electronic Notes in Theoretical Computer Science\u00a022, 55\u201387 (1999)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/978-3-540-39910-0_14","volume-title":"Verification: Theory and Practice","author":"N. Dershowitz","year":"2004","unstructured":"Dershowitz, N., Jayasimha, D.N., Park, S.: Bounded fairness. In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol.\u00a02772, pp. 304\u2013317. Springer, Heidelberg (2004)"},{"issue":"1","key":"3_CR6","doi-asserted-by":"crossref","first-page":"13","DOI":"10.3233\/FI-1997-3112","volume":"31","author":"J. Esparza","year":"1997","unstructured":"Esparza, J.: Petri nets, commutative context-free grammars, and basic parallel processes. Fundam. Inform.\u00a031(1), 13\u201325 (1997)","journal-title":"Fundam. Inform."},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/3-540-60045-0_62","volume-title":"Computer Aided Verification","author":"J. Esparza","year":"1995","unstructured":"Esparza, J., Kiehn, A.: On the model checking problem for branching time logics and basic parallel processes. In: Wolper, P. (ed.) CAV 1995. LNCS, vol.\u00a0939, pp. 353\u2013366. Springer, Heidelberg (1995)"},{"key":"3_CR8","unstructured":"Feller, W.: An introduction to probability theory and its applications, vol.\u00a0I. John Wiley & Sons (1968)"},{"issue":"1","key":"3_CR9","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.ic.2009.06.001","volume":"208","author":"S.B. Fr\u00f6schle","year":"2010","unstructured":"Fr\u00f6schle, S.B., Jan\u010dar, P., Lasota, S., Sawa, Z.: Non-interleaving bisimulation equivalences on basic parallel processes. Inf. Comput.\u00a0208(1), 42\u201362 (2010)","journal-title":"Inf. Comput."},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1145\/2166.357214","volume":"5","author":"S. Hart","year":"1983","unstructured":"Hart, S., Sharir, M., Pnueli, A.: Termination of probabilistic concurrent programs. ACM Transactions on Programming Languages and Systems\u00a05(3), 356\u2013380 (1983)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"1&2","key":"3_CR11","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0304-3975(95)00064-X","volume":"158","author":"Y. Hirshfeld","year":"1996","unstructured":"Hirshfeld, Y., Jerrum, M., Moller, F.: A polynomial algorithm for deciding bisimilarity of normed context-free processes. Theor. Comput. Sci.\u00a0158(1&2), 143\u2013159 (1996)","journal-title":"Theor. Comput. Sci."},{"issue":"7","key":"3_CR12","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1016\/j.ic.2008.12.011","volume":"207","author":"H. H\u00fcttel","year":"2009","unstructured":"H\u00fcttel, H., Kobayashi, N., Suto, T.: Undecidable equivalences for basic parallel processes. Inf. Comput.\u00a0207(7), 812\u2013829 (2009)","journal-title":"Inf. Comput."},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Jan\u010dar, P.: Strong bisimilarity on basic parallel processes is PSPACE-complete. In: Proceedings of LICS, pp. 218\u2013227 (2003)","DOI":"10.1109\/LICS.2003.1210061"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Lynch, N.A., Saias, I., Segala, R.: Proving time bounds for randomized distributed algorithms. In: PODC, pp. 314\u2013323 (1994)","DOI":"10.1145\/197917.198117"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/978-3-540-24611-4_11","volume-title":"Validation of Stochastic Systems","author":"G. Norman","year":"2004","unstructured":"Norman, G.: Analysing randomized distributed algorithms. In: Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P., Siegle, M. (eds.) Validation of Stochastic Systems. LNCS, vol.\u00a02925, pp. 384\u2013418. Springer, Heidelberg (2004)"},{"issue":"6","key":"3_CR16","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.entcs.2005.04.005","volume":"128","author":"J.-F. Raskin","year":"2005","unstructured":"Raskin, J.-F., Samuelides, M., Van Begin, L.: Games for counting abstractions. Electronic Notes in Theoretical Computer Science\u00a0128(6), 69\u201385 (2005)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: Automatic verification of probabilistic concurrent finite state programs. In: Proceedings of FOCS, pp. 327\u2013338 (1985)","DOI":"10.1109\/SFCS.1985.12"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54830-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T03:46:53Z","timestamp":1746157613000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54830-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642548291","9783642548307"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54830-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}