{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T16:24:15Z","timestamp":1649175855990},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540660101","type":"print"},{"value":"9783540487784","type":"electronic"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48778-6_1","type":"book-chapter","created":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T06:18:07Z","timestamp":1178000287000},"page":"1-18","source":"Crossref","is-referenced-by-count":4,"title":["Fully Abstract Characterization of Probabilistic May Testing"],"prefix":"10.1007","author":[{"given":"Bengt","family":"Jonsson","sequence":"first","affiliation":[]},{"given":"Wang","family":"Yi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,4,30]]},"reference":[{"issue":"23","key":"1_CR1","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0304-3975(87)90065-X","volume":"53","author":"S. Abramsky","year":"1987","unstructured":"Samson Abramsky. Observation equivalence as a testing equivalence. Theoretical Computer Science, 53(2,3):225\u2013241, 1987.","journal-title":"Theoretical Computer Science"},{"key":"1_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/BFb0039056","volume-title":"Proc. CONCUR, Amsterdam","author":"I. Christoff","year":"1990","unstructured":"I. Christoff. Testing equivalences and fully abstract models for probabilistic processes. In Baeten, editor, Proc. CONCUR, Amsterdam, volume 458 of Lecture Notes in Computer Science, pages 126\u2013140. Springer Verlag, 1990."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"R. Cleaveland, S. Smolka, and A. Zwarico. Testing preorders for probabilistic processes. In Proc. ICALP\u2019 92, 1992.","DOI":"10.1007\/3-540-55719-9_116"},{"key":"1_CR4","unstructured":"C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. In Proc. 29th\nAnnual Symp. Foundations of Computer Science, pages 338\u2013345, 1988."},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola de","year":"1984","unstructured":"R. de Nicola and M. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83\u2013133, 1984.","journal-title":"Theoretical Computer Science"},{"key":"1_CR6","unstructured":"A. Giacalone, C. Jou, and S.A. Smolka. Algebraic reasoning for probabilistic concurrent systems. In Proc. IFIP TC2 Working Conference on Programming Concepts and Methods, Sea of Galilee, April 1990."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"H. Hansson and B. Jonsson. A calculus for communicating systems with time and probabilities. In Proc. 11th\nIEEE Real-Time Systems Symposium, Orlando, Florida, 1990.","DOI":"10.1109\/REAL.1990.128759"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/BF01211866","volume":"6","author":"H. Hansson","year":"1994","unstructured":"H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Aspects of Computing, 6:512\u2013535, 1994.","journal-title":"Formal Aspects of Computing"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"S. Hart and M. Sharir. Probabilistic temporal logics for finite and bounded models. In Proc. 16th\nACM Symp. on Theory of Computing, pages 1\u201313, 1984.","DOI":"10.1145\/800057.808660"},{"key":"1_CR10","unstructured":"C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985."},{"key":"1_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/3-540-58468-4_176","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"B. Jonsson","year":"1994","unstructured":"B. Jonsson, C. Ho-Stuart, and Wang Yi. Testing and refinement for nondeterministic and probabilistic processes. In Langmaack, de Roever, and Vytopil, editors, Formal Techniques in Real-Time and Fault-Tolerant Systems, volume 863 of Lecture Notes in Computer Science, pages 418\u2013430. Springer Verlag, 1994."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"B. Jonsson and Wang Yi. Compositional testing preorders for probabilistic processes. In Proc. 10th\nIEEE Int. Symp. on Logic in Computer Science, pages 431\u2013441, 1995.","DOI":"10.1109\/LICS.1995.523277"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"D. Kozen. A probabilistic pdl. In Proc. 15th\nACM Symp. on Theory of Computing, pages 291\u2013297, 1983.","DOI":"10.1145\/800061.808758"},{"issue":"1","key":"1_CR14","first-page":"1","volume":"94","author":"K.G. Larsen","year":"1991","unstructured":"K.G. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Control, 94(1):1\u201328, 1991.","journal-title":"Information and Control"},{"key":"1_CR15","unstructured":"Gavin Lowe. Probabilities and Priorities in Timed CSP. D.Phil thesis, Oxford, 1993."},{"key":"1_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BFb0013024","volume-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency","author":"Z. Manna","year":"1989","unstructured":"Z. Manna and A. Pnueli. The anchored version of the temporal framework. In de Bakker, de Roever, and Rozenberg, editors, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, volume 354 of Lecture Notes in Computer Science, pages 201\u2013284. Springer Verlag, 1989"},{"key":"1_CR17","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, 1989."},{"issue":"9","key":"1_CR18","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1109\/TC.1982.1676110","volume":"C-31","author":"M.K. Molloy","year":"1982","unstructured":"M.K. Molloy. Performance analysis using stochastic Petri nets. IEEE Trans. on Computers, C-31(9):913\u2013917, Sept. 1982.","journal-title":"IEEE Trans. on Computers"},{"key":"1_CR19","series-title":"Technical Report","volume-title":"A structural approach to operational semantics","author":"G. Plotkin","year":"1981","unstructured":"G. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, Denmark, 1981."},{"issue":"1","key":"1_CR20","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01843570","volume":"1","author":"A. Pnueli","year":"1986","unstructured":"A. Pnueli and L. Zuck. Verification of multiprocess probabilistic protocols. Distributed Computing, 1(1):53\u201372, 1986.","journal-title":"Distributed Computing"},{"issue":"6","key":"1_CR21","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1109\/TSE.1987.233478","volume":"SE-13","author":"S. Purushothaman","year":"1989","unstructured":"S. Purushothaman and P.A. Subrahmanyam. Reasoning about probabilistic behavior in concurrent systems. IEEE Trans. on Software Engineering, SE-13(6):740\u2013745, June 1989.","journal-title":"IEEE Trans. on Software Engineering"},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/S0019-9958(63)90290-0","volume":"6","author":"M.O. Rabin","year":"1963","unstructured":"M.O. Rabin. Probabilistic automata. Information and Control, 6:230\u2013245, 1963.","journal-title":"Information and Control"},{"key":"1_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/3-540-60218-6_17","volume-title":"Proc. CONCUR\u2019 95, 6th Int. Conf. on Concurrency Theory","author":"R. Segala","year":"1995","unstructured":"R. Segala. A compositional trace-based semantics for probabilistic automata. In Proc. CONCUR\u2019 95, 6th\nInt. Conf. on Concurrency Theory, volume 962 of Lecture Notes in Computer Science, pages 234\u2013248. Springer Verlag, 1995."},{"key":"1_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-540-48654-1_35","volume-title":"Proc. CONCUR\u2019 94, 5th Int. Conf. on Concurrency Theory","author":"R. Segala","year":"1994","unstructured":"R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. In Jonsson and Parrow, editors, Proc. CONCUR\u2019 94, 5th\nInt. Conf. on Concurrency Theory, number 836 in Lecture Notes in Computer Science, pages 481\u2013496. Springer Verlag, 1994."},{"issue":"2","key":"1_CR25","first-page":"250","volume":"2","author":"R. Segala","year":"1995","unstructured":"R. Segala and N.A. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250\u2013273, 1995.","journal-title":"Nordic Journal of Computing"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"R. van Glabbeek, S.A. Smolka, B. Steffen, and C. Tofts. Reactive, generative, and stratified models of probabilistic processes. In Proc. 5th\nIEEE Int. Symp. on Logic in Computer Science, pages 130\u2013141, 1990.","DOI":"10.1109\/LICS.1990.113740"},{"key":"1_CR27","unstructured":"M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. 1st\nIEEE Int. Symp. on Logic in Computer Science, pages 332\u2013344, June 1986."},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"M.Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proc. 26th\nAnnual Symp. Foundations of Computer Science, pages 327\u2013338, 1985.","DOI":"10.1109\/SFCS.1985.12"},{"key":"1_CR29","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/978-3-540-48654-1_37","volume-title":"Proc. CONCUR\u2019 94, 5th Int. Conf. on Concurrency Theory","author":"S.-H. Wu","year":"1994","unstructured":"S.-H. Wu, S.A. Smolka, and E.W. Stark. Composition and behaviors of probabilistic I\/O-Automata. In Jonsson and Parrow, editors, Proc. CONCUR\u2019 94, 5th\nInt. Conf. on Concurrency Theory, number 836 in Lecture Notes in Computer Science, pages 513\u2013528. Springer Verlag, 1994."},{"key":"1_CR30","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1007\/3-540-58468-4_190","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"W. Yi","year":"1994","unstructured":"Wang Yi. Algebraic reasoning for real-time probabilistic processes with uncertain information. In Langmaack, de Roever, and Vytopil, editors, Formal Techniques in Real-Time and Fault-Tolerant Systems, volume 863 of Lecture Notes in Computer Science, pages 680\u2013693. Springer Verlag, 1994."},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Wang Yi and K. Larsen. Testing probabilistic and nondeterministic processes. In Protocol Specification, Testing, and Verification XII, 1992.","DOI":"10.1016\/B978-0-444-89874-6.50010-6"},{"key":"1_CR32","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/978-3-540-48654-1_36","volume-title":"5th Int. Conf. on Concurrency Theory","author":"S. Yuen","year":"1994","unstructured":"S. Yuen, R. Cleaveland, Z. Dayar, and S.A. Smolka. Fully abstract characterizations of testing preorders for probabilistic processes. In Jonsson and Parrow, editors, Proc. CONCUR\u2019 94, 5th\nInt. Conf. on Concurrency Theory, number 836 in Lecture Notes in Computer Science, pages 497\u2013512. Springer Verlag, 1994"}],"container-title":["Formal Methods for Real-Time and Probabilistic Systems","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48778-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T06:45:49Z","timestamp":1550299549000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48778-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540660101","9783540487784"],"references-count":32,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-48778-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"published":{"date-parts":[[1999]]}}}