{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:07:24Z","timestamp":1725466044020},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642370748"},{"type":"electronic","value":"9783642370755"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37075-5_8","type":"book-chapter","created":{"date-parts":[[2013,2,18]],"date-time":"2013-02-18T19:37:23Z","timestamp":1361216243000},"page":"113-128","source":"Crossref","is-referenced-by-count":0,"title":["Checking Bisimilarity for Attributed Graph Transformation"],"prefix":"10.1007","author":[{"given":"Fernando","family":"Orejas","sequence":"first","affiliation":[]},{"given":"Artur","family":"Boronat","sequence":"additional","affiliation":[]},{"given":"Ulrike","family":"Golas","sequence":"additional","affiliation":[]},{"given":"Nikos","family":"Mylonakis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"8_CR1","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. Inf. Comput.\u00a0207(1), 14\u201340 (2009)","journal-title":"Inf. Comput."},{"issue":"1","key":"8_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.entcs.2009.06.014","volume":"242","author":"F. Bonchi","year":"2009","unstructured":"Bonchi, F., Gadducci, F., Monreale, G.V.: Labelled transitions for mobile ambients (as synthesized via a graphical encoding). Electr. Notes Theor. Comput. Sci.\u00a0242(1), 73\u201398 (2009)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-57208-2_11","volume-title":"CONCUR\u201993","author":"S. Christensen","year":"1993","unstructured":"Christensen, S., Hirshfeld, Y., Moller, F.: Bisimulation Equivalence is Decidable for Basic Parallel Processes. In: Best, E. (ed.) CONCUR 1993. LNCS, vol.\u00a0715, pp. 143\u2013157. Springer, Heidelberg (1993)"},{"key":"8_CR4","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. In: EATCS Monographs of Theoretical Comp. Sc. Springer (2006)"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Ehrig, H., Golas, U., Habel, A., Lambers, L., Orejas, F.: M-adhesive transformation systems with nested application conditions. part 1. Math. Struct. in Com. Sc. (2012) (to appear)","DOI":"10.3233\/FI-2012-705"},{"issue":"6","key":"8_CR6","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. Math. Struct. in Com. Sc.\u00a016(6), 1133\u20131163 (2006)","journal-title":"Math. Struct. in Com. Sc."},{"issue":"3","key":"8_CR7","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 pi-calculus. Math. Struct. in Com. Sc.\u00a017(3), 407\u2013437 (2007)","journal-title":"Math. Struct. in Com. Sc."},{"key":"8_CR8","unstructured":"Giese, M., H\u00e4hnle, R.: Tableaux + constraints. In: TABLEAUX 2003 position paper (2003)"},{"issue":"2","key":"8_CR9","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0304-3975(94)00172-F","volume":"138","author":"M. Hennessy","year":"1995","unstructured":"Hennessy, M., Lin, H.: Symbolic bisimulations. Theor. Comput. Sci.\u00a0138(2), 353\u2013389 (1995)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"8_CR10","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. J. ACM\u00a032(1), 137\u2013161 (1985)","journal-title":"J. ACM"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-642-28729-9_24","volume-title":"Foundations of Software Science and Computational Structures","author":"M. H\u00fclsbusch","year":"2012","unstructured":"H\u00fclsbusch, M., K\u00f6nig, B.: Deriving Bisimulation Congruences for Conditional Reactive Systems. In: Birkedal, L. (ed.) FOSSACS 2012. LNCS, vol.\u00a07213, pp. 361\u2013375. Springer, Heidelberg (2012)"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0743-1066(98)10002-X","volume":"37","author":"J. Jaffar","year":"1998","unstructured":"Jaffar, J., Maher, M., Marriot, K., Stuckey, P.: The semantics of constraint logic programs. The Journal of Logic Programming\u00a037, 1\u201346 (1998)","journal-title":"The Journal of Logic Programming"},{"key":"8_CR13","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. Theor. Inf. App.\u00a039, 511\u2013545 (2005)","journal-title":"Theor. Inf. App."},{"issue":"1","key":"8_CR14","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, I and II. Inf. Comput.\u00a0100(1), 1\u201377 (1992)","journal-title":"Inf. Comput."},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-33654-6_9","volume-title":"Graph Transformations","author":"F. Orejas","year":"2012","unstructured":"Orejas, F., Boronat, A., Mylonakis, N.: Borrowed Contexts for Attributed Graphs. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2012. LNCS, vol.\u00a07562, pp. 126\u2013140. Springer, Heidelberg (2012)"},{"key":"8_CR16","unstructured":"Orejas, F., Lambers, L.: Symbolic attributed graphs for attributed graph transformation. ECEASST\u00a030 (2010)"},{"key":"8_CR17","first-page":"65","volume":"118","author":"F. Orejas","year":"2012","unstructured":"Orejas, F., Lambers, L.: Lazy graph transformation. Fund. Inf.\u00a0118, 65\u201396 (2012)","journal-title":"Fund. Inf."},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D. Park","year":"1981","unstructured":"Park, D.: Concurrency and Automata on Infinite Sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol.\u00a0104, pp. 167\u2013183. Springer, Heidelberg (1981)"},{"key":"8_CR19","unstructured":"Rangel, G., K\u00f6nig, B., Ehrig, H.: Bisimulation verification for the DPO approach with borrowed contexts. ECEASST\u00a06 (2007)"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/3-540-60246-1_153","volume-title":"Mathematical Foundations of Computer Science 1995","author":"D. Sangiorgi","year":"1995","unstructured":"Sangiorgi, D.: On the Proof Method for Bisimulation. In: H\u00e1jek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol.\u00a0969, pp. 479\u2013488. Springer, Heidelberg (1995)"},{"issue":"1","key":"8_CR21","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s002360050036","volume":"33","author":"D. Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: A theory of bisimulation for the pi-calculus. Acta Inf.\u00a033(1), 69\u201397 (1996)","journal-title":"Acta Inf."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37075-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,22]],"date-time":"2020-07-22T12:36:12Z","timestamp":1595421372000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37075-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642370748","9783642370755"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37075-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}