{"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":1761611216250},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540427360"},{"type":"electronic","value":"9783540455004"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45500-0_7","type":"book-chapter","created":{"date-parts":[[2007,10,25]],"date-time":"2007-10-25T15:37:33Z","timestamp":1193326653000},"page":"145-164","source":"Crossref","is-referenced-by-count":11,"title":["Observational Equivalence for Synchronized Graph Rewriting with Mobility"],"prefix":"10.1007","author":[{"given":"Barbara","family":"K\u00f6nig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ugo","family":"Montanari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,10]]},"reference":[{"key":"7_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-44618-4_20","volume-title":"Proc. of CONCUR 2000","author":"R. Bruni","year":"2000","unstructured":"R. Bruni, D. Frutos-Escrig, N. Mart\u00ed-Oliet, and U. Montanari. Bisimilarity congruences for open terms and term graphs via tile logic. In Proc. of CONCUR 2000, pages 259\u2013274. Springer-Verlag, 2000. LNCS 1877."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"R. Bruni, D. Frutos-Escrig, N. Mart\u00ed-Oliet, and U. Montanari. Tile bisimilarity congruences for open terms and term graphs. Technical Report TR-00-06, Dipartimento di Informatica, Universit\u00e0 di Pisa, 2000.","DOI":"10.1007\/3-540-44618-4_20"},{"key":"7_CR3","series-title":"Lect Notes Comput Sci","first-page":"31","volume-title":"Recents Trends in Algebraic Development Techniques, 12th International Workshop, WADT\u2019 98","author":"R. Bruni","year":"1998","unstructured":"Roberto Bruni, Fabio Gadducci, and Ugo Montanari. Normal forms for partitions and relations. In Recents Trends in Algebraic Development Techniques, 12th International Workshop, WADT\u2019 98, pages 31\u201347. Springer-Verlag, 1998. LNCS 1589, full version to appear in TCS."},{"key":"7_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/3-540-56610-4_63","volume-title":"Proc. of TAPSOFT (Theory and Practice of Software Development)","author":"G. David","year":"1993","unstructured":"Gnanamalar David, Frank Drewes, and Hans-J\u00f6rg Kreowski. Hyperedge replacement with rendezvous. In Proc. of TAPSOFT (Theory and Practice of Software Development), pages 167\u2013181. Springer-Verlag, 1993. LNCS 668."},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0304-3975(85)90093-3","volume":"37","author":"R. Simone de","year":"1985","unstructured":"Roberto de Simone. Higher level synchronizing devices in MEIJE-SCCS. Theoretical Computer Science, 37:245\u2013267, 1985.","journal-title":"Theoretical Computer Science"},{"issue":"34","key":"7_CR6","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1145\/23005.24038","volume":"2","author":"P. Degano","year":"1987","unstructured":"P. Degano and U. Montanari. A model of distributed systems based on graph rewriting. Journal of the ACM, 2(34):411\u2013449, 1987.","journal-title":"Journal of the ACM"},{"key":"7_CR7","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Proc. 1st International Workshop on Graph Grammars","author":"H. Ehrig","year":"1979","unstructured":"H. Ehrig. Introduction to the algebraic theory of graphs. In Proc. 1st International Workshop on Graph Grammars, pages 1\u201369. Springer-Verlag, 1979. LNCS 73."},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"H. Ehrig, H.-J. Kreowski, U. Montanari, and G. Rozenberg, editors. Handbook of Graph Grammars and Computing by Graph Transformation, Vol.3: Concurrency, Parallellism, and Distribution. World Scientific, 1999.","DOI":"10.1142\/4181"},{"key":"7_CR9","unstructured":"Maribel Fern\u00e1ndez and Ian Mackie. Coinductive techniques for operational equivalence of interaction nets. In Proc. of LICS\u2019 98. IEEE Computer Society Press, 1998."},{"key":"7_CR10","series-title":"Lect Notes Comput Sci","first-page":"223","volume-title":"Recent Trends in Algebraic Development Techniques, 12th International Workshop, WADT\u2019 97","author":"F. Gadducci","year":"1997","unstructured":"F. Gadducci and R. Heckel. An inductive view of graph transformation. In Recent Trends in Algebraic Development Techniques, 12th International Workshop, WADT\u2019 97, pages 223\u2013237. Springer-Verlag, 1997. LNCS 1376."},{"key":"7_CR11","unstructured":"F. Gadducci and U. Montanari. The tile model. In Gordon Plotkin, Colin Stirling, and Mads Tofte, editors, Proof, Language and Interaction: Essays in Honour of Robin Milner. MIT Press, 1999."},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/0890-5401(92)90013-6","volume":"100","author":"J.F. Groote","year":"1992","unstructured":"J.F. Groote and F. Vaandrager. Structured operational semantics and bisimulation as a congruence. Information and Computation, 100:202\u2013260, 1992.","journal-title":"Information and Computation"},{"key":"7_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/3-540-45263-X_10","volume-title":"Proc. of COORDINATION 2000","author":"D. Hirsch","year":"2000","unstructured":"Dan Hirsch, Paola Inverardi, and Ugo Montanari. Reconfiguration of software architecture styles with name mobility. In Ant\u00f3nio Porto and Gruia-Catalin Roman, editors, Proc. of COORDINATION 2000, pages 148\u2013163. Springer-Verlag, 2000. LNCS 1906."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Dan Hirsch and Ugo Montanari. Synchronized hyperedge replacement with name mobility (a graphical calculus for mobile systems). In Proc. of CONCUR\u2019 01. Springer-Verlag, 2001. to appear.","DOI":"10.1007\/3-540-44685-0_9"},{"key":"7_CR15","unstructured":"Barbara Konig. Description and Verification of Mobile Processes with Graph Rewriting Techniques. PhD thesis, Technische Universitat Munchen, 1999."},{"key":"7_CR16","unstructured":"Barbara Konig. A graph rewriting semantics for the polyadic pi-calculus. In Workshop on Graph Transformation and Visual Modeling Techniques (Geneva, Switzerland), ICALP Workshops\u2019 00, pages 451\u2013458. Carleton Scientific, 2000."},{"key":"7_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44618-4_19","volume-title":"Proc. of CONCUR 2000","author":"J. J. Leifer","year":"2000","unstructured":"James J. Leifer and Robin Milner. Deriving bisimulation congruences for reactive systems. In Proc. of CONCUR 2000, 2000. LNCS 1877."},{"key":"7_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0084778","volume-title":"Proc. of CONCUR\u2019 92","author":"R. Milner","year":"1992","unstructured":"R. Milner and D. Sangiorgi. Techniques of weak bisimulation up-to. In Proc. of CONCUR\u2019 92. Springer-Verlag, 1992. LNCS 630."},{"key":"7_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","author":"R. Milner","year":"1980","unstructured":"Robin Milner. A Calculus of Communicating Systems. Springer-Verlag, 1980. LNCS 92."},{"issue":"8","key":"7_CR20","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/s002360050067","volume":"33","author":"R. Milner","year":"1996","unstructured":"Robin Milner. Calculi for interaction. Acta Informatica, 33(8):707\u2013737, 1996.","journal-title":"Acta Informatica"},{"key":"7_CR21","unstructured":"Robin Milner. Communicating and Mobile Systems: the \u03c0-Calculus. Cambridge University Press, 1999."},{"key":"7_CR22","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of ICALP\u2019 92","author":"R. Milner","year":"1992","unstructured":"Robin Milner and Davide Sangiorgi. Barbed bisimulation. In Proc. of ICALP\u2019 92. Springer-Verlag, 1992. LNCS 623."},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1023\/A:1008693303228","volume":"7","author":"U. Montanari","year":"1999","unstructured":"U. Montanari and F. Rossi. Graph rewriting, constraint solving and tiles for coordinating distributed systems. Applied Categorical Structures, 7:333\u2013370, 1999.","journal-title":"Applied Categorical Structures"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Grzegorz Rozenberg, editor. Handbook of Graph Grammars and Computing by Graph Transformation, Vol.1: Foundations, volume 1. World Scientific, 1997.","DOI":"10.1142\/9789812384720"},{"key":"7_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-58698-9","volume-title":"Proc. of TPPP\u2019 94","author":"N. Yoshida","year":"1994","unstructured":"Nobuko Yoshida. Graph notation for concurrent combinators. In Proc. of TPPP\u2019 94. Springer-Verlag, 1994. LNCS 907."}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computer Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45500-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T20:54:40Z","timestamp":1556916880000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45500-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540427360","9783540455004"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-45500-0_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}