{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:24Z","timestamp":1760202624965,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578871"},{"type":"electronic","value":"9783540483830"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57887-0_108","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:37:46Z","timestamp":1330263466000},"page":"425-439","source":"Crossref","is-referenced-by-count":4,"title":["Term rewriting properties of SOS axiomatisations"],"prefix":"10.1007","author":[{"given":"D. J. B.","family":"Bosscher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"22_CR1","first-page":"113","volume-title":"Full version available as CWI Report CS-R9218","author":"L. Aceto","year":"1992","unstructured":"L. Aceto, B. Bloom, and F.W. Vaandrager. Turning SOS rules into equations. In Proceedings 7th Annual Symposium on Logic in Computer Science, Santa Cruz, California, pages 113\u2013124. IEEE Computer Society Press, 1992. Full version available as CWI Report CS-R9218, June 1992, Amsterdam. To appear in the LICS 92 Special Issue of Information and Computation."},{"unstructured":"G.J. Akkerman and J.C.M. Baeten. Term rewriting analysis in process algebra. Report P9006, Programming Research Group, University of Amsterdam, 1990.","key":"22_CR2"},{"key":"22_CR3","first-page":"229","volume-title":"Technical Report 90-1150","author":"B. Bloom","year":"1988","unstructured":"B. Bloom, S. Istrail, and A.R. Meyer. Bisimulation can't be traced: Preliminary report. In Conference Record of the 15th ACM Symposium on Principles of Programming Languages, San Diego, California, pages 229\u2013239, 1988. Full version available as Technical Report 90-1150, Department of Computer Science, Cornell University, Ithaca, New York, August 1990. Accepted to appear in Journal of the ACM."},{"issue":"2","key":"22_CR4","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/0890-5401(92)90013-6","volume":"100","author":"J.F. Groote","year":"1992","unstructured":"J.F. Groote and F.W. Vaandrager. Structured operational semantics and bisimulation as a congruence. Information and Computation, 100(2):202\u2013260, October 1992.","journal-title":"Information and Computation"},{"key":"22_CR5","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1137\/0215084","volume":"15","author":"J.-P. Jouannaud","year":"1986","unstructured":"J.-P. Jouannaud and H. Kirchner. Completion of a set of rules modulo a set of equations. SIAM Journal of Computing, 15:1155\u20131194, 1986.","journal-title":"SIAM Journal of Computing"},{"doi-asserted-by":"crossref","unstructured":"J.W. Klop. Term rewriting systems. In Handbook of Logic in Computer Science, Volume II. Oxford University Press, 1992. To appear.","key":"22_CR6","DOI":"10.1093\/oso\/9780198537618.003.0001"},{"key":"22_CR7","series-title":"Report 4\/93","volume-title":"PAM: A Process Algebra Manipulator (Version 1.0)","author":"L. Huimin","year":"1993","unstructured":"Huimin Lin. PAM: A Process Algebra Manipulator (Version 1.0). Report 4\/93, Computer Science, University of Sussex, Brighton, February 1993."},{"unstructured":"E. Madelaine, R. de Simone, and D. Vergamini. ECRINS V2-1, USERS MANUAL, 1989.","key":"22_CR8"},{"doi-asserted-by":"crossref","unstructured":"R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, 1980.","key":"22_CR9","DOI":"10.1007\/3-540-10235-3"},{"key":"22_CR10","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall International, Englewood Cliffs, 1989."},{"unstructured":"G.D. Plotkin. A structural approach to operational semantics. Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.","key":"22_CR11"},{"key":"22_CR12","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0304-3975(85)90093-3","volume":"37","author":"R. Simone de","year":"1985","unstructured":"R. de Simone. Higher-level synchronising devices in MEIJE-SCCS. Theoretical Computer Science, 37:245\u2013267, 1985.","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"C. Verhoef. A congruence theorem for structured operational semantics with predicates and negative premises. Computing Science Notes 93\/18, Eindhoven University of Technology, 1993.","key":"22_CR13","DOI":"10.1007\/978-3-540-48654-1_32"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computer Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57887-0_108.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:16:16Z","timestamp":1742595376000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57887-0_108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578871","9783540483830"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-57887-0_108","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}