{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T06:24:08Z","timestamp":1784183048115,"version":"3.55.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":20,"publisher":"Springer-Verlag","isbn-type":[{"value":"3540530487","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0039071","type":"book-chapter","created":{"date-parts":[[2006,1,31]],"date-time":"2006-01-31T14:58:08Z","timestamp":1138719488000},"page":"367-383","source":"Crossref","is-referenced-by-count":73,"title":["Equivalences, congruences, and complete axiomatizations for probabilistic processes"],"prefix":"10.1007","author":[{"given":"Chi-Chang","family":"Jou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Scott A.","family":"Smolka","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3","key":"26_CR1","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S. Brookes","year":"1984","unstructured":"S. Brookes, C.A.R. Hoare, A. Roscoe, \u201cA theory of communicating sequential processes\u201d, Journal of ACM, 31:3, 560\u2013599 (1984).","journal-title":"Journal of ACM"},{"key":"26_CR2","first-page":"89","volume-title":"CWI Monographs","author":"J.A. Bergstra","year":"1986","unstructured":"J.A. Bergstra, J.W. Klop, \u201cAlgebra of communicating processes,\u201d in CWI Monographs, Proceedings of the CWI Symposium on Mathematics and Computer Science (eds. J.W. de Bakker, M. Hazewinkel and J.K. Lenstra), 89\u2013138, North Holland, Amsterdam (1986)."},{"key":"26_CR3","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1137\/0217073","volume":"17","author":"J.A. Bergstra","year":"1988","unstructured":"J.A. Bergstra, J.W. Klop, E.R. Olderog, \u201cReadies and failures in the algebra of communicating processes,\u201d SIAM Journal of Computing, Vol. 17, 1134\u20131177 (1988).","journal-title":"SIAM Journal of Computing"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"B. Bloom, A.R. Meyer, \u201cA remark on bisimulation between probabilistic processes,\u201d Logik at Botik, LNCS 363, eds. Meyer & Tsailin, Springer-Verlag (1989).","DOI":"10.1007\/3-540-51237-3_4"},{"key":"26_CR5","first-page":"171","volume-title":"On the algebraic specification of finitary infinite communicating sequential processes","author":"M. Broy","year":"1982","unstructured":"M. Broy, M. Wirsing, \u201cOn the algebraic specification of finitary infinite communicating sequential processes,\u201d Working Conference on Formal Description of Programming Concept II, (ed. D. Bj\u00f6rner), Germisch, June 1982, 171\u2013196, North-Holland, Amsterdam (1982)."},{"key":"26_CR6","unstructured":"Ivan Christoff, \u201cTesting equivalences and fully abstract models for probabilistic,\u201d this volume."},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"C. Jones, G. D. Plotkin, \u201cA Probabilistic powerdomain of evaluations\u201d, Proceedings of 4th Annual Symposium on Logic in Computer Science, 186\u2013195 (1989).","DOI":"10.1109\/LICS.1989.39173"},{"key":"26_CR8","unstructured":"R.J. van Glabbeek, \u201cNotes on the methodology of CCS and CSP,\u201d Technical Report CS-R8624, Centre for Mathematics and Computer Science, The Netherlands."},{"key":"26_CR9","unstructured":"R.J. van Glabbeek, \u201cThe linear time \u2014 branching time spectrum,\u201d this volume."},{"key":"26_CR10","unstructured":"A. Giacalone, C. Jou, S. A. Smolka, \u201cAlgebraic reasoning for probabilistic concurrent systems\u201d, Proceedings of Working Conference on Programming Concepts and Methods, IFIP TC 2, Sea of Gallilee, Israel, April 1990."},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"R.J. van Glabbeek, S. A. Smolka, B. Steffen, C. Tofts, \u201cReactive, generative, and stratified models of probabilistic processes,\u201d IEEE Symp. on Logic in Computer Science, Philadelphia, PA., USA, June 1990.","DOI":"10.1109\/LICS.1990.113740"},{"key":"26_CR12","unstructured":"C.A.R. Hoare, Communicating Sequential Processes, Prentice-Hall International (1985)."},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"K.G. Larsen, A. Skou, \u201cBisimulation through probabilistic testing,\u201d Proceedings of 16th ACM Symp. on Principles of Programming Languages, Austin, TX (1989).","DOI":"10.1145\/75277.75307"},{"key":"26_CR14","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R. Milner","year":"1983","unstructured":"R. Milner, \u201cCalculi for synchrony and asynchrony,\u201d Theoret. Comput. Science, Vol.25, 267\u2013310 (1983).","journal-title":"Theoret. Comput. Science"},{"key":"26_CR15","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0022-0000(84)90023-0","volume":"28","author":"R. Milner","year":"1984","unstructured":"R. Milner, \u201cA complete inference system for a class of regular behaviours,\u201d Journal of Computer and System Science, Vol. 28, 439\u2013466 (1984).","journal-title":"Journal of Computer and System Science"},{"key":"26_CR16","unstructured":"R. Milner, Communication and Concurrency, Prentice Hall International Series in Computer Science, United Kingdom (1989)."},{"key":"26_CR17","first-page":"561","volume":"154","author":"E. R. Olderog","year":"1983","unstructured":"E. R. Olderog and C.A.R. Hoare, \u201cSpecification-oriented semantics for communicating processes,\u201d Proceedings of 10th ICALP, Barcelona, ed. J. Diaz, LNCS 154, 561\u2013572, Springer-Verlag (1983).","journal-title":"LNCS"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"D. Park, \u201cConcurrency and automata on infinite sequences\u201d, Proc. 5th GI Conference, LNCS 104, Springer-Verlag (1981).","DOI":"10.1007\/BFb0017309"},{"key":"26_CR19","unstructured":"G. D. Plotkin, \u201cA structural approach to operational semantics,\u201d Technical Report DAIMI FN-19, Computer Science Department, Aarhus University (1981)."},{"key":"26_CR20","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/S0019-9958(63)90290-0","volume":"6","author":"M.O. Rabin","year":"1963","unstructured":"M.O. Rabin, \u201cProbabilistic automata,\u201d Information and Control, Vol. 6, 230\u2013245 (1963).","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","CONCUR '90 Theories of Concurrency: Unification and Extension"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0039071.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:24:28Z","timestamp":1607552668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0039071"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540530487"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0039071","relation":{},"subject":[]}}