{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T19:05:33Z","timestamp":1763233533982},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540660101"},{"type":"electronic","value":"9783540487784"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":[[1999]]},"DOI":"10.1007\/3-540-48778-6_7","type":"book-chapter","created":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T10:18:07Z","timestamp":1178014687000},"page":"111-129","source":"Crossref","is-referenced-by-count":22,"title":["Process Algebra with Probabilistic Choice"],"prefix":"10.1007","author":[{"given":"Suzana","family":"Andova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,4,30]]},"reference":[{"key":"7_CR1","unstructured":"S. Andova, Process algebra with interleaving probabilistic parallel composition, Eindhoven University of Technology, CSR 99-xx, 1999."},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0890-5401(88)90027-2","volume":"78","author":"J.C.M. Baeten","year":"1988","unstructured":"J.C.M. Baeten, J. A. Bergstra, Global renaming operators in concrete process algebra, Information and Computation 78, pp. 205\u2013245, 1988.","journal-title":"Information and Computation"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"J.C.M. Baeten, W. P. Weijland, Process algebra, Cambridge University Press, 1990.","DOI":"10.1017\/CBO9780511624193"},{"key":"7_CR4","unstructured":"J.C.M. Baeten, C. Verhoef, Concrete process algebra, Handbook of Logic in Computer Science, volume 4: \u201cSemantic Modelling\u201d, Oxford University Press, 1995."},{"key":"7_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/978-3-540-48654-1_34","volume-title":"Proc. CONCUR\u201994","author":"J.C.M. Baeten","year":"1994","unstructured":"J.C.M. Baeten, J.A. Bergstra, Process algebra with partial choice, Proc. CONCUR\u201994, Uppsala, B. Jonsson & J. Parrow, eds., LNCS 836, Springer Verlag, pp. 465\u2013480, 1994."},{"issue":"2","key":"7_CR6","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1995.1135","volume":"121","author":"J.C.M. Baeten","year":"1995","unstructured":"J.C.M. Baeten, J.A. Bergstra, S.A. Smolka, Axiomatizing probabilistic processes: ACP with generative probabilities, Information and Computation 121(2), pp. 234\u2013255, Sep. 1995.","journal-title":"Information and Computation"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"J.A. Bergstra","year":"1984","unstructured":"J.A. Bergstra, J.W. Klop, Process algebra for synchronous communication, Information and Control 60, pp. 109\u2013137, 1984.","journal-title":"Information and Control"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/S0304-3975(96)00292-7","volume":"177","author":"P.R. DArgenio","year":"1997","unstructured":"P.R. D\u2019Argenio, C. Verhoef, A general conservative extension theorem in process algebra with inequalities, Theoretical Computer Science 177, pp. 351\u2013380, 1997.","journal-title":"Theoretical Computer Science"},{"key":"7_CR9","unstructured":"P.R. D\u2019Argenio, H. Hermanns, J.-P. Katoen On generative parallel composition, Preliminary Proc. of PROBMIV\u201998, Indianopolis, USA, C. Baier & M. Huth & M Kwiatkowska & M. Ryan ed., pp. 105\u2013121, 1998."},{"key":"7_CR10","unstructured":"A. Giacalone, C.-C. Jou, S. A. Smolka, Algebraic reasoning for probabilistic concurrent systems, Proc. Working Conference on Programming Concepts and Methods, IFIP TC 2, Sea of Galilee, Israel, M. Broy & C.B. Jones ed., pp. 443\u2013458, 1990."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"R.J. van Glabbeek, S. A. Smolka, B. Steffen, C. M. N. Tofts, Reactive, generative and stratified models of probabilistic processes, Proc. of 5th Annual IEEE Symp. on Logic in Computer Science, Philadelphia, PA, pp. 130\u2013141, 1990.","DOI":"10.1109\/LICS.1990.113740"},{"key":"7_CR12","unstructured":"H. Hansson, Time and probability in formal design of distributed systems, Ph.D. thesis, DoCS 91\/27, University of Uppsala, 1991."},{"key":"7_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BFb0039071","volume-title":"Proc. CONCUR\u2019 90","author":"C.-C. Jou","year":"1990","unstructured":"C.-C. Jou, S. A. Smolka Equivalences, congruences and complete axiomatizations for probabilistic processes, Proc. CONCUR\u2019 90, LNCS 458, Springer Verlag, Berlin, pp. 367\u2013383, 1990."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"K. G. Larsen, A. Skou, Bisimulation through probabilistic testing, Proc. of 16th ACM Symp. on Principles of Programming Languages, Austin, TX, 1989.","DOI":"10.1145\/75277.75307"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"F.W. Vaandrager, Two simple protocols, In: Applications of Process algebra, Cambridge University Press, J.C.M. Baeten ed., pp. 23\u201344, 1990.","DOI":"10.1017\/CBO9780511608841.003"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"M.Y. Vardi, Automatic verification of probabilistic concurrent finite state programs, Proc. of 26th Symp. on Foundations of Com. Sc., IEEE Comp. Soc. Press, pp. 327\u2013338, 1985.","DOI":"10.1109\/SFCS.1985.12"},{"key":"7_CR17","unstructured":"C. Verhoef, A general conservative extension theorem in process algebra, Proc. of PROCOMET\u201994, IFIP 2 Working Conference, San Miniato, E.-R. Olderog ed., pp. 149\u2013168, 1994."}],"container-title":["Lecture Notes in Computer Science","Formal Methods for Real-Time and Probabilistic Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48778-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T16:34:48Z","timestamp":1556382888000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48778-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540660101","9783540487784"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-48778-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}