{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:30:39Z","timestamp":1761597039386},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540418658"},{"type":"electronic","value":"9783540453192"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45319-9_15","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T15:50:47Z","timestamp":1184601047000},"page":"204-219","source":"Crossref","is-referenced-by-count":11,"title":["Abstraction in Probabilistic Process Algebra"],"prefix":"10.1007","author":[{"given":"S.","family":"Andova","sequence":"first","affiliation":[]},{"given":"J. C. M.","family":"Baeten","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,23]]},"reference":[{"key":"15_CR1","unstructured":"A. Aho, J. Hopcroft, J. Ullman, The design and analysis of computer algorithms, Addison-Wesley Publishing Company, 1974."},{"key":"15_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/3-540-48778-6_7","volume-title":"Proc. ARTS\u201999, Bamberg, Germany","author":"S. Andova","year":"1999","unstructured":"S. Andova, Process algebra with probabilistic choice (extended abstract), Proc. ARTS\u201999, Bamberg, Germany, J.-P. Katoen, ed., LNCS 1601, Springer-Verlag, pp. 111\u2013129, 1999. Full version report CSR 99-12, Eindhoven University of Technology, 1999."},{"key":"15_CR3","unstructured":"S. Andova, Process algebra with interleaving probabilistic parallel composition, Eindhoven University of Technology, CSR 99\u201304, 1999."},{"key":"15_CR4","unstructured":"S. Andova, J.C.M. Baeten, Abstraction in probabilistic process algebra (extended abstract), \n                    http:\/\/www.win.tue.nl\/~suzana\n                    \n                  ."},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(87)90052-1","volume":"51","author":"J.C.M. Baeten","year":"1987","unstructured":"J.C.M. Baeten, J.A. Bergstra, J.W. Klop, On the consistency of Koomen\u2019s fair abstraction rule, Theor. Comp. Sci. 51, pp.129\u2013176, 1987.","journal-title":"Theor. Comp. Sci."},{"issue":"2","key":"15_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":"15_CR7","doi-asserted-by":"crossref","unstructured":"J.C.M. Baeten, W. P. Weijland, Process algebra, Cambridge University Press, 1990.","DOI":"10.1017\/CBO9780511624193"},{"key":"15_CR8","unstructured":"C. Baier, On algorithmic verification methods for probabilistic systems, Habilitation thesis, Univ. Mannheim, 1998."},{"key":"15_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/3-540-63166-6_14","volume-title":"Proc. CAV\u201997","author":"C. Baier","year":"1997","unstructured":"C. Baier, H. Hermanns, Weak bisimulation for fully probabilistic processes, Proc. CAV\u201997, LNCS 1254, pp. 119\u2013130, 1997."},{"key":"15_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1007\/BFb0032063","volume-title":"Proc. ICALP\u201990","author":"J.F. Groote","year":"1990","unstructured":"J.F. Groote, F. Vaandrager, An efficient algorithm for branching bisimulation and stuttering equivalence, Proc. ICALP\u201990, LNCS 443, pp. 626\u2013638, 1990."},{"key":"15_CR11","unstructured":"C.-C. Jou, Aspects of probabilistic process algebra, Ph.D.Thesis, State University of New York at Stony Brook, 1990."}],"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\/3-540-45319-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,19]],"date-time":"2019-01-19T06:05:44Z","timestamp":1547877944000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45319-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540418658","9783540453192"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45319-9_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}