{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:56:20Z","timestamp":1725566180347},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642159275"},{"type":"electronic","value":"9783642159282"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15928-2_9","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T14:32:34Z","timestamp":1284993154000},"page":"123-138","source":"Crossref","is-referenced-by-count":1,"title":["Saturated LTSs for Adhesive Rewriting Systems"],"prefix":"10.1007","author":[{"given":"Filippo","family":"Bonchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Gadducci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giacoma Valentina","family":"Monreale","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ugo","family":"Montanari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0304-3975(97)00223-5","volume":"195","author":"R. Amadio","year":"1998","unstructured":"Amadio, R., Castellani, I., Sangiorgi, D.: On bisimulations for the asynchronous \u03c0-calculus. Theoretical Computer Science\u00a0195(2), 291\u2013324 (1998)","journal-title":"Theoretical Computer Science"},{"key":"9_CR2","series-title":"LNM","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0074299","volume-title":"Midwest Category Seminar I","author":"J. B\u00e9nabou","year":"1967","unstructured":"B\u00e9nabou, J.: Introduction to bicategories. In: Midwest Category Seminar I. LNM, vol.\u00a047, pp. 1\u201377. Springer, Heidelberg (1967)"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-540-85361-9_20","volume-title":"CONCUR 2008 - Concurrency Theory","author":"L. Birkedal","year":"2008","unstructured":"Birkedal, L., Debois, S., Hildebrandt, T.: On the construction of sorted reactive systems. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol.\u00a05201, pp. 218\u2013232. Springer, Heidelberg (2008)"},{"unstructured":"Bonchi, F.: Abstract Semantics by Observable Contexts. Ph.D. thesis, Department of Informatics, University of Pisa (2008)","key":"9_CR4"},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ic.2008.10.005","volume":"207","author":"F. Bonchi","year":"2009","unstructured":"Bonchi, F., Gadducci, F., K\u00f6nig, B.: Synthesising CCS bisimulation using graph rewriting. Information and Computation\u00a0207(1), 14\u201340 (2009)","journal-title":"Information and Computation"},{"key":"9_CR6","series-title":"ENTCS","first-page":"73","volume-title":"EXPRESS 2008","author":"F. Bonchi","year":"2009","unstructured":"Bonchi, F., Gadducci, F., Monreale, G.V.: Labelled transitions for mobile ambients (as synthesized via a graphical encoding). In: Hildebrandt, T., Gorla, D. (eds.) EXPRESS 2008. ENTCS, vol.\u00a0242(1), pp. 73\u201398. Elsevier, Amsterdam (2009)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-642-00596-1_20","volume-title":"Foundations of Software Science and Computational Structures","author":"F. Bonchi","year":"2009","unstructured":"Bonchi, F., Gadducci, F., Monreale, G.V.: Reactive systems, barbed semantics, and the mobile ambients. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol.\u00a05504, pp. 272\u2013287. Springer, Heidelberg (2009)"},{"key":"9_CR8","first-page":"69","volume-title":"LICS 2006","author":"F. Bonchi","year":"2006","unstructured":"Bonchi, F., K\u00f6nig, B., Montanari, U.: Saturated semantics for reactive systems. In: LICS 2006, pp. 69\u201380. IEEE Computer Society, Los Alamitos (2006)"},{"issue":"4","key":"9_CR9","first-page":"479","volume":"89","author":"F. Bonchi","year":"2008","unstructured":"Bonchi, F., Brogi, A., Corfini, S., Gadducci, F.: On the use of behavioural equivalences for web services\u2019 development. Fundamenta Informaticae\u00a089(4), 479\u2013510 (2008)","journal-title":"Fundamenta Informaticae"},{"issue":"1","key":"9_CR10","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(99)00231-5","volume":"240","author":"L. Cardelli","year":"2000","unstructured":"Cardelli, L., Gordon, A.: Mobile ambients. Theoretical Computer Science\u00a0240(1), 177\u2013213 (2000)","journal-title":"Theoretical Computer Science"},{"key":"9_CR11","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-540-25974-9_24","volume-title":"Computational Methods in Systems Biology","author":"L. Cardelli","year":"2005","unstructured":"Cardelli, L.: Brane calculi. In: Danos, V., Schachter, V. (eds.) CMSB 2004. LNCS (LNBI), vol.\u00a03082, pp. 257\u2013278. Springer, Heidelberg (2005)"},{"issue":"6","key":"9_CR12","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"},{"issue":"3","key":"9_CR13","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1017\/S096012950700610X","volume":"17","author":"F. Gadducci","year":"2007","unstructured":"Gadducci, F.: Graph rewriting for the \u03c0-calculus. Mathematical Structures in Computer Science\u00a017(3), 407\u2013437 (2007)","journal-title":"Mathematical Structures in Computer Science"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","first-page":"219","volume-title":"Recent Trends in Algebraic Development Techniques","author":"F. Gadducci","year":"1998","unstructured":"Gadducci, F., Heckel, R.: An inductive view of graph transformation. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, vol.\u00a01376, pp. 219\u2013233. Springer, Heidelberg (1998)"},{"key":"9_CR15","series-title":"ENTCS","volume-title":"MFPS 2001","author":"F. Gadducci","year":"2001","unstructured":"Gadducci, F., Montanari, U.: A concurrent graph semantics for mobile ambients. In: Brookes, S., Mislove, M. (eds.) MFPS 2001. ENTCS, vol.\u00a045. Elsevier, Amsterdam (2001)"},{"doi-asserted-by":"crossref","unstructured":"Gianantonio, P.D., Honsell, F., Lenisa, M.: RPO, second-order contexts, and lambda-calculus. Logical Methods in Computer Science\u00a05(3) (2009)","key":"9_CR16","DOI":"10.2168\/LMCS-5(3:6)2009"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-540-74407-8_26","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"D. Grohmann","year":"2007","unstructured":"Grohmann, D., Miculan, M.: Reactive systems over directed bigraphs. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol.\u00a04703, pp. 380\u2013394. Springer, Heidelberg (2007)"},{"unstructured":"Grohmann, D., Miculan, M.: Deriving barbed bisimulations for bigraphical reactive systems. In: Corradini, A., Tuosto, E. (eds.) ICGT 2008 - Doctoral Symposium. Electronic Communications of the EASST, vol.\u00a016. EASST (2009)","key":"9_CR18"},{"issue":"3\/4","key":"9_CR19","doi-asserted-by":"crossref","first-page":"287","DOI":"10.3233\/FI-1996-263404","volume":"26","author":"A. Habel","year":"1996","unstructured":"Habel, A., Heckel, R., Taentzer, G.: Graph grammars with negative application conditions. Fundamenta Informaticae\u00a026(3\/4), 287\u2013313 (1996)","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"9_CR20","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/0304-3975(95)00074-7","volume":"151","author":"K. Honda","year":"1995","unstructured":"Honda, K., Yoshida, N.: On reduction-based process semantics. Theoretical Computer Science\u00a0151(2), 437\u2013486 (1995)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"9_CR21","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1051\/ita:2005028","volume":"39","author":"S. Lack","year":"2005","unstructured":"Lack, S., Sobocinski, P.: Adhesive and quasiadhesive categories. Theoretical Informatics and Applications\u00a039(3), 511\u2013545 (2005)","journal-title":"Theoretical Informatics and Applications"},{"key":"9_CR22","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)"},{"issue":"6","key":"9_CR23","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1145\/1101821.1101825","volume":"52","author":"M. Merro","year":"2005","unstructured":"Merro, M., Zappa Nardelli, F.: Behavioral theory for mobile ambients. Journal of the ACM\u00a052(6), 961\u20131023 (2005)","journal-title":"Journal of the ACM"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1007\/3-540-55719-9_114","volume-title":"Automata, Languages and Programming","author":"R. Milner","year":"1992","unstructured":"Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 685\u2013695. Springer, Heidelberg (1992)"},{"key":"9_CR25","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)"},{"unstructured":"OWL-S Coalition: OWL-S for services, www.ai.sri.com\/daml\/services\/owl-s\/","key":"9_CR26"},{"key":"9_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-540-78499-9_29","volume-title":"Foundations of Software Science and Computational Structures","author":"G. Rangel","year":"2008","unstructured":"Rangel, G., K\u00f6nig, B., Ehrig, H.: Deriving bisimulation congruences in the presence of negative application conditions. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol.\u00a04962, pp. 413\u2013427. Springer, Heidelberg (2008)"},{"key":"9_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-540-87405-8_17","volume-title":"Graph Transformations","author":"G. Rangel","year":"2008","unstructured":"Rangel, G., Lambers, L., K\u00f6nig, B., Ehrig, H., Baldan, P.: Behavior preservation in model refactoring using DPO transformations with borrowed contexts. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol.\u00a05214, pp. 242\u2013256. Springer, Heidelberg (2008)"},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-540-71389-0_22","volume-title":"Foundations of Software Science and Computational Structures","author":"J. Rathke","year":"2007","unstructured":"Rathke, J., Sassone, V., Soboci\u0144ski, P.: Semantic barbs and biorthogonality. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol.\u00a04423, pp. 302\u2013316. Springer, Heidelberg (2007)"},{"key":"9_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-540-85361-9_36","volume-title":"CONCUR 2008 - Concurrency Theory","author":"J. Rathke","year":"2008","unstructured":"Rathke, J., Soboci\u0144ski, P.: Deriving structural labelled transitions for mobile ambients. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol.\u00a05201, pp. 462\u2013476. Springer, Heidelberg (2008)"},{"issue":"2","key":"9_CR31","first-page":"163","volume":"10","author":"V. Sassone","year":"2003","unstructured":"Sassone, V., Sobocinski, P.: Deriving bisimulation congruences using 2-categories. Nordic Journal of Computing\u00a010(2), 163\u2013183 (2003)","journal-title":"Nordic Journal of Computing"},{"key":"9_CR32","first-page":"311","volume-title":"LICS 2005","author":"V. Sassone","year":"2005","unstructured":"Sassone, V., Soboci\u0144ski, P.: Reactive systems over cospans. In: LICS 2005, pp. 311\u2013320. IEEE Computer Society Press, Los Alamitos (2005)"},{"unstructured":"Soboci\u0144ski, P.: Deriving bisimulation congruences from reduction systems. Ph.D. thesis, BRICS, Department of Computer Science, University of Aaurhus (2004)","key":"9_CR33"}],"container-title":["Lecture Notes in Computer Science","Graph Transformations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15928-2_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:20:14Z","timestamp":1619785214000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15928-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642159275","9783642159282"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15928-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}