{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:29:54Z","timestamp":1761611394812},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540583295"},{"type":"electronic","value":"9783540486541"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/978-3-540-48654-1_36","type":"book-chapter","created":{"date-parts":[[2016,5,10]],"date-time":"2016-05-10T09:34:34Z","timestamp":1462872874000},"page":"497-512","source":"Crossref","is-referenced-by-count":6,"title":["Fully Abstract Characterizations of Testing Preorders for Probabilistic Processes"],"prefix":"10.1007","author":[{"given":"Shoji","family":"Yuen","sequence":"first","affiliation":[]},{"given":"Rance","family":"Cleaveland","sequence":"additional","affiliation":[]},{"given":"Zeynep","family":"Dayar","sequence":"additional","affiliation":[]},{"given":"Scott A.","family":"Smolka","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","volume-title":"J. C. M. Baeten and J. W. Klop, editors, Proceedings of CONCUR 90 \u2014 First Intl. Conf. on Concurrency Theory, volume 458 of Lecture Notes in Computer Science, pages 126-140. Springer-Verlag","author":"I Christoff","year":"1990","unstructured":"I. Christoff. Testing equivalences and fully abstract models for probabilistic processes. In J. C. M. Baeten and J. W. Klop, editors, Proceedings of CONCUR \u201990 \u2014 First Intl. Conf. on Concurrency Theory, volume 458 of Lecture Notes in Computer Science, pages 126\u2013140. Springer-Verlag, 1990."},{"key":"36_CR2","first-page":"708","volume-title":"Proceedings of the 19th ICALP, volume 623 of Lecture Notes in Computer Science","author":"R Cleaveland","year":"1992","unstructured":"R. Cleaveland, S. A. Smolka, and A. E. Zwarico. Testing preorders for probabilistic processes. In Proceedings of the 19th ICALP, volume 623 of Lecture Notes in Computer Science, pages 708\u2013719. Springer Verlag, July 1992."},{"key":"36_CR3","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF00264365","volume":"24","author":"R Denicola","year":"1987","unstructured":"R. DeNicola. Extensional equivalences for transition systems. Acta Informatica, 24: 211\u2013237, 1987.","journal-title":"Acta Informatica"},{"key":"36_CR4","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R Denicola","year":"1983","unstructured":"R. DeNicola and M.C.B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34: 83\u2013133, 1983.","journal-title":"Theoretical Computer Science"},{"key":"36_CR5","volume-title":"MIT Press","author":"M.C.B","year":"1988","unstructured":"M.C.B. Hennessy. Algebraic Theory of Processes. MIT Press, 1988."},{"key":"36_CR6","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1109\/REAL.1990.128759","volume-title":"Proceedings of the 11th IEEE Symposium on Real-Time Systems","author":"HA Hansson","year":"1990","unstructured":"H. A. Hansson and B. Jonsson. A calculus for communicating systems with time and probabilities. In Proceedings of the 11th IEEE Symposium on Real-Time Systems, pages 278\u2013287, 1990."},{"key":"36_CR7","first-page":"1989","volume-title":"Preliminary versions of this paper appeared as University of Aalborg technical reports R 88-18 and R 88-29, and in Proceedings of the 16th Annual ACM Symposium on Principles of Programming Languages","author":"KG Larsen","year":"1992","unstructured":"K. G. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1): 1\u201328, September 1992. Preliminary versions of this paper appeared as University of Aalborg technical reports R 88\u201318 and R 88\u201329, and in Proceedings of the 16th Annual ACM Symposium on Principles of Programming Languages, Austin, Texas, 1989."},{"key":"36_CR8","volume-title":"Proceedings of CONCUR 92, volume 630 of Lecture Notes in Computer Science, pages 456-471. Springer-Verlag","author":"KG Larsen","year":"1992","unstructured":"K. G. Larsen and A. Skou. Compositional verification of probabilistic processes. In Proceedings of CONCUR \u201992, volume 630 of Lecture Notes in Computer Science, pages 456\u2013471. Springer-Verlag, 1992."},{"key":"36_CR9","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/41840.41852","volume-title":"Proceeding the 6th Annual ACM symposium on Principles of Distributed Computing","author":"NA Lynch","year":"1987","unstructured":"N.A. Lynch and M. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proceeding the 6th Annual ACM symposium on Principles of Distributed Computing, pages 137\u2013151, 1987."},{"key":"36_CR10","volume-title":"Prentice Hall","author":"R","year":"1989","unstructured":"R. Milner. Communication and Concurrency. Prentice Hall, 1989."},{"key":"36_CR11","first-page":"130","volume-title":"Proceedings of the 5th IEEE Symposium on Logic in Computer Science","author":"RJ Glabbeek","year":"1990","unstructured":"R. J. van Glabbeek, S. A. Smolka, B. Steffen, and C. M. N. Tofts. Reactive, generative, and stratified models of probabilistic processes. In Proceedings of the 5th IEEE Symposium on Logic in Computer Science, pages 130\u2013141, Philadelphia, PA, 1990."},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"S. Wu, S.A. Smolka, and E.W. Stark. Composition and behaviors of probabilistic I\/O automata. In Proceedings of CONCUR \u201994, Lecture Notes in Computer Science. Springer Verlag, 1994.","DOI":"10.1007\/978-3-540-48654-1_37"},{"key":"36_CR13","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/B978-0-444-89874-6.50010-6","volume-title":"Protocol Specification, Testing and Verification XII","author":"W Yi","year":"1992","unstructured":"W. Yi and Kim G. Larsen. Testing probabilistic and nondeterministic processes. In Protocol Specification, Testing and Verification XII, pages 47\u201361, 1992."}],"container-title":["Lecture Notes in Computer Science","CONCUR '94: Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-48654-1_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,7]],"date-time":"2019-09-07T09:40:52Z","timestamp":1567849252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-48654-1_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540583295","9783540486541"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-48654-1_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}