{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:10:20Z","timestamp":1738368620611,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540874041"},{"type":"electronic","value":"9783540874058"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-87405-8_10","type":"book-chapter","created":{"date-parts":[[2008,9,17]],"date-time":"2008-09-17T10:48:17Z","timestamp":1221648497000},"page":"131-146","source":"Crossref","is-referenced-by-count":2,"title":["Network Applications of Graph Bisimulation"],"prefix":"10.1007","author":[{"given":"Pietro","family":"Cenciarelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniele","family":"Gorla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emilio","family":"Tuosto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","first-page":"69","volume-title":"Proc. of LICS","author":"F. Bonchi","year":"2006","unstructured":"Bonchi, F., K\u00f6nig, B., Montanari, U.: Saturated semantics for reactive systems. In: Proc. of LICS, pp. 69\u201380. IEEE, Los Alamitos (2006)"},{"issue":"240","key":"10_CR2","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(99)00231-5","volume":"1","author":"L. Cardelli","year":"2000","unstructured":"Cardelli, L., Gordon, A.: Mobile Ambients. Theor. Comp. Science\u00a01(240), 177\u2013213 (2000)","journal-title":"Theor. Comp. Science"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.entcs.2004.06.017","volume":"117","author":"P. Cenciarelli","year":"2005","unstructured":"Cenciarelli, P., Talamo, I., Tiberi, A.: Ambient Graph Rewriting. Electronic Notes in Theoretical Computer Science\u00a0117, 335\u2013351 (2005)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"issue":"5","key":"10_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2005.02.013","volume":"127","author":"P. Cenciarelli","year":"2005","unstructured":"Cenciarelli, P., Tiberi, A.: Rational Unification in 28 Characters. Electronic Notes in Theoretical Computer Science\u00a0127(5), 3\u201320 (2005)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"issue":"1","key":"10_CR5","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/151646.151648","volume":"15","author":"R. Cleaveland","year":"1993","unstructured":"Cleaveland, R., Parrow, J., Steffen, B.: The concurrency workbench: A semantics-based tool for the verification of concurrent systems. ACM ToPLaS\u00a015(1), 36\u201372 (1993)","journal-title":"ACM ToPLaS"},{"key":"10_CR6","volume-title":"Introduction to algorithms","author":"T. Cormen","year":"1990","unstructured":"Cormen, T., Leiserson, C., Rivest, R.: Introduction to algorithms. MIT Press, Cambridge (1990)"},{"key":"10_CR7","unstructured":"Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., L\u00f6we, M.: Algebraic Approaches to Graph Transformation I: Basic Concepts and Double Pushout Approach. In: Handbook of Graph Grammars and Computing by Graph Transformation, ch. 3, vol.\u00a01"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1145\/23005.24038","volume":"34","author":"P. Degano","year":"1987","unstructured":"Degano, P., Montanari, U.: A model for distributed systems based on graph rewriting. Journal of the ACM\u00a034, 411\u2013449 (1987)","journal-title":"Journal of the ACM"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/978-3-540-24727-2_12","volume-title":"Foundations of Software Science and Computation Structures","author":"H. Ehrig","year":"2004","unstructured":"Ehrig, H., K\u00f6nig, B.: Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 151\u2013166. Springer, Heidelberg (2004)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45446-2_1","volume-title":"Theoretical Computer Science","author":"G. Ferrari","year":"2001","unstructured":"Ferrari, G., Montanari, U., Tuosto, E.: A LTS semantics of ambients via graph synchronization with mobility. In: Restivo, A., Ronchi Della Rocca, S., Roversi, L. (eds.) ICTCS 2001. LNCS, vol.\u00a02202. Springer, Heidelberg (2001)"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Foundations of Software Science and Computational Structures","author":"G. Ferrari","year":"2005","unstructured":"Ferrari, G., Montanari, U., Tuosto, E.: Model Checking for Nominal Calculi. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 1\u201324. Springer, Heidelberg (2005)"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Concurrent Object-Oriented Programming and Petri Nets","author":"D. Hirsch","year":"2001","unstructured":"Hirsch, D., Montanari, U.: Synchronized hyperedge replacement with name mobility: A graphical calculus for name mobility. In: Agha, G.A., De Cindio, F., Rozenberg, G. (eds.) APN 2001. LNCS, vol.\u00a02001. Springer, Heidelberg (2001)"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-45500-0_7","volume-title":"Theoretical Aspects of Computer Software","author":"B. K\u00f6nig","year":"2001","unstructured":"K\u00f6nig, B., Montanari, U.: Observational equivalence for synchronized graph rewriting with mobility. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol.\u00a02215, pp. 145\u2013164. Springer, Heidelberg (2001)"},{"key":"10_CR14","unstructured":"Lanese, I.: Synchronization Strategies for Global Computing Models. PhD thesis, Univ. of Pisa (2006)"},{"key":"10_CR15","unstructured":"Lanese, I., Montanari, U.: A graphical fusion calculus. In: Proc. of COMETA 2003 (2003)"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Leifer, J.: Operational Congruences for Reactive Systems. PhD thesis, Univ. of Cambridge (UK) (2001)","DOI":"10.1007\/3-540-44618-4_19"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-44618-4_19","volume-title":"CONCUR 2000 - Concurrency Theory","author":"J. Leifer","year":"2000","unstructured":"Leifer, J., Milner, R.: Deriving Bisimulation Congruences for Reactive Systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 243\u2013258. Springer, Heidelberg (2000)"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. Springer, Heidelberg (2001)"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. Information and Computation\u00a0100, 1\u201377 (1992)","journal-title":"Information and Computation"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","first-page":"449","volume-title":"CONCUR 2002 - Concurrency Theory","author":"U. Montanari","year":"2002","unstructured":"Montanari, U., Buscemi, M.: A First Order Coalgebraic Model of \u03c0-Calculus Early Observational Equivalence. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 449\u2013465. Springer, Heidelberg (2002)"},{"key":"10_CR21","volume-title":"Proc.of LICS","author":"J. Parrow","year":"1998","unstructured":"Parrow, J., Victor, B.: The fusion calculus: Expressiveness and symmetry in mobile processes. In: Proc.of LICS. IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1016\/S0304-3975(00)00326-1","volume":"266","author":"J. Riely","year":"2001","unstructured":"Riely, J., Hennessy, M.: Distributed Processes and Location Failures. Theoretical Computer Science\u00a0266, 693\u2013735 (2001)","journal-title":"Theoretical Computer Science"},{"key":"10_CR23","volume-title":"Proc. of LICS","author":"D. Turi","year":"1997","unstructured":"Turi, D., Plotkin, G.D.: Towards a mathematical operational semantics. In: Proc. of LICS. IEEE Computer Society Press, Los Alamitos (1997)"},{"issue":"1","key":"10_CR24","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1109\/2.895117","volume":"34","author":"B. Warneke","year":"2001","unstructured":"Warneke, B., Last, M., Liebowitz, B., Pister, K.S.J.: Smart dust: Communicating with a cubic-millimeter computer. IEEE Computer\u00a034(1), 44\u201351 (2001)","journal-title":"IEEE Computer"}],"container-title":["Lecture Notes in Computer Science","Graph Transformations"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87405-8_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T23:31:30Z","timestamp":1738366290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87405-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540874041","9783540874058"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87405-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}