{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T05:49:13Z","timestamp":1738216153603,"version":"3.34.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540784975"},{"type":"electronic","value":"9783540784999"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78499-9_29","type":"book-chapter","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T23:02:25Z","timestamp":1207090945000},"page":"413-427","source":"Crossref","is-referenced-by-count":5,"title":["Deriving Bisimulation Congruences in the Presence of Negative Application Conditions"],"prefix":"10.1007","author":[{"given":"Guilherme","family":"Rangel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara","family":"K\u00f6nig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hartmut","family":"Ehrig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","volume-title":"Communication and concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"29_CR2","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.: A calculus for mobile process I. Information and Computation\u00a0100, 1\u201340 (1992)","journal-title":"Information and Computation"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0890-5401(92)90009-5","volume":"100","author":"R. Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus for mobile process II. Information and Computation\u00a0100, 41\u201377 (1992)","journal-title":"Information and Computation"},{"unstructured":"Leifer, J.J.: Operational Congruences for Reactive Systems. PhD thesis, University of Cambridge Computer Laboratory (2001)","key":"29_CR4"},{"key":"29_CR5","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.J. Leifer","year":"2000","unstructured":"Leifer, J.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":"29_CR6","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)"},{"issue":"6","key":"29_CR7","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":"29_CR8","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)"},{"unstructured":"Soboci\u0144ski, P.: Deriving process congruences from reaction rules. PhD thesis, Department of Computer Science, University of Aarhus (2004)","key":"29_CR9"},{"issue":"3\u20134","key":"29_CR10","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. Fundam. Inf.\u00a026(3\u20134), 287\u2013313 (1996)","journal-title":"Fundam. Inf."},{"unstructured":"Rangel, G., K\u00f6nig, B., Ehrig, H.: Deriving bisimulation congruences in the presence of negative application conditions. Technical Report 2008-1, Abteilung f\u00fcr Informatik und Angewandte Kognitionswissenschaft, Universit\u00e4t Duisburg-Essen (to appear, 2008)","key":"29_CR11"},{"key":"29_CR12","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1142\/9789812384720_0003","volume-title":"Handbook of Graph Grammars and Computing by Graph transformation, Foundations","author":"A. Corradini","year":"1997","unstructured":"Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., Loewe, M.: Algebraic approaches to graph transformation part I: Basic concepts and double pushout approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph transformation, Foundations, vol.\u00a01, pp. 163\u2013246. World Scientific, Singapore (1997)"},{"issue":"2","key":"29_CR13","first-page":"522","volume":"39","author":"S. Lack","year":"2005","unstructured":"Lack, S., Soboci\u0144ski, P.: Adhesive and quasiadhesive categories. RAIRO - Theoretical Informatics and Applications\u00a039(2), 522\u2013546 (2005)","journal-title":"RAIRO - Theoretical Informatics and Applications"},{"key":"29_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"key":"29_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/978-3-540-30203-2_23","volume-title":"Graph Transformations","author":"A. Rensink","year":"2004","unstructured":"Rensink, A.: Representing first-order logic using graphs. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol.\u00a03256, pp. 319\u2013335. Springer, Heidelberg (2004)"},{"unstructured":"Rangel, G., K\u00f6nig, B., Ehrig, H.: Bisimulation verification for the DPO approach with borrowed contexts. In: Proc. of GT-VMT 2007. Electronic Communications of the EASST, vol.\u00a06 (2007)","key":"29_CR16"},{"issue":"3","key":"29_CR17","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s100090100041","volume":"3","author":"D. Hirschkoff","year":"2001","unstructured":"Hirschkoff, D.: Bisimulation verification using the up-to techniques. International Journal on Software Tools for Technology Transfer\u00a03(3), 271\u2013285 (2001)","journal-title":"International Journal on Software Tools for Technology Transfer"},{"issue":"1","key":"29_CR18","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.ic.2005.07.003","volume":"204","author":"R. Milner","year":"2006","unstructured":"Milner, R.: Pure bigraphs: structure and dynamics. Inf. Comput.\u00a0204(1), 60\u2013122 (2006)","journal-title":"Inf. Comput."},{"key":"29_CR19","first-page":"69","volume-title":"Proc. of LICS 2006","author":"F. Bonchi","year":"2006","unstructured":"Bonchi, F., K\u00f6nig, B., Montanari, U.: Saturated semantics for reactive systems. In: Proc. of LICS 2006, pp. 69\u201380. IEEE, Los Alamitos (2006)"},{"key":"29_CR20","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)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78499-9_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:14:35Z","timestamp":1606184075000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78499-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540784975","9783540784999"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78499-9_29","relation":{},"subject":[]}}