{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:22:10Z","timestamp":1725495730180},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540643012"},{"type":"electronic","value":"9783540697213"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0052363","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T01:31:11Z","timestamp":1149643871000},"page":"91-105","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Unification and matching in process algebras"],"prefix":"10.1007","author":[{"given":"Qing","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paliath","family":"Narendran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandeep K.","family":"Shukla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,18]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"A. Aiken and D. Kozen and M. Vardi and E. Wimmers. The Complexity of Set Constraints. Proceedings of Computer Science Logic, (E. B\u00f6rger, Y. Gurevich and K. Meinke, eds.) 1993, 1\u201317.","DOI":"10.1007\/BFb0049320"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1006\/jsco.1996.0009","volume":"21","author":"F. Baader","year":"1996","unstructured":"F. Baader and K.U. Schulz. Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures. J. of Symbolic Computation, 21:211\u2013243, 1996.","journal-title":"J. of Symbolic Computation"},{"key":"8_CR3","unstructured":"J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science, Vol. 18, Cambridge University Press, Cambridge, England."},{"issue":"3","key":"8_CR4","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/S0022-0000(70)80041-1","volume":"4","author":"J. Doner","year":"1970","unstructured":"J. Doner. Tree acceptors and some of their applications. Journal of Computer and System Sciences 4(3):406\u2013451, 1970.","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"8_CR5","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","volume":"1","author":"W. Dowling","year":"1984","unstructured":"W. Dowling and J. Gallier. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. Journal of Logic Programming, 1(3):267\u2013284, 1984.","journal-title":"Journal of Logic Programming"},{"key":"8_CR6","volume-title":"PhD thesis","author":"Q. Guo","year":"1997","unstructured":"Q. Guo. Nilpotence, Bisimulation and the Unification Workbench. PhD thesis, State University of New York at Albany, 1997."},{"key":"8_CR7","unstructured":"M. Hennessy. Algebraic Theory of Processes. Foundations of Computing Series, The MIT Press, 1988."},{"key":"8_CR8","unstructured":"R. Milner. Communication and Concurrency. International Series in Computer Science. Prentice Hall, 1989. SU Fisher Research 511\/24."},{"issue":"1","key":"8_CR9","doi-asserted-by":"crossref","first-page":"49","DOI":"10.3233\/FI-1996-25105","volume":"25","author":"P. Narendran","year":"1996","unstructured":"P. Narendran. Unification modulo ACI + 1 + 0. Fundamenta Informaticae 25 (1):49\u201357, 1996.","journal-title":"Fundamenta Informaticae"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"M.O. Rabin. Weakly definable relations and special automata. In: Mathematical Logic and Foundations of Set Theory (Y. Bar-Hillel, ed.), North-Holland, 1970, 1\u201323.","DOI":"10.1016\/S0049-237X(08)71929-3"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"W. Thomas. Automata on infinite objects. Handbook of Theoretical Computer Science (J. van Leeuwen, ed.), Elsevier Science Publishers, 1990, 133\u2013191.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"8_CR12","volume-title":"Technical Report CS-R9029","author":"R.J. Glabbeek van","year":"1990","unstructured":"R.J. van Glabbeek. The linear time\u2014branching time spectrum. Technical Report CS-R9029, Computer Science Department, CWI, Centre for Mathematics and Computer Science, Netherlands, 1990."},{"issue":"3","key":"8_CR13","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"R.J. Glabbeek van","year":"1996","unstructured":"R.J. van Glabbeek and Peter Weijland. Branching Time and Abstraction in Bisimulation Semantics. Journal of the ACM 43 (3), May 1996, 555\u2013600.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0052363","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,15]],"date-time":"2020-04-15T05:13:42Z","timestamp":1586927622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0052363"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540643012","9783540697213"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0052363","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"18 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}