{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:56Z","timestamp":1761611216043},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664253"},{"type":"electronic","value":"9783540483205"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48320-9_33","type":"book-chapter","created":{"date-parts":[[2007,11,15]],"date-time":"2007-11-15T13:52:42Z","timestamp":1195134762000},"page":"478-493","source":"Crossref","is-referenced-by-count":4,"title":["On Coherence Properties in Term Rewriting Models of Concurrency"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Noll","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,4,19]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1093\/oso\/9780198537465.003.0002","volume":"2","author":"F. Baader","year":"1994","unstructured":"F. Baader and J. Siekmann. Unification theory. In Handbook of Logic in Artificial Intelligence and Logic Programming, volume 2, pages 41\u2013125. Oxford University Press, 1994.","journal-title":"Handbook of Logic in Artificial Intelligence and Logic Programming"},{"issue":"3","key":"33_CR2","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0022-0000(86)90033-4","volume":"32","author":"J. A. Bergstra","year":"1986","unstructured":"J. A. Bergstra and J. W. Klop. Conditional rewrite rules: Confluence and termination. Journal of Computer and System Sciences, 32(3):323\u2013326, 1986.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1-2","key":"33_CR3","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0747-7171(08)80132-0","volume":"11","author":"H. Ganzinger","year":"1991","unstructured":"H. Ganzinger. A completion procedure for conditional equations. Journal of Symbolic Computation, 11(1-2):51\u201382, 1991.","journal-title":"Journal of Symbolic Computation"},{"issue":"4","key":"33_CR4","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1137\/0215084","volume":"15","author":"J.-P. Jouannaud","year":"1986","unstructured":"J.-P. Jouannaud and C. Kirchner. Completion of a set of rules modulo a set of equations. SIAM Journal on Computing, 15(4):1155\u20131194, 1986.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"33_CR5","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J. Meseguer","year":"1992","unstructured":"J. Meseguer. Conditional rewriting logic as a uni\u00e9d model of concurrency. Theoretical Computer Science, 96(1):73\u2013155, April 1992.","journal-title":"Theoretical Computer Science"},{"key":"33_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/3-540-61604-7_64","volume-title":"Seventh International Conference on Concurrency Theory (CONCUR\u201996)","author":"J. Meseguer","year":"1996","unstructured":"J. Meseguer. Rewriting logic as a semantic framework for concurrency: a progress report. In Seventh International Conference on Concurrency Theory (CONCUR\u201996), volume 1119 of Lecture Notes in Computer Science, pages 331\u2013372. Springer-Verlag, August 1996."},{"key":"33_CR7","unstructured":"R. Milner. Communication and Concurrency. International Series in Computer Science. Prentice-Hall, 1989."},{"key":"33_CR8","unstructured":"The Concurrency Workbench of North Carolina. http:\/\/www.csc.ncsu.edu\/eos\/users\/r\/rance\/WWW\/cwb-nc.html ."},{"key":"33_CR9","unstructured":"The Process Algebra Compiler of North Carolina. http:\/\/www.csc.ncsu.edu\/eos\/users\/s\/stsims\/WWW\/pac\/pac-nc.html ."},{"key":"33_CR10","unstructured":"Model checking at CMU. http:\/\/www.cs.cmu.edu\/~modelcheck\/ ."},{"key":"33_CR11","unstructured":"Spin. http:\/\/netlib.bell-labs.com\/netlib\/spin\/whatispin.html ."},{"key":"33_CR12","unstructured":"Truth home page. http:\/\/www-i2.informatik.rwth-aachen.de\/Forschung\/MCS\/Truth\/ ."},{"key":"33_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1007\/3-540-58184-7_138","volume-title":"Proceedings of PARLE\u201994-Parallel Architectures and Languages Europe","author":"P. Viry","year":"1994","unstructured":"P. Viry. Rewriting: An e\u00e9ctive model of concurrency. In Proceedings of PARLE\u201994-Parallel Architectures and Languages Europe, volume 817 of Lecture Notes in Computer Science, pages 648\u2013660. Springer-Verlag, 1994."},{"key":"33_CR14","unstructured":"P. Viry. Rewriting modulo a rewrite system. Technical Report TR-95-20, Universit\u00e0 di Pisa, Dipartimento di Informatica, December 1995."},{"key":"33_CR15","unstructured":"P. Viry. A rewriting implementation of pi-calculus. Technical Report TR-96-30, Universit\u00e0 di Pisa, Dipartimento di Informatica, March 1996."}],"container-title":["Lecture Notes in Computer Science","CONCUR\u201999 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48320-9_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T02:57:50Z","timestamp":1708311470000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48320-9_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664253","9783540483205"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-48320-9_33","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}