{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T13:44:25Z","timestamp":1766065465809},"reference-count":47,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4156,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1016\/s0304-3975(01)00294-8","type":"journal-article","created":{"date-parts":[[2002,10,15]],"date-time":"2002-10-15T13:27:27Z","timestamp":1034688447000},"page":"481-519","source":"Crossref","is-referenced-by-count":13,"title":["Additive models of probabilistic processes"],"prefix":"10.1016","volume":"275","author":[{"given":"Mingsheng","family":"Ying","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00294-8_BIB1","series-title":"Formal Methods for Real-Time and Probabilistic Systems","first-page":"111","article-title":"Process algebra with probabilistic choice","volume":"vol. 1601","author":"Andova","year":"1999"},{"key":"10.1016\/S0304-3975(01)00294-8_BIB2","doi-asserted-by":"crossref","unstructured":"J. Baeten, J. Bergstra, S. Smolka, Axiomatising probabilistic processes: ACP with generative probability, Inform. Comput. 122 (1995), 234\u2013255 (Preliminary version appeared in CONCUR\u201992).","DOI":"10.1006\/inco.1995.1135"},{"key":"10.1016\/S0304-3975(01)00294-8_BIB3","first-page":"38","article-title":"Polynomial time algorithms for testing probabilistic bisimulation and simulation","volume":"vol. 1102","author":"Baier","year":"1996"},{"key":"10.1016\/S0304-3975(01)00294-8_BIB4","unstructured":"C. Baier, On algorithmic verification methods for probabilistic systems, Habilitation Thesis, University of Mannheim, Germany, 1998."},{"key":"10.1016\/S0304-3975(01)00294-8_BIB5","series-title":"Computer Aided Verification (CAV\u201997), Haifa, Israel","first-page":"119","article-title":"Weak bisimulation for fully probabilistic processes","volume":"vol. 1254","author":"Baier","year":"1997"},{"key":"10.1016\/S0304-3975(01)00294-8_BIB6","doi-asserted-by":"crossref","unstructured":"C. Baier, M. Kwiatkowska, Domain equations for probabilstic processes (extended abstract), Proc., EXPRESS\u201997, Electronic Notes in TCS, vol. 7, 1997 (A full journal version will appear in Math. Struct. Comput. Sci.","DOI":"10.1016\/S1571-0661(05)80465-7"},{"key":"10.1016\/S0304-3975(01)00294-8_BIB7","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","article-title":"Algebra of communicating processes with abstraction","volume":"33","author":"Bergstra","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00294-8_BIB8","doi-asserted-by":"crossref","unstructured":"I. Christoff, Testing equivalences for probabilistic processes, Technical Report DoCS 90\/22, Ph.D. Thesis, Department of Computer Science, Uppsala University, Uppsala, Sweden, 1990.","DOI":"10.1007\/BFb0039056"},{"key":"10.1016\/S0304-3975(01)00294-8_BIB9","first-page":"126","article-title":"Testing equivalence and fully abstract models for probabilistic processes","volume":"vol. 458","author":"Christoff","year":"1990"},{"key":"10.1016\/S0304-3975(01)00294-8_BIB10","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1006\/inco.1999.2808","article-title":"Testing preorders for probabilistic processes","volume":"154","author":"Cleaveland","year":"1999","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(01)00294-8_BIB11","series-title":"Automata, Languages and Programming (ICALP\u201992), Viena","first-page":"708","article-title":"Testing preorders for probabilistic processes","volume":"vol. 623","author":"Cleaveland","year":"1992"},{"key":"10.1016\/S0304-3975(01)00294-8_BIB12","first-page":"1","article-title":"On generative parallel composition","volume":"22","author":"D'Argenio","year":"1999","journal-title":"Electron. Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00294-8_BIB13","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","article-title":"Testing equivalences for processes","volume":"34","author":"De Nicola","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00294-8_BIB14","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, in:Proc. 5th Annu. IEEE Symp. on Logic in Computer Science, Philadelphia, PA, 1990, pp. 130\u2013141.","DOI":"10.1109\/LICS.1990.113740"},{"issue":"1","key":"10.1016\/S0304-3975(01)00294-8_BIB15","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1006\/inco.1995.1123","article-title":"Reactive, generative, and stratified models of probabilistic processes","volume":"121","author":"van Glabbeek","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(01)00294-8_BIB16","doi-asserted-by":"crossref","unstructured":"H.A. Hansson, B. Jonsson, A calculus for communicating systems with time and probabilities, in: Proc. 11th IEEE Symp. on Real-Time Systems, 1990.","DOI":"10.1109\/REAL.1990.128759"},{"key":"10.1016\/S0304-3975(01)00294-8_BIB17","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1006\/inco.1993.1067","article-title":"A theory of communicating processes with value passing","volume":"107","author":"Hennessy","year":"1993","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(01)00294-8_BIB18","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","article-title":"Communicating sequential processes","volume":"21","author":"Hoare","year":"1978","journal-title":"Commun. ACM"},{"key":"10.1016\/S0304-3975(01)00294-8_BIB19","series-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"key":"10.1016\/S0304-3975(01)00294-8_BIB20","doi-asserted-by":"crossref","unstructured":"B. Jonsson, K.G. Larsen, Specification and refinement of probabilistic processes, in: Proc. 6th Annu. IEEE Symp. on Logic in Computer Science, Amsterdam, 1991.","DOI":"10.1109\/LICS.1991.151651"},{"key":"10.1016\/S0304-3975(01)00294-8_BIB21","series-title":"Proc. 10th Annu. Symp. on Logic in Computer Science (LICS\u201995), San Diego, California","first-page":"431","article-title":"Compositional testing preorders for probabilistic processes","author":"Jonsson","year":"1995"},{"key":"10.1016\/S0304-3975(01)00294-8_BIB22","series-title":"Proc. first Int. Conf. on Concurrency Theory (CONCUR\u201990)","first-page":"367","article-title":"Equivalences, congruences, and complete axiomatizations for probabilistic processes","volume":"vol. 458","author":"Jou","year":"1990"},{"key":"10.1016\/S0304-3975(01)00294-8_BIB23","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1145\/360248.360251","article-title":"Formal verification of parallel programs","volume":"19","author":"Keller","year":"1976","journal-title":"Commun. ACM"},{"key":"10.1016\/S0304-3975(01)00294-8_BIB24","doi-asserted-by":"crossref","unstructured":"M. Kwiatkowska, G. Norman, A testing equivalence for reactive probabilistic processes, Proc., ENTCS, vol. 16, EXPRESS\u201998, 1998.","DOI":"10.1016\/S1571-0661(04)00121-5"},{"issue":"1","key":"10.1016\/S0304-3975(01)00294-8_BIB25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","article-title":"Bisimulation through probabilistic testing","volume":"94","author":"Larsen","year":"1991","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(01)00294-8_BIB26","first-page":"456","article-title":"Compositional verification of probabilistic processes","volume":"vol. 630","author":"Larsen","year":"1992"},{"key":"10.1016\/S0304-3975(01)00294-8_BIB27","doi-asserted-by":"crossref","unstructured":"N.A. Lynch, M. Tuttle, Hierarchical correctness proofs for distributed algorithms, in: Proc. 6th Annu. ACM Symp. on Principles of Distributed Computing, pp. 137\u2013151, 1987.","DOI":"10.1145\/41840.41852"},{"key":"10.1016\/S0304-3975(01)00294-8_BIB28","series-title":"A Calculus of Communicating Systems","volume":"vol. 92","author":"Milner","year":"1980"},{"key":"10.1016\/S0304-3975(01)00294-8_BIB29","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","article-title":"Calculi for synchrony and asynchrony","volume":"25","author":"Milner","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00294-8_BIB30","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S0304-3975(01)00294-8_BIB31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","article-title":"A calculus of mobile processes, Part I, II","volume":"100","author":"Milner","year":"1992","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(01)00294-8_BIB32","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0004-3702(86)90031-7","article-title":"Probabilistic logic","volume":"28","author":"Nilsson","year":"1986","journal-title":"Artif. Intell."},{"key":"10.1016\/S0304-3975(01)00294-8_BIB33","series-title":"Proc. 5th GI-Conf. on Theoretical Computer Science","first-page":"167","article-title":"Concurrency and automata on infinite sequences","volume":"vol. 104","author":"Park","year":"1980"},{"key":"10.1016\/S0304-3975(01)00294-8_BIB34","unstructured":"G.D. Plotkin, A Structured Approach to Operational Semantics, Report DAIMI FN-19, Aarhus University, 1981."},{"key":"10.1016\/S0304-3975(01)00294-8_BIB35","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0304-3975(94)00286-0","article-title":"Probabilistic communicating processes","volume":"152","author":"Seidel","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00294-8_BIB36","doi-asserted-by":"crossref","unstructured":"C.E. Shannon, A mathematical theory of communication, The Bell System Tech. J. 27 (1948) 379\u2013423,623\u2013656.","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"10.1016\/S0304-3975(01)00294-8_BIB37","series-title":"Proc. CONCUR\u201990\u201d","first-page":"456","article-title":"Priority as extremal probability","volume":"vol. 458","author":"Smolka","year":"1990"},{"key":"10.1016\/S0304-3975(01)00294-8_BIB38","series-title":"Proc. CONCUR\u201990\u201d","first-page":"467","article-title":"A synchronous calculus of relative frequency","volume":"vol. 458","author":"Tofts","year":"1990"},{"key":"10.1016\/S0304-3975(01)00294-8_BIB39","doi-asserted-by":"crossref","unstructured":"Y. Wang, K.G. Larsen, Testing probabilistic and non-deterministic processes, Protocol Specification, Testing and Verification, vol. XII, Fl, USA, 1992, pp. 47\u201361.","DOI":"10.1016\/B978-0-444-89874-6.50010-6"},{"key":"10.1016\/S0304-3975(01)00294-8_BIB40","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(97)00056-X","article-title":"Composition and behaviours of probabilistic I\/O automata","volume":"176","author":"Wu","year":"1997","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/S0304-3975(01)00294-8_BIB41","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0165-0114(91)90100-5","article-title":"A new approach for fuzzy topology (I)","volume":"39","author":"Ying","year":"1991","journal-title":"Fuzzy Sets and Systems"},{"issue":"2","key":"10.1016\/S0304-3975(01)00294-8_BIB42","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0165-0114(92)90181-3","article-title":"A new approach for fuzzy topology (II)","volume":"47","author":"Ying","year":"1992","journal-title":"Fuzzy Sets and Systems"},{"issue":"2","key":"10.1016\/S0304-3975(01)00294-8_BIB43","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0165-0114(93)90132-2","article-title":"A new approach for fuzzy topology (III)","volume":"55","author":"Ying","year":"1993","journal-title":"Fuzzy Sets and Systems"},{"issue":"3","key":"10.1016\/S0304-3975(01)00294-8_BIB44","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0165-0114(93)90215-4","article-title":"Fuzzifying topology based on complete residuated lattice-valued logic (I)","volume":"56","author":"Ying","year":"1993","journal-title":"Fuzzy Sets and Systems"},{"key":"10.1016\/S0304-3975(01)00294-8_BIB45","unstructured":"M.S. Ying, Bisimulation indexes and their applications, Theoretical Computer Science (2001), accepted for publication."},{"key":"10.1016\/S0304-3975(01)00294-8_BIB46","series-title":"Topology in Process Calculus: Approximate Correctness and Infinite Evolution of Concurrent Programs","author":"Ying","year":"2001"},{"key":"10.1016\/S0304-3975(01)00294-8_BIB47","series-title":"Proc., CONCUR\u201994, Uppsala, Sweden, August 1994","first-page":"497","article-title":"Fully abstract characterisations of testing preorders for probabilistic processes","volume":"vol. 836","author":"Yuen","year":"1994"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002948?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002948?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T07:56:13Z","timestamp":1578470173000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501002948"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":47,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0304397501002948"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00294-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}