{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:04Z","timestamp":1725663664794},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544302"},{"type":"electronic","value":"9783540383574"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54430-5_107","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:48:44Z","timestamp":1330210124000},"page":"470-479","source":"Crossref","is-referenced-by-count":2,"title":["Efficient verification of determinate processes"],"prefix":"10.1007","author":[{"given":"Huajun","family":"Qin","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"33_CR1","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974."},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"D. Coppersmith and S. Winograd. Matrix multiplication via arithmic progressions. In Proceedings 19th ACM Symposium on Theory of Computing, pages 1\u20136, New York City, NY, 1987.","DOI":"10.1145\/28395.28396"},{"key":"33_CR3","unstructured":"R. de Simone and D. Vergamini. Aboard AUTO. Technical Report 111, INRIA, Centre Sophia-Antipolis, Valbonne Cedex, 1989."},{"key":"33_CR4","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0304-3975(85)90028-3","volume":"36","author":"J. Engelfriet","year":"1985","unstructured":"J. Engelfriet. Determinacy \u2192 (observational equivalence = trace equivalence). Theoretical Computer Science, 36:21\u201325, 1985.","journal-title":"Theoretical Computer Science"},{"key":"33_CR5","series-title":"Technical Report","volume-title":"An Implementation of an Efficient Algorithm for Bisimulation Equivalence","author":"J. Fernandez","year":"1989","unstructured":"J. Fernandez. An Implementation of an Efficient Algorithm for Bisimulation Equivalence. Technical Report, LGI-IMAG, Genoble, 1989."},{"key":"33_CR6","unstructured":"J. C. Fernandez and Laurent Mounier. Verifying bisimulations \u201con the fly\u201d. In Proceedings of FORTE'90, 1990."},{"key":"33_CR7","unstructured":"Jan Friso Groote and Frits Vaandrager. An efficient algorithm for branching bisimulation and stuttering equivalence. In Proceedings of ICALP 90, 1990."},{"key":"33_CR8","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/B978-0-12-417750-5.50022-1","volume-title":"The of Machines and Computations","author":"J. E. Hopcroft","year":"1971","unstructured":"J. E. Hopcroft. An n log n algorithm for minimizing states in a finite automata. In Z. Kohavi and A. Paz, editors, The of Machines and Computations, pages 189\u2013196, Academic Press, New York, 1971."},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"P.C. Kanellakis and S.A. Smolka. CCS expressions, finite state processes, and three problems of equivalence. In the Second Annual ACM Symposium on Principles of Distributed Computing, pages 228\u2013240, Aug. 1983.","DOI":"10.1145\/800221.806724"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"R. Milner. Calculus for communicating systems. In LNCS 92, Springer Verlag, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"33_CR11","unstructured":"R. Milner. Operational and Algebraic Semantics of Concurrent Processes. Technical Report ECS-LFCS-88-46, Laboratory for Foundations of Computer Science, Univ. of Edinburgh, Feb. 1988."},{"key":"33_CR12","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall International, 1989."},{"key":"33_CR13","unstructured":"Laurent Mounier. Private communication. 1991."},{"issue":"6","key":"33_CR14","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"R. Paige and R. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973\u2013989, 1987.","journal-title":"SIAM Journal on Computing"},{"key":"33_CR15","unstructured":"H. Qin. Automated Design and Verification of Concurrent Systems. PhD thesis, State University of New York at Stony Brook, 1991. (in preparation)."},{"issue":"2","key":"33_CR16","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. E. Tarjan","year":"1972","unstructured":"R. E. Tarjan. Depth first search and linear graph algorithms. SIAM J. Computing, 1(2):146\u2013160, 1972.","journal-title":"SIAM J. Computing"},{"key":"33_CR17","unstructured":"R. J. van Glabbeek and W. P. Weijland. Branching time and abstraction in bisimulation semantics (extended abstract). In G.X Ritter, editor, Information Processing 89, pages 613\u2013618, Elsevier Science Publishers B.V., North Holland, 1989."}],"container-title":["Lecture Notes in Computer Science","CONCUR '91"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54430-5_107.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:54:19Z","timestamp":1605646459000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54430-5_107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544302","9783540383574"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-54430-5_107","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}