{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T11:43:12Z","timestamp":1749728592750,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642287282"},{"type":"electronic","value":"9783642287299"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28729-9_24","type":"book-chapter","created":{"date-parts":[[2012,3,22]],"date-time":"2012-03-22T20:47:40Z","timestamp":1332449260000},"page":"361-375","source":"Crossref","is-referenced-by-count":4,"title":["Deriving Bisimulation Congruences for Conditional Reactive Systems"],"prefix":"10.1007","author":[{"given":"Mathias","family":"H\u00fclsbusch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara","family":"K\u00f6nig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Bonchi, F., K\u00f6nig, B., Montanari, U.: Saturated semantics for reactive systems. In: Proc. of LICS 2006, pp. 69\u201380. IEEE (2006)","DOI":"10.1109\/LICS.2006.46"},{"key":"24_CR2","unstructured":"Bruggink, H.J.S., Cauderlier, R., K\u00f6nig, B., H\u00fclsbusch, M.: Conditional reactive systems. In: Proc. of FSTTCS 2011. LIPICS, vol.\u00a013. Schloss Dagstuhl \u2013 Leibniz Center for Informatics (2011)"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"24_CR4","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":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-540-69100-6_7","volume-title":"Model Driven Architecture \u2013 Foundations and Applications","author":"G. Engels","year":"2008","unstructured":"Engels, G., Kleppe, A., Rensink, A., Semenyak, M., Soltenborn, C., Wehrheim, H.: From UML Activities to TAAL - Towards Behaviour-Preserving Model Transformations. In: Schieferdecker, I., Hartman, A. (eds.) ECMDA-FA 2008. LNCS, vol.\u00a05095, pp. 94\u2013109. Springer, Heidelberg (2008)"},{"key":"24_CR6","unstructured":"Fitting, M.: Bisimulations and boolean vectors. In: Advances in Modal Logic, vol.\u00a04, pp. 1\u201329. World Scientific Publishing (2002)"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Di Gianantonio, P., Honsell, F., Lenisa, M.: RPO, second-order contexts, and lambda-calculus. Logical Methods in Computer Science\u00a05(3) (2009)","DOI":"10.2168\/LMCS-5(3:6)2009"},{"key":"24_CR8","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)"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1017\/S0960129508007202","volume":"19","author":"A. Habel","year":"2009","unstructured":"Habel, A., Pennemann, K.-H.: Correctness of high-level transformation systems relative to nested conditions. Mathematical Stuctures in Computer Science\u00a019, 245\u2013296 (2009)","journal-title":"Mathematical Stuctures in Computer Science"},{"issue":"2","key":"24_CR10","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. Theoretical Computer Science\u00a0138(2), 353\u2013389 (1995)","journal-title":"Theoretical Computer Science"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-16265-7_14","volume-title":"Integrated Formal Methods","author":"M. H\u00fclsbusch","year":"2010","unstructured":"H\u00fclsbusch, M., K\u00f6nig, B., Rensink, A., Semenyak, M., Soltenborn, C., Wehrheim, H.: Showing Full Semantics Preservation in Model Transformation - A Comparison of Techniques. In: M\u00e9ry, D., Merz, S. (eds.) IFM 2010. LNCS, vol.\u00a06396, pp. 183\u2013198. Springer, Heidelberg (2010)"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Lack, S., Soboci\u0144ski, P.: Adhesive and quasiadhesive categories. RAIRO \u2013 Theoretical Informatics and Applications\u00a039(3) (2005)","DOI":"10.1051\/ita:2005028"},{"key":"24_CR13","unstructured":"Guldstrand Larsen, K.: Context-Dependent Bisimulation between Processes. PhD thesis, University of Edinburgh (1986)"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Leifer, J.J.: Operational congruences for reactive systems. PhD thesis, University of Cambridge Computer Laboratory (September 2001)","DOI":"10.1007\/3-540-44618-4_19"},{"key":"24_CR15","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":"24_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"24_CR17","unstructured":"Pennemann, K.-H.: Development of Correct Graph Transformation Systems. PhD thesis, Universit\u00e4t Oldenburg (May 2009)"},{"key":"24_CR18","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":"24_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Sassone, V., Soboci\u0144ski, P.: Reactive systems over cospans. In: Proc. of LICS 2005, pp. 311\u2013320. IEEE (2005)","DOI":"10.1109\/LICS.2005.40"},{"key":"24_CR21","unstructured":"Soboci\u0144ski, P.: Deriving process congruences from reaction rules. PhD thesis, Department of Computer Science. University of Aarhus (2004)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28729-9_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,23]],"date-time":"2025-03-23T18:49:28Z","timestamp":1742755768000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28729-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642287282","9783642287299"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28729-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}