{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:23:26Z","timestamp":1725517406536},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540857617"},{"type":"electronic","value":"9783540857624"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85762-4_17","type":"book-chapter","created":{"date-parts":[[2008,8,22]],"date-time":"2008-08-22T14:20:29Z","timestamp":1219414829000},"page":"243-257","source":"Crossref","is-referenced-by-count":2,"title":["Congruence Results of Scope Equivalence for a Graph Rewriting Model of Concurrent Programs"],"prefix":"10.1007","author":[{"given":"Masaki","family":"Murakami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"17_CR1","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1017\/S096012950600569X","volume":"16","author":"H. Ehrig","year":"2006","unstructured":"Ehrig, H., K\u00f6nig, B.: Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting with Borrowed Contexts. Mathematical Structures in Computer Science\u00a016(6), 1133\u20131163 (2006)","journal-title":"Mathematical Structures in Computer Science"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/978-3-540-40018-9_4","volume-title":"Programming Languages and Systems","author":"F. Gadducci","year":"2003","unstructured":"Gadducci, F.: Term Graph rewriting for the \u03c0-calculus. In: Ohori, A. (ed.) APLAS 2003. LNCS, vol.\u00a02895, pp. 37\u201354. Springer, Heidelberg (2003)"},{"key":"17_CR3","unstructured":"K\u00f6nig, B.: A Graph Rewriting Semantics for the Polyadic \u03c0-Calculus. In: Proc. of GT-VMT 2000 Workshop on Graph Transformation and Visual Modeling Techniques, pp. 451\u2013458 (2000)"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1145\/96709.96718","volume-title":"Proc. of POPL 1990","author":"Y. Lafont","year":"1990","unstructured":"Lafont, Y.: Interaction Nets. In: Proc. of POPL 1990, pp. 95\u2013108. ACM, New York (1990)"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-44685-0_2","volume-title":"CONCUR 2001 - Concurrency Theory","author":"R. Milner","year":"2001","unstructured":"Milner, R.: Bigraphical Reactive Systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 16\u201335. Springer, Heidelberg (2001)"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.scico.2005.11.004","volume":"61","author":"M. Murakami","year":"2006","unstructured":"Murakami, M.: A Formal Model of Concurrent Systems Based on Bipartite Directed Acyclic Graph. Science of Computer Programming\u00a061, 38\u201347 (2006)","journal-title":"Science of Computer Programming"},{"key":"17_CR7","unstructured":"Murakami, M.: Congruence Results of Behavioral Equivalence for A Graph Rewriting Model of Concurrent Programs. In: Proc. of ICITA 2008 (to appear, 2008)"},{"key":"17_CR8","unstructured":"Murakami, M.: A Graph Rewriting Model of Concurrent Programs with Higher-Order Communication. In Proc. of TMFCS 2008 (to appear, 2008)"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46425-5_1","volume-title":"Programming Languages and Systems","author":"M. Odersky","year":"2000","unstructured":"Odersky, M.: Functional Nets. In: Smolka, G. (ed.) ESOP 2000. LNCS, vol.\u00a01782. Springer, Heidelberg (2000)"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0304-3975(00)00097-9","volume":"253","author":"D. Sangiorgi","year":"2001","unstructured":"Sangiorgi, D.: Asynchronous Process Calculi: The First- and Higher-order Paradigms. Theoretical Computer Science\u00a0253, 311\u2013350 (2001)","journal-title":"Theoretical Computer Science"},{"key":"17_CR11","first-page":"311","volume-title":"Proc. of LICS 2005","author":"V. Sassone","year":"2005","unstructured":"Sassone, V., Soboci\u0144ski, P.: Reactive systems over cospans. In: Proc. of LICS 2005, pp. 311\u2013320. IEEE, Los Alamitos (2005)"},{"key":"17_CR12","unstructured":"Ueda, K., Kato, N.: Programming with Logical Links: Design of the LMNtal language. In: Proc. of PPL 2003. JSSST, pp. 20\u201331 (2003)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing - ICTAC 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85762-4_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:49:06Z","timestamp":1619524146000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85762-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540857617","9783540857624"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85762-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}