{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:34Z","timestamp":1761611194160},"reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540558224"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0084809","type":"book-chapter","created":{"date-parts":[[2006,11,24]],"date-time":"2006-11-24T13:12:14Z","timestamp":1164373934000},"page":"456-471","source":"Crossref","is-referenced-by-count":42,"title":["Compositional verification of probabilistic processes"],"prefix":"10.1007","author":[{"given":"Kim G.","family":"Larsen","sequence":"first","affiliation":[]},{"given":"Arne","family":"Skou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"H Andersen and G Winskel. Compositional Checking of Satisfaction. In Proceedings of CAV '91, 1991.","DOI":"10.1007\/3-540-55179-4_4"},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"J. Bergstra","year":"1984","unstructured":"J. Bergstra and J. Klop. Process algebra for synchronous communication. Information and Control, 60:109\u2013137, 1984.","journal-title":"Information and Control"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"B. Bloom and A. Meyer. A remark on bisimulation between probabilistic processes. In A. Meyer and M. Taitslin, editors, Logic at Botik '89, volume 363 of Lecture Notes in Computer Science, pages 26\u201340, 1989.","DOI":"10.1007\/3-540-51237-3_4"},{"key":"32_CR4","unstructured":"I. Christoff. Tesing Equivalences for Probabilistic Processes. PhD thesis, Uppsala University, 1990."},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"R. Cleaveland, S. A. Smolka, and A. Zwarico. Testing Preorders for Probabilistic Processes. To appear in Proceedings of ICALP '92, 1991.","DOI":"10.1007\/3-540-55719-9_116"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"R. Fagin, J. Y. Halpern, and N. Megiddo. A Logic for Reasoning about Probabilities. In Proceedings of LICS '88, pages 410\u2013421, 1988.","DOI":"10.1109\/LICS.1988.5138"},{"key":"32_CR7","unstructured":"A. Giacalone, C. Jou, and S. Smolka. Algebraic Reasoning for Probabilistic Concurrent Systems. In Proceedings of Working Conference on Programming Concetps and Methods. IFIP TC2, 1990."},{"key":"32_CR8","unstructured":"M. Hennessy. Algebraic Theory of Processes. MIT Press, 1988."},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"H. Hansson and B. Jonsson. A Calculus for Communicating Systems with Time and Probabilities. In Proc. 11th IEEE Real-Time Systems Symposium, Orlando, Florida, 1990.","DOI":"10.1109\/REAL.1990.128759"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the Association for Computing Machinery, pages 137\u2013161, 1985.","DOI":"10.1145\/2455.2460"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"C. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"B. Jonsson and K. G. Larsen. Specification and Refinement of Probabilistic Processes. In Proceedings of LICS '91, 1991.","DOI":"10.1109\/LICS.1991.151651"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"C. Jones and G. Plotkin. A Probabilistic Powerdomain of Evaluations. In Proceedings of 4th LICS, 1989.","DOI":"10.1109\/LICS.1989.39173"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"D. Kozen. Semantics of Probabilistic Programs. JCSS, 22, 1981.","DOI":"10.1016\/0022-0000(81)90036-2"},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"D. Kozen. A Probabilistic PDL. In Proceedings 10th ACM POPL, 1983.","DOI":"10.1145\/800061.808758"},{"key":"32_CR16","unstructured":"K.G. Larsen. Ideal specification formalism = expressivity + compositionality + decidability + testability + ... Lecture Notes in Computer Science, 458, 1990. Invited paper at CONCUR'90."},{"key":"32_CR17","doi-asserted-by":"crossref","unstructured":"K. G. Larsen. The Expressive Power of Implicit Specifications. In Proceedings of ICALP '91, 1991.","DOI":"10.1007\/3-540-54233-7_135"},{"key":"32_CR18","doi-asserted-by":"crossref","unstructured":"K.G. Larsen and A. Skou. Bisimulation through probabilistic testing: Preliminary report. In Proceedings 16'th ACM POPL, 1989. Full version in Information and Computation vol 94 no 1, 1991.","DOI":"10.1016\/0890-5401(91)90030-6"},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"K. G. Larsen and L. Xinxin. Compositionality through an Operarional Semantics of Contexts. In Proceedings of ICALP '90,1990. Full version in Journal of Logic Computation, vol. 1 no. 6, pp 761\u2013795, 1991.","DOI":"10.1093\/logcom\/1.6.761"},{"key":"32_CR20","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R. Milner","year":"1983","unstructured":"R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25:267\u2013310, 1983.","journal-title":"Theoretical Computer Science"},{"key":"32_CR21","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, 1989."},{"key":"32_CR22","doi-asserted-by":"crossref","unstructured":"A. Pnueli. Linear and branching structures in the semantics and logics of reactive systems. In W. Braur, editor, ICALP '85, volume 194 of Lecture Notes in Computer Science, pages 15\u201332, 1985.","DOI":"10.1007\/BFb0015727"},{"key":"32_CR23","doi-asserted-by":"crossref","unstructured":"A. Pnueli and L. Zuck. Verification of Multiprocess Probabilistic Protocols. Distributed Computing, 1, 1986.","DOI":"10.1007\/BF01843570"},{"key":"32_CR24","unstructured":"A. Skou. Validation of Concurrent Processes, with emphasis of testing. PhD thesis, Aalborg University Centre, 1989."},{"key":"32_CR25","doi-asserted-by":"crossref","unstructured":"M. Y. Vardi. Automatic Verification of Probabilistic Concurrent Finite-State Programs. In Proceedings 26th IEEE FOCS, 1985.","DOI":"10.1109\/SFCS.1985.12"},{"key":"32_CR26","doi-asserted-by":"crossref","unstructured":"R. van Glabbeek, B. Steffen, S.A. Smolka, and C.M.N. Tofts. Reactive, Generative, and Stratified Models of Probabilistic Processes. In Proceedings of LICS '90, 1990.","DOI":"10.1109\/LICS.1990.113740"}],"container-title":["Lecture Notes in Computer Science","CONCUR '92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0084809.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:07:31Z","timestamp":1607551651000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0084809"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540558224"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/bfb0084809","relation":{},"subject":[]}}