{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:58Z","timestamp":1725663658225},"publisher-location":"Berlin, Heidelberg","reference-count":22,"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_23","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T09:51:16Z","timestamp":1330249876000},"page":"233-243","source":"Crossref","is-referenced-by-count":1,"title":["An automated proof technique for finite-state machine equivalence"],"prefix":"10.1007","author":[{"given":"Wenbo","family":"Mao","sequence":"first","affiliation":[]},{"given":"George J.","family":"Milne","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"23_CR1","volume-title":"Series in Computer Science and Information Processing","author":"A. V. Aho","year":"1983","unstructured":"A.V. Aho, J. E. Hopcroft, and J.D. Ullman. Data Structures and Algorithms. Series in Computer Science and Information Processing. Addison-Wesley, Reading, MA, 1983."},{"key":"23_CR2","unstructured":"A. Bailey, G.A. McCaskill, J. McIntosh, and G.J. Milne. The description and automatic verification of digital circuits in CIRCAL. In Advanced Research Workshop on Correct Hardware Design Methodologies, pages 265\u2013280, Turin, Italy, June 1991."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"J.A. Bergstra and J.W. Klop. Process algebra for synchronous communication. Information and Computation, 60(1\/3), 1984.","DOI":"10.1016\/S0019-9958(84)80025-X"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"R. Cleaveland and M.C.B. Hennessy. Testing equivalence as a bisimulation equivalence. In J. Sifakis, editor, Lecture Notes in Computer Science 407, pages 11\u201323. Springer-Verlag, 1989.","DOI":"10.1007\/3-540-52148-8_2"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench. In J. Sifakis, editor, Lecture Notes in Computer Science 407, pages 24\u201337. Springer-Verlag, 1989.","DOI":"10.1007\/3-540-52148-8_3"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"R. de Nicola and M.C.B. Hennessy. Testing equivalence for processes. Theoretical Computer Science, 34(1 and 2), 1984.","DOI":"10.1016\/0304-3975(84)90113-0"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"R. de Nicola, P. Inverardi, and M. Nesi. Using the axiomatic presentation of behavioural equivalences for manipulating ces specifications. In J. Sifakis, editor, Lecture Notes in Computer Science 407, pages 54\u201367. Springer-Verlag, 1989.","DOI":"10.1007\/3-540-52148-8_5"},{"key":"23_CR8","unstructured":"M.C.B. Hennessy. Algebraic Theory of Processes. The MIT Press, 1988."},{"issue":"1","key":"23_CR9","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. C. B. B. Hennessy","year":"1985","unstructured":"M.C.B. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Jounal of the Association of Computing Machinery, 32(1):137\u2013161, 1985.","journal-title":"Jounal of the Association of Computing Machinery"},{"key":"23_CR10","first-page":"87","volume-title":"PhD thesis","author":"M. Hillerst\u00f6m","year":"1987","unstructured":"M. Hillerst\u00f6m. Verification of CCS-Processes. PhD thesis, Aalborg University Centre, Denmark, 1987. R 87\u201327."},{"key":"23_CR11","unstructured":"C.A.R. Hoare. Communicating Sequential Processes. Series in Computer Science. Prentice Hall International, 1985."},{"key":"23_CR12","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0020-0190(90)90023-Q","volume":"35","author":"P. Inverardi","year":"1990","unstructured":"P. Inverardi and M. Nesi. A rewriting strategy to verify observational congruence. Information Processing Letters, 35:191\u2013199, 1990.","journal-title":"Information Processing Letters"},{"issue":"1","key":"23_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 and S. A. Smolka. CCS expressions, finite state processes, and three problems of equivalence. Information and Computation, 86(1):43\u201368, May 1990.","journal-title":"Information and Computation"},{"key":"23_CR14","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0304-3975(90)90038-J","volume":"72","author":"K. G. Larsen","year":"1990","unstructured":"K.G. Larsen. Proof systems for hennessy-milner logic with recursion. Jounal of Theoretical Computer Science, 72:265\u2013288, 1990.","journal-title":"Jounal of Theoretical Computer Science"},{"key":"23_CR15","unstructured":"L.S. Levy. Fundamental Concepts of Computer Science, Methematical Foundations of Programming. Dorset House Publishing, 1988."},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"G.J. Milne. The representation of communication and concurrency. Technical Report 4088, Caltech, 1980.","DOI":"10.21236\/ADA504936"},{"issue":"23","key":"23_CR17","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0167-9260(83)80017-0","volume":"1","author":"G. J. Milne","year":"1983","unstructured":"G.J. Milne. Circal: A calculus for circuit description. Integration, the VLSI Journal, 1(2,3):121\u2013160, 1983.","journal-title":"Integration, the VLSI Journal"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"G.J. Milne. Circal and the representation of communication, concurrency and time. ACM Transactions on Programming Languages and Systems, 7(2), 1985.","DOI":"10.1145\/3318.3322"},{"key":"23_CR19","unstructured":"R. Milner. Communication and Concurrency. Series in Computer Science. Prentice Hall International, 1989."},{"key":"23_CR20","volume-title":"Technical Report HDV-3-89","author":"F. G. Moller","year":"1989","unstructured":"F.G. Moller. The semantics of Circal. Technical Report HDV-3-89, University of Strathclyde, Department of Computer Science, Glasgow, Scotland, 1989."},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"D. Park. Concurrency and automata in infinite strings. In Lecture Notes in Computer Science 104, pages 167\u2013183. Springer-Verlag, 1981.","DOI":"10.1007\/BFb0017309"},{"key":"23_CR22","volume-title":"Technical Report DAIMI-FN-19","author":"G. D. Plotkin","year":"1981","unstructured":"G.D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI-FN-19, Computer Science Dept, Aarhus Univ, Denmark, 1981."}],"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_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:57:56Z","timestamp":1605646676000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55179-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540551799","9783540467632"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-55179-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}