{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T02:42:16Z","timestamp":1648953736138},"publisher-location":"Berlin\/Heidelberg","reference-count":31,"publisher":"Springer-Verlag","isbn-type":[{"value":"0387973753","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0040264","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T17:01:43Z","timestamp":1155834103000},"page":"301-318","source":"Crossref","is-referenced-by-count":1,"title":["Termination, deadlock and divergence"],"prefix":"10.1007","author":[{"given":"L.","family":"Aceto","sequence":"first","affiliation":[]},{"given":"M.","family":"Hennessy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0304-3975(87)90065-X","volume":"53","author":"S. Abramsky","year":"1987","unstructured":"S. Abramsky, Observation Equivalence as a Testing Equivalence, TCS 53, pp. 225\u2013241, 1987","journal-title":"TCS"},{"key":"13_CR2","unstructured":"S. Abramsky, A Domain Equation for Bisimulation, Imperial College Technical Report, 1987"},{"key":"13_CR3","unstructured":"J. C. M. Baeten and R. J. van Glabbeek, Abstraction and Empty Process in Process Algebra, Report CS-R8721, CWI Amsterdam, 1987 (to appear in Fundamenta Informaticae)"},{"key":"13_CR4","first-page":"153","volume":"287","author":"J. C. M. Baeten","year":"1987","unstructured":"J. C. M. Baeten and R. J. van Glabbeek, Merge and Termination in Process Algebra, Proceedings 7th Conference on Foundations of Software Technology and T.C.S. (K.V. Nori ed.), LNCS 287, pp. 153\u2013172, Springer Verlag, 1987","journal-title":"LNCS"},{"issue":"3","key":"13_CR5","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S. D. Brookes","year":"1984","unstructured":"S. D. Brookes, C. A. R. Hoare and A. W. Roscoe, A Theory of Communicating Sequential Processes, JACM 31,3, pp. 560\u2013599, 1984","journal-title":"JACM"},{"key":"13_CR6","unstructured":"J. A. Bergstra and J. W. Klop, Fixed Point Semantics in Process Algebra, Report IW 206\/82, Centre for Mathematics and Computer Science, Amsterdam, 1982"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"J. A. Bergstra","year":"1984","unstructured":"J. A. Bergstra and J. W. Klop, Process Algebra for Synchronous Communication, Information and Control, 60, pp. 109\u2013137, 1984","journal-title":"Information and Control"},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"J. A. Bergstra","year":"1985","unstructured":"J. A. Bergstra and J. W. Klop, Algebra of Communicating Processes with Abstraction, TCS 37, 1, pp. 77\u2013121, 1985","journal-title":"TCS"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"B. Courcelle and M. Nivat, Algebraic Families of Interpretations, Proceedings 17th IEEE Symposium on Foundations of Computer Science, 1976","DOI":"10.1109\/SFCS.1976.3"},{"issue":"1","key":"13_CR10","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola De","year":"1987","unstructured":"R. De Nicola and M. Hennessy, Testing Equivalences for Processes, TCS 34,1, pp. 83\u2013134, 1987","journal-title":"TCS"},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/321992.321997","volume":"24","author":"J. A. Goguen","year":"1977","unstructured":"J. A. Goguen, J. W. Thatcher, E. G. Wagner and J. B. Wright, Initial Algebra Semantics and Continuous Algebras, JACM 24,1, pp. 68\u201395, 1977","journal-title":"JACM"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10284-1","volume-title":"Algebraic Semantics","author":"I. Guessarian","year":"1981","unstructured":"I. Guessarian, Algebraic Semantics, Lecture Notes in Computer Science vol. 99, Springer-Verlag, Berlin, 1981"},{"issue":"1","key":"13_CR13","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/S0019-9958(81)90082-6","volume":"51","author":"M. Hennessy","year":"1981","unstructured":"M. Hennessy, A Term Model for Synchronous Processes, Information and Control 51,1, pp. 58\u201375, 1981","journal-title":"Information and Control"},{"issue":"4","key":"13_CR14","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1145\/4221.4249","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"M. Hennessy, Acceptance Trees, JACM 32,4, pp. 896\u2013928, 1985","journal-title":"JACM"},{"key":"13_CR15","unstructured":"M. Hennessy, Algebraic Theory of Processes, MIT Press, 1988"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"M. Hennessy, Axiomatising Finite Concurrent Processes, SIAM Journal on Computing, October 1988","DOI":"10.1137\/0217063"},{"issue":"1","key":"13_CR17","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"M. Hennessy and R. Milner, Algebraic Laws for Nondeterminism and Concurrency, JACM 32,1, pp. 137\u2013161, 1985","journal-title":"JACM"},{"key":"13_CR18","unstructured":"C. A. R. Hoare, Communicating Sequential Processes, Prentice-Hall, 1985"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"M. Hennessy and G. Plotkin, Full Abstraction for a Simple Parallel Programming Language, Proc. MFCS, Lecture Notes in Computer Science vol. 74, Springer-Verlag, 1979","DOI":"10.1007\/3-540-09526-8_8"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"M. Hennessy and G. Plotkin, A Term Model for CCS, Proceedings 9th MFCS, Lecture Notes in Computer Science vol. 88, Springer-Verlag, 1980","DOI":"10.1007\/BFb0022510"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"J. Loeckx and K. Sieber, The Foundations of Program Verification (2 nd edition), Wiley-Teubner Series in Computer Science, 1987","DOI":"10.1007\/978-3-322-96753-4"},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","volume":"4","author":"R. Milner","year":"1977","unstructured":"R. Milner, Fully Abstract Models of Typed Lambda-Calculi, TCS 4, pp. 1\u201322, 1977","journal-title":"TCS"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"R. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science Vol. 92, Springer-Verlag, 1980","DOI":"10.1007\/3-540-10235-3"},{"key":"13_CR24","first-page":"23","volume":"112","author":"R. Milner","year":"1981","unstructured":"R. Milner, A Modal Characterization of Observable Machine-Behaviour, Proc. 6th CAAP, Lecture Notes in Computer Science vol. 112, pp. 23\u201334, Springer-Verlag, 1981","journal-title":"Lecture Notes in Computer Science"},{"key":"13_CR25","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R. Milner","year":"1983","unstructured":"R. Milner, Calculi for Synchrony and Asynchrony, TCS 25, pp. 267\u2013310, 1983","journal-title":"TCS"},{"key":"13_CR26","unstructured":"R. Milner, Operational and Algebraic Semantics of Concurrent Processes, LFCS Report Series, ECS-LFCS-88-46, February 1988 (to appear as a chapter of the Handbook of Theoretical Computer Science)"},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"D. Park, Concurrency and Automata on Infinite Sequences, Lecture Notes in Computer Science vol. 104, Springer-Verlag, 1981","DOI":"10.1007\/BFb0017309"},{"key":"13_CR28","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G. Plotkin","year":"1977","unstructured":"G. Plotkin, LCF Considered as a Programming Language, TCS 5, pp. 223\u2013255, 1977","journal-title":"TCS"},{"key":"13_CR29","unstructured":"G. Plotkin, A Structural Approach to Operational Semantics, Report DAIMI FN-19, Computer Science Dept., Aarhus University, 1981"},{"key":"13_CR30","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(87)90012-0","volume":"49","author":"C. Stirling","year":"1987","unstructured":"C. Stirling, Modal Logics for Communicating Systems, TCS 49, pp. 311\u2013347, 1987","journal-title":"TCS"},{"key":"13_CR31","unstructured":"D. Walker, Bisimulation Equivalence and Divergence in CCS, LFCS Report Series, ECS-LFCS-87-29, June 1987 (extended abstract in Proc. LICS 1988)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Programming Semantics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0040264.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:39:57Z","timestamp":1607549997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0040264"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["0387973753"],"references-count":31,"URL":"http:\/\/dx.doi.org\/10.1007\/bfb0040264","relation":{}}}