{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:00Z","timestamp":1725663660013},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540551799"},{"type":"electronic","value":"9783540467632"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55179-4_30","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T09:51:28Z","timestamp":1330249888000},"page":"310-321","source":"Crossref","is-referenced-by-count":3,"title":["Efficient algorithms for verification of equivalences for probabilistic processes"],"prefix":"10.1007","author":[{"given":"Linda","family":"Christoff","sequence":"first","affiliation":[]},{"given":"Ivan","family":"Christoff","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"30_CR1","unstructured":"A.V. Aho, J.E. Hopcroft, J.D. Ullman. The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974."},{"key":"30_CR2","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"J. A. Bergstra","year":"1984","unstructured":"J.A. Bergstra, J.W. Klop. Process algebra for synchronous communication. Information and Control60, pp 109\u2013137, 1984.","journal-title":"Information and Control"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"I. Christoff. A method for verification of trace and test equivalence. In Proc. Intl. Workshop on Automatic Verification Methods for Finite State Systems, LNCS 407, pp 81\u201388, Springer-Verlag, 1990.","DOI":"10.1007\/3-540-52148-8_7"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"I. Christoff. Testing equivalences and fully abstract models for probabilistic processes. In Proc. CONCUR '90, LNCS 458, pp 126\u2013140, Springer-Verlag, 1990.","DOI":"10.1007\/BFb0039056"},{"key":"30_CR5","volume-title":"PhD thesis, DoCS 90\/22","author":"I. Christoff","year":"1990","unstructured":"I. Christoff. Testing Equivalences for Probabilistic Processes. PhD thesis, DoCS 90\/22, Dept. of Computer Systems, Uppsala University, Sweden, 1990."},{"key":"30_CR6","volume-title":"Technical report, DoCS 91\/28","author":"L. Christoff","year":"1991","unstructured":"L. Christoff. Efficient Algorithms for Verification of Equivalences for Probabilistic Processes. Technical report, DoCS 91\/28, Dept. of Computer Systems, Uppsala University, Sweden, 1991."},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"R. Cleaveland, J. Parrow, B. Steffen. The concurrency workbench. In Proc. Intl. Workshop on Automatic Verification Methods for Finite State Systems, LNCS 407, pp 24\u201337, Springer-Verlag, 1990.","DOI":"10.1007\/3-540-52148-8_3"},{"key":"30_CR8","unstructured":"A. Giacalone, C.-C. Jou, S.A. Smolka. Algebraic reasoning for probabilistic concurrent systems. In Proc. Working Conf. on Programming Concepts and Methods, Sea of Galilee, Israel, 1990."},{"key":"30_CR9","volume-title":"Technical Report R 89-19","author":"J. C. Godskesen","year":"1989","unstructured":"J.C. Godskesen, K.G. Larsen, M. Zeeberg. TAV Users Manual. Technical Report R 89-19, Dept. of Mathematics and Computer Science, University of Aalborg, Denmark, 1989."},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"H. Hansson, 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":"30_CR11","doi-asserted-by":"crossref","unstructured":"C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"C.-C. Jou, S.A. Smolka. Equivalences, congruences, and complete axiomatizations for probabilistic processes. In Proc. CONCUR '90, LNCS 458, pp 367\u2013383, Springer\u2013Verlag, 1990.","DOI":"10.1007\/BFb0039071"},{"issue":"1","key":"30_CR13","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"P. C. Kanellakis","year":"1990","unstructured":"P.C. Kanellakis, S.A. Smolka. CCS expressions, finite state processes, and three problems of equivalence. Information and Computation 86:1, pp 43\u201368, 1990.","journal-title":"Information and Computation"},{"key":"30_CR14","unstructured":"D.E. Knuth. Fundamental Algorithms, Addison-Wesley, 1968."},{"key":"30_CR15","unstructured":"D.E. Knuth. Seminumerical Algorithms, Addison-Wesley, 1969."},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"K.G. Larsen, A. Skou. Bisimulation through probabilistic testing. In Proc. 16th ACM Symp. on Principles of Programming Languages, pp 344\u2013352, 1989.","DOI":"10.1145\/75277.75307"},{"key":"30_CR17","unstructured":"R. Milner. Communication and Concurrency. Prentice Hall, 1989."},{"key":"30_CR18","unstructured":"A. Paz. Introduction to Probabilistic Automata, Academic Press, 1971."},{"key":"30_CR19","volume-title":"Technical Report DAIMI FN-19","author":"G. Plotkin","year":"1981","unstructured":"G. Plotkin. A Structural Approach to Operational Semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, Aarhus, Denmark, 1981."},{"key":"30_CR20","doi-asserted-by":"crossref","unstructured":"W.-G. Tzeng. A polynomial-time algorithm for the equivalence of probabilistic automata. SIAM Journal on Computing. To appear.","DOI":"10.1137\/0221017"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55179-4_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T04:14:27Z","timestamp":1640924067000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55179-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540551799","9783540467632"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-55179-4_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}