{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:09Z","timestamp":1725664509982},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616047"},{"type":"electronic","value":"9783540706250"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61604-7_83","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:03:42Z","timestamp":1330293822000},"page":"671-686","source":"Crossref","is-referenced-by-count":6,"title":["Refinement in Interworkings"],"prefix":"10.1007","author":[{"given":"S.","family":"Mauw","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. A.","family":"Reniers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"issue":"3","key":"40_CR1","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0890-5401(88)90027-2","volume":"78","author":"J.C.M. Baeten","year":"1988","unstructured":"J.C.M. Baeten and J.A. Bergstra. Global Renaming Operators in Concrete Process Algebra. Information and Computation, 78(3):205\u2013245, 1988.","journal-title":"Information and Computation"},{"key":"40_CR2","unstructured":"J.C.M. Baeten and C. Verhoef. Concrete Process Algebra. In S. Abramsky, D.M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, volume IV: Semantic Modelling, pages 149\u2013268. Oxford University Press, 1995."},{"key":"40_CR3","volume-title":"Cambridge Tracts in Theoretical Computer Science 18","author":"J.C.M. Baeten","year":"1990","unstructured":"J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, Cambridge, 1990."},{"issue":"1\/3","key":"40_CR4","doi-asserted-by":"crossref","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 & Control, 60(1\/3):109\u2013137, 1984.","journal-title":"Information & Control"},{"key":"40_CR5","volume-title":"ITU-TS Recommendation Z.120: Message Sequence Chart (MSC)","author":"ITU-TS","year":"1994","unstructured":"ITU-TS. ITU-TS Recommendation Z.120: Message Sequence Chart (MSC). ITU-TS, Geneva, 1994."},{"key":"40_CR6","volume-title":"ITU-TS Recommendation Z.120 Annex B: Algebraic semantics of Message Sequence Charts","author":"ITU-TS","year":"1995","unstructured":"ITU-TS. ITU-TS Recommendation Z.120 Annex B: Algebraic semantics of Message Sequence Charts. ITU-TS, Geneva, 1995."},{"issue":"4","key":"40_CR7","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1093\/comjnl\/37.4.269","volume":"37","author":"S. Mauw","year":"1994","unstructured":"S. Mauw and M.A. Reniers. An Algebraic Semantics of Basic Message Sequence Charts. The Computer Journal, 37(4):269\u2013277, 1994.","journal-title":"The Computer Journal"},{"key":"40_CR8","unstructured":"S. Mauw and M.A. Reniers. Empty Interworkings and Refinement \u2014 Semantics of Interworkings Revised. Computing science report 95-12, Department of Computing Science, Eindhoven University of Technology, 1995."},{"key":"40_CR9","first-page":"167","volume-title":"SDL'93 Using Objects, Proc. Sixth SDL Forum","author":"S. Mauw","year":"1993","unstructured":"S. Mauw, M. van Wijk, and T. Winter. A Formal Semantics of Synchronous Interworkings. In O. F\u00c6rgemand and A. Sarma, editors, SDL'93 Using Objects, Proc. Sixth SDL Forum, pages 167\u2013178, Darmstadt, 1993. Elsevier, Amsterdam."},{"issue":"3","key":"40_CR10","first-page":"41","volume":"51","author":"S. Mauw","year":"1993","unstructured":"S. Mauw and T. Winter. A Prototype Toolset for Interworkings. Philips Telecommunication Review, 51(3):41\u201345, 1993.","journal-title":"Philips Telecommunication Review"},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"A. Rensink and H. Wehrheim. Weak Sequential Composition in Process Algebras. In B. Jonsson and J. Parrow, editors, CONCUR'94: Concurrency Theory, volume 836 of Lecture Notes in Computer Science, pages 226\u2013241. Springer-Verlag, 1994.","DOI":"10.1007\/978-3-540-48654-1_20"},{"key":"40_CR12","unstructured":"C. Verhoef. A General Conservative Extension Theorem in Process Algebra. In E.-R. Olderog, editor, Programming Concepts, Methods and Calculi (PROCOMET '94), volume 56 of IFIP Transactions A, pages 149\u2013168. North-Holland, 1994."},{"key":"40_CR13","unstructured":"J.L.M. Vrancken. Studies in Process Algebra, Algebraic Specifications and Parallelism. PhD thesis, University of Amsterdam, 1991."}],"container-title":["Lecture Notes in Computer Science","CONCUR '96: Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61604-7_83.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:08:37Z","timestamp":1605647317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61604-7_83"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616047","9783540706250"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-61604-7_83","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}