{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T11:10:07Z","timestamp":1744024207175,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":51,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642329425"},{"type":"electronic","value":"9783642329432"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32943-2_9","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T04:59:35Z","timestamp":1346129975000},"page":"120-135","source":"Crossref","is-referenced-by-count":4,"title":["Modal Process Rewrite Systems"],"prefix":"10.1007","author":[{"given":"Nikola","family":"Bene\u0161","sequence":"first","affiliation":[]},{"given":"Jan","family":"K\u0159et\u00ednsk\u00fd","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Aceto, L., F\u00e1bregas, I., de Frutos-Escrig, D., Ing\u00f3lfsd\u00f3ttir, A., Palomino, M.: Graphical representation of covariant-contravariant modal formulae. In: EXPRESS, pp. 1\u201315 (2011)","DOI":"10.4204\/EPTCS.64.1"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BFb0055622","volume-title":"CONCUR \u201998 Concurrency Theory","author":"R. Alur","year":"1998","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O., Vardi, M.Y.: Alternating Refinement Relations. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 163\u2013178. Springer, Heidelberg (1998)"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: STOC, pp. 202\u2013211 (2004)","DOI":"10.1145\/1007352.1007390"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-24372-1_17","volume-title":"Automated Technology for Verification and Analysis","author":"N. Bene\u0161","year":"2011","unstructured":"Bene\u0161, N., \u010cern\u00e1, I., K\u0159et\u00ednsk\u00fd, J.: Modal Transition Systems: Composition and LTL Model Checking. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol.\u00a06996, pp. 228\u2013242. Springer, Heidelberg (2011)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-642-22993-0_9","volume-title":"Mathematical Foundations of Computer Science 2011","author":"S.S. Bauer","year":"2011","unstructured":"Bauer, S.S., Fahrenberg, U., Juhl, L., Larsen, K.G., Legay, A., Thrane, C.R.: Quantitative Refinement for Weighted Modal Transition Systems. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol.\u00a06907, pp. 60\u201371. Springer, Heidelberg (2011)"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/3-540-44618-4_14","volume-title":"CONCUR 2000 - Concurrency Theory","author":"G. Bruns","year":"2000","unstructured":"Bruns, G., Godefroid, P.: Generalized Model Checking: Reasoning about Partial State Spaces. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 168\u2013182. Springer, Heidelberg (2000)"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Bauer, S.S., Hennicker, R., Janisch, S.: Interface theories for (a)synchronously communicating modal I\/O-transition systems. In: FIT, pp. 1\u20138 (2010)","DOI":"10.4204\/EPTCS.46.1"},{"key":"9_CR8","unstructured":"Bene\u0161, N., K\u0159et\u00ednsk\u00fd, J.: Process algebra for modal transition systemses. In: MEMICS, pp. 9\u201318 (2010)"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Bene\u0161, N., K\u0159et\u00ednsk\u00fd, J.: Modal process rewrite systems. Technical report FIMU-RS-2012-02, Faculty of Informatics, Masaryk University, Brno (2012)","DOI":"10.1007\/978-3-642-32943-2_9"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-642-24372-1_20","volume-title":"Automated Technology for Verification and Analysis","author":"N. Bene\u0161","year":"2011","unstructured":"Bene\u0161, N., K\u0159et\u00ednsk\u00fd, J., Larsen, K.G., M\u00f8ller, M.H., Srba, J.: Parametric Modal Transition Systems. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol.\u00a06996, pp. 275\u2013289. Springer, Heidelberg (2011)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-28717-6_12","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"N. Bene\u0161","year":"2012","unstructured":"Bene\u0161, N., K\u0159et\u00ednsk\u00fd, J., Larsen, K.G., M\u00f8ller, M.H., Srba, J.: Dual-Priced Modal Transition Systems with Time Durations. In: Bj\u00f8rner, N., Voronkov, A. (eds.) LPAR-18 2012. LNCS, vol.\u00a07180, pp. 122\u2013137. Springer, Heidelberg (2012)"},{"issue":"41","key":"9_CR12","doi-asserted-by":"publisher","first-page":"4026","DOI":"10.1016\/j.tcs.2009.06.009","volume":"410","author":"N. Bene\u0161","year":"2009","unstructured":"Bene\u0161, N., K\u0159et\u00ednsk\u00fd, J., Larsen, K.G., Srba, J.: On determinism in modal transition systems. Theor. Comput. Sci.\u00a0410(41), 4026\u20134043 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-52590-4_40","volume-title":"CAAP \u201990","author":"G. Boudol","year":"1990","unstructured":"Boudol, G., Larsen, K.G.: Graphical versus Logical Specifications. In: Arnold, A. (ed.) CAAP 1990. LNCS, vol.\u00a0431, pp. 57\u201371. Springer, Heidelberg (1990)"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Bertrand, N., Legay, A., Pinchinat, S., Raclet, J.-B.: Modal event-clock specifications for timed component-based design. Science of Computer Programming (2011) (to appear)","DOI":"10.1016\/j.scico.2011.01.007"},{"issue":"3","key":"9_CR15","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF01384499","volume":"6","author":"A. B\u00f8rjesson","year":"1995","unstructured":"B\u00f8rjesson, A., Larsen, K.G., Skou, A.: Generality in design and compositional verification using TAV. Formal Methods in System Design\u00a06(3), 239\u2013258 (1995)","journal-title":"Formal Methods in System Design"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-3-642-24372-1_30","volume-title":"Automated Technology for Verification and Analysis","author":"S.S. Bauer","year":"2011","unstructured":"Bauer, S.S., Mayer, P., Legay, A.: MIO Workbench: A Tool for Compositional Design with Modal Input\/Output Interfaces. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol.\u00a06996, pp. 418\u2013421. Springer, Heidelberg (2011)"},{"issue":"1-2","key":"9_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-6423(96)00027-5","volume":"29","author":"G. Bruns","year":"1997","unstructured":"Bruns, G.: An industrial application of modal process logic. Sci. Comput. Program.\u00a029(1-2), 3\u201322 (1997)","journal-title":"Sci. Comput. Program."},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Caillaud, B., Delahaye, B., Larsen, K.G., Legay, A., Pedersen, M.L., Wasowski, A.: Compositional design methodology with constraint markov chains. In: QEST, pp. 123\u2013132 (2010)","DOI":"10.1109\/QEST.2010.23"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/3-540-56922-7_21","volume-title":"Computer Aided Verification","author":"K. \u010cer\u0101ns","year":"1993","unstructured":"\u010cer\u0101ns, K., Godskesen, J.C., Larsen, K.G.: Timed Modal Specification - Theory and Tools. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 253\u2013267. Springer, Heidelberg (1993)"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-642-04761-9_22","volume-title":"Automated Technology for Verification and Analysis","author":"A. Campetelli","year":"2009","unstructured":"Campetelli, A., Gruler, A., Leucker, M., Thoma, D.: Don\u2019t Know for Multi-valued Systems. In: Liu, Z., Ravn, A.P. (eds.) ATVA 2009. LNCS, vol.\u00a05799, pp. 289\u2013305. Springer, Heidelberg (2009)"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"de Alfaro, L., Henzinger, T.A.: Interface automata. In: ESEC \/ SIGSOFT FSE, pp. 109\u2013120 (2001)","DOI":"10.1145\/503271.503226"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"D\u2019Ippolito, N., Fischbein, D., Foster, H., Uchitel, S.: MTSA: Eclipse support for modal transition systems construction, analysis and elaboration. In: ETX, pp. 6\u201310 (2007)","DOI":"10.1145\/1328279.1328281"},{"issue":"2","key":"9_CR23","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/244795.244800","volume":"19","author":"D. Dams","year":"1997","unstructured":"Dams, D., Gerth, R., Grumberg, O.: Abstract interpretation of reactive systems. ACM Trans. Program. Lang. Syst.\u00a019(2), 253\u2013291 (1997)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/978-3-642-15643-4_29","volume-title":"Automated Technology for Verification and Analysis","author":"A. David","year":"2010","unstructured":"David, A., Larsen, K.G., Legay, A., Nyman, U., W\u0105sowski, A.: ECDAR: An Environment for Compositional Design and Analysis of Real Time Systems. In: Bouajjani, A., Chin, W.-N. (eds.) ATVA 2010. LNCS, vol.\u00a06252, pp. 365\u2013370. Springer, Heidelberg (2010)"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Dams, D., Namjoshi, K.S.: The existence of finite abstractions for branching time model checking. In: LICS, pp. 335\u2013344 (2004)","DOI":"10.1109\/LICS.2004.1319628"},{"key":"9_CR26","unstructured":"Elhog-Benzina, D., Haddad, S., Hennicker, R.: Process refinement and asynchronous composition with modalities. In: ACSD\/Petri Nets Workshops, pp. 385\u2013401 (2010)"},{"issue":"1-2","key":"9_CR27","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.jlap.2008.05.003","volume":"77","author":"H. Fecher","year":"2008","unstructured":"Fecher, H., Schmidt, H.: Comparing disjunctive modal transition systems with an one-selecting variant. J. Log. Algebr. Program.\u00a077(1-2), 20\u201339 (2008)","journal-title":"J. Log. Algebr. Program."},{"issue":"2","key":"9_CR28","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1006\/inco.1994.1101","volume":"115","author":"J.F. Groote","year":"1994","unstructured":"Groote, J.F., H\u00fcttel, H.: Undecidable equivalences for basic process algebra. Inf. Comput.\u00a0115(2), 354\u2013371 (1994)","journal-title":"Inf. Comput."},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/3-540-44685-0_29","volume-title":"CONCUR 2001 - Concurrency Theory","author":"P. Godefroid","year":"2001","unstructured":"Godefroid, P., Huth, M., Jagadeesan, R.: Abstraction-Based Model Checking Using Modal Transition Systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 426\u2013440. Springer, Heidelberg (2001)"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Godefroid, P., Nori, A.V., Rajamani, S.K., Tetali, S.: Compositional may-must program analysis: unleashing the power of alternation. In: POPL, pp. 43\u201356 (2010)","DOI":"10.1145\/1707801.1706307"},{"key":"9_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-45309-1_11","volume-title":"Programming Languages and Systems","author":"M. Huth","year":"2001","unstructured":"Huth, M., Jagadeesan, R., Schmidt, D.A.: Modal Transition Systems: A Foundation for Three-Valued Program Analysis. In: Sands, D. (ed.) ESOP 2001. LNCS, vol.\u00a02028, pp. 155\u2013169. Springer, Heidelberg (2001)"},{"key":"9_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/3-540-57887-0_110","volume-title":"Theoretical Aspects of Computer Software","author":"H. H\u00fcttel","year":"1994","unstructured":"H\u00fcttel, H.: Undecidable Equivalences for Basic Parallel Processes. In: Hagiya, M., Mitchell, J.C. (eds.) TACS 1994. LNCS, vol.\u00a0789, pp. 454\u2013464. Springer, Heidelberg (1994)"},{"key":"9_CR33","doi-asserted-by":"crossref","unstructured":"Juhl, L., Larsen, K.G., Srba, J.: Modal transition systems with weight intervals. Journal of Logic and Algebraic programming (2011) (to appear)","DOI":"10.1016\/j.jlap.2012.03.008"},{"key":"9_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/3-540-60218-6_26","volume-title":"CONCUR \u201995 Concurrency Theory","author":"P. Jancar","year":"1995","unstructured":"Jancar, P., Moller, F.: Checking Regular Properties of Petri Nets. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 348\u2013362. Springer, Heidelberg (1995)"},{"key":"9_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/3-540-45314-8_21","volume-title":"Fundamental Approaches to Software Engineering","author":"B. Jacobs","year":"2001","unstructured":"Jacobs, B., Poll, E.: A Logic for the Java Modeling Language JML. In: Hussmann, H. (ed.) FASE 2001. LNCS, vol.\u00a02029, pp. 284\u2013299. Springer, Heidelberg (2001)"},{"key":"9_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/3-540-48523-6_47","volume-title":"Automata, Languages and Programming","author":"A. Ku\u010dera","year":"1999","unstructured":"Ku\u010dera, A., Mayr, R.: Simulation Preorder on Simple Process Algebras. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 503\u2013512. Springer, Heidelberg (1999)"},{"key":"9_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/3-540-45687-2_36","volume-title":"Mathematical Foundations of Computer Science 2002","author":"A. Ku\u010dera","year":"2002","unstructured":"Ku\u010dera, A., Mayr, R.: On the Complexity of Semantic Equivalences for Pushdown Automata and BPA. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol.\u00a02420, pp. 433\u2013445. Springer, Heidelberg (2002)"},{"key":"9_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1007\/3-540-45694-5_39","volume-title":"CONCUR 2002 - Concurrency Theory","author":"A. Ku\u010dera","year":"2002","unstructured":"Ku\u010dera, A., Mayr, R.: Why Is Simulation Harder than Bisimulation? In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Ku\u010dera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 594\u2013610. Springer, Heidelberg (2002)"},{"key":"9_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/11590156_17","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"M. K\u0159et\u00ednsk\u00fd","year":"2005","unstructured":"K\u0159et\u00ednsk\u00fd, M., \u0158eh\u00e1k, V., Strej\u010dek, J.: Reachability of Hennessy-Milner Properties for Weakly Extended PRS. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol.\u00a03821, pp. 213\u2013224. Springer, Heidelberg (2005)"},{"key":"9_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-540-71316-6_6","volume-title":"Programming Languages and Systems","author":"K.G. Larsen","year":"2007","unstructured":"Larsen, K.G., Nyman, U., W\u0105sowski, A.: Modal I\/O Automata for Interface and Product Line Theories. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol.\u00a04421, pp. 64\u201379. Springer, Heidelberg (2007)"},{"key":"9_CR41","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Thomsen, B.: A modal process logic. In: LICS, pp. 203\u2013210 (1988)","DOI":"10.1109\/LICS.1988.5119"},{"issue":"6","key":"9_CR42","doi-asserted-by":"publisher","first-page":"1811","DOI":"10.1145\/197320.197383","volume":"16","author":"B. Liskov","year":"1994","unstructured":"Liskov, B., Wing, J.M.: A behavioral notion of subtyping. ACM Trans. Program. Lang. Syst.\u00a016(6), 1811\u20131841 (1994)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9_CR43","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Xinxin, L.: Equation solving using modal transition systems. In: LICS, pp. 108\u2013117 (1990)","DOI":"10.1109\/LICS.1990.113738"},{"key":"9_CR44","doi-asserted-by":"crossref","unstructured":"Lynch, N.: I\/O automata: A model for discrete event systems. In: 22nd Annual Conference on Information Sciences and Systems, pp. 29\u201338. Princeton University (1988)","DOI":"10.21236\/ADA196047"},{"issue":"1-2","key":"9_CR45","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1006\/inco.1999.2826","volume":"156","author":"R. Mayr","year":"2000","unstructured":"Mayr, R.: Process rewrite systems. Inf. Comput.\u00a0156(1-2), 264\u2013286 (2000)","journal-title":"Inf. Comput."},{"key":"9_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-540-45069-6_29","volume-title":"Computer Aided Verification","author":"K.S. Namjoshi","year":"2003","unstructured":"Namjoshi, K.S.: Abstraction for Branching Time Properties. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 288\u2013300. Springer, Heidelberg (2003)"},{"key":"9_CR47","unstructured":"Nyman, U.: Modal Transition Systems as the Basis for Interface Theories and Product Lines. PhD thesis, Institut for Datalogi, Aalborg Universitet (2008)"},{"key":"9_CR48","doi-asserted-by":"crossref","unstructured":"Raclet, J.-B., Badouel, E., Benveniste, A., Caillaud, B., Passerone, R.: Why are modalities good for interface theories? In: ACSD. IEEE Computer Society Press (2009)","DOI":"10.1109\/ACSD.2009.22"},{"issue":"1-2","key":"9_CR49","doi-asserted-by":"crossref","first-page":"119","DOI":"10.3233\/FI-2011-416","volume":"108","author":"J.-B. Raclet","year":"2011","unstructured":"Raclet, J.-B., Badouel, E., Benveniste, A., Caillaud, B., Legay, A., Passerone, R.: A modal interface theory for component-based design. Fundamenta Informaticae\u00a0108(1-2), 119\u2013149 (2011)","journal-title":"Fundamenta Informaticae"},{"key":"9_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/11874683_6","volume-title":"Computer Science Logic","author":"J. Srba","year":"2006","unstructured":"Srba, J.: Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 89\u2013103. Springer, Heidelberg (2006)"},{"key":"9_CR51","doi-asserted-by":"crossref","unstructured":"Uchitel, S., Chechik, M.: Merging partial behavioural models. In: SIGSOFT FSE, pp. 43\u201352 (2004)","DOI":"10.1145\/1041685.1029904"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32943-2_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T10:33:33Z","timestamp":1744022013000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32943-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642329425","9783642329432"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32943-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}