{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:58Z","timestamp":1725558958288},"publisher-location":"Berlin, Heidelberg","reference-count":56,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137532"},{"type":"electronic","value":"9783642137549"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13754-9_15","type":"book-chapter","created":{"date-parts":[[2010,6,30]],"date-time":"2010-06-30T11:05:52Z","timestamp":1277895952000},"page":"370-399","source":"Crossref","is-referenced-by-count":2,"title":["What Is in a Step: New Perspectives on a Classical Question"],"prefix":"10.1007","author":[{"given":"Willem-Paul","family":"de Roever","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerald","family":"L\u00fcttgen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Mendler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Aguado, J., Mendler, M.: Constructive semantics for instantaneous reactions. Theoretical Computer Science (to appear, 2010); A preliminary version of this article is available as Tech. Rep. 63\/2005, Univ. of Bamberg (2005)","key":"15_CR1","DOI":"10.1016\/j.tcs.2010.09.007"},{"doi-asserted-by":"crossref","unstructured":"Aguado, J., Mendler, M., L\u00fcttgen, G.: A-maze-ing Esterel. In: SLAP\u00a0\u201903. ENTCS, vol.\u00a088, pp. 21\u201337 (2004)","key":"15_CR2","DOI":"10.1016\/j.entcs.2003.05.006"},{"key":"15_CR3","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1145\/503209.503226","volume-title":"ESEC\/FSE\u00a0\u201901","author":"L. Alfaro de","year":"2001","unstructured":"de Alfaro, L., Henzinger, T.A.: Interface automata. In: ESEC\/FSE\u00a0\u201901, pp. 109\u2013120. ACM Press, New York (2001)"},{"doi-asserted-by":"crossref","unstructured":"Andr\u00e9, C.: Computing SyncCharts reactions. In: SLAP\u00a0\u201903. ENTCS, vol.\u00a088, pp. 3\u201319 (2004)","key":"15_CR4","DOI":"10.1016\/j.entcs.2003.05.007"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/3-540-58468-4_163","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"M. Beeck von der","year":"1994","unstructured":"von der Beeck, M.: A comparison of Statecharts variants. In: Langmaack, H., de Roever, W.-P., Vytopil, J. (eds.) FTRTFT 1994 and ProCoS 1994. LNCS, vol.\u00a0863, pp. 128\u2013148. Springer, Heidelberg (1994)"},{"issue":"1","key":"15_CR6","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/JPROC.2002.805826","volume":"91","author":"A. Benveniste","year":"2003","unstructured":"Benveniste, A., Caspi, P., Edwards, S.A., Halbwachs, N., Le Guernic, P., de Simone, R.: The synchronous languages 12 years later. Proc. of the IEEE\u00a091(1), 64\u201383 (2003)","journal-title":"Proc. of the IEEE"},{"issue":"2","key":"15_CR7","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0167-6423(92)90005-V","volume":"19","author":"G. Berry","year":"1992","unstructured":"Berry, G., Gonthier, G.: The Esterel synchronous programming language: Design, semantics, implementation. Science of Computer Programming\u00a019(2), 87\u2013152 (1992)","journal-title":"Science of Computer Programming"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/10722167_45","volume-title":"Computer Aided Verification","author":"T. Bienm\u00fcller","year":"2000","unstructured":"Bienm\u00fcller, T., Damm, W., Wittke, H.: The STATEMATE verification environment \u2013 Making it real. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 561\u2013567. Springer, Heidelberg (2000)"},{"issue":"4","key":"15_CR9","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1002\/spe.4380210406","volume":"21","author":"F. Boussinot","year":"1991","unstructured":"Boussinot, F.: Reactive C: An extension of C to program reactive systems. Software\u00a0\u2013 Practice and Experience\u00a021(4), 401\u2013428 (1991)","journal-title":"Software\u00a0\u2013 Practice and Experience"},{"unstructured":"Boussinot, F.: SugarCubes implementation of causality. Technical Report RR-3487, INRIA (1998)","key":"15_CR10"},{"unstructured":"Boussinot, F., Dabrowski, F.: Safe reactive programming: The FunLoft proposal. In: MULTIPROG: Programmability Issues for Multi-Core Computers. Informal workshop proceedings (2008)","key":"15_CR11"},{"issue":"4","key":"15_CR12","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1109\/32.491649","volume":"22","author":"F. Boussinot","year":"1996","unstructured":"Boussinot, F., de Simone, R.: The SL synchronous language. IEEE Trans. on Software Engineering\u00a022(4), 256\u2013266 (1996)","journal-title":"IEEE Trans. on Software Engineering"},{"issue":"8","key":"15_CR13","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Comp.\u00a035(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. on Comp."},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-94-009-5203-4_4","volume-title":"Handbook of Philosophical Logic, ch. 4","author":"D. Dalen van","year":"1986","unstructured":"van Dalen, D.: Intuitionistic logic. In: van Dalen, D. (ed.) Handbook of Philosophical Logic, ch. 4, vol.\u00a0III, pp. 225\u2013339. Reidel, Dordrechtz (1986)"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-49213-5_8","volume-title":"Compositionality: The Significant Difference","author":"W. Damm","year":"1998","unstructured":"Damm, W., Josko, B., Hungar, H., Pnueli, A.: A compositional real-time semantics of STATEMATE designs. In: de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.) COMPOS 1997. LNCS, vol.\u00a01536, pp. 186\u2013238. Springer, Heidelberg (1998)"},{"issue":"3","key":"15_CR16","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.scico.2008.09.001","volume":"74","author":"R. Eshuis","year":"2009","unstructured":"Eshuis, R.: Reconciling Statechart semantics. Science of Computer Programming\u00a074(3), 65\u201399 (2009)","journal-title":"Science of Computer Programming"},{"unstructured":"Esmaeilsabzali, S., Day, N.A., Atlee, J.M.: Big-step semantics. Technical Report CS-2009-05, Univ. of Waterloo (2009)","key":"15_CR17"},{"unstructured":"Esterel Technologies. SCADE Suite, http:\/\/www.esterel-technologies.com","key":"15_CR18"},{"issue":"4","key":"15_CR19","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","volume":"2","author":"M. Fitting","year":"1985","unstructured":"Fitting, M.: A Kripke-Kleene semantics for logic programs. Logic Programming\u00a02(4), 295\u2013312 (1985)","journal-title":"Logic Programming"},{"issue":"2","key":"15_CR20","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0743-1066(91)90014-G","volume":"11","author":"M.C. Fitting","year":"1991","unstructured":"Fitting, M.C.: Bilattices and the semantics of logic programming. Journal of Logic Programming\u00a011(2), 91\u2013116 (1991)","journal-title":"Journal of Logic Programming"},{"unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: ICLP\/SLP, pp. 1070\u20131080 (1988)","key":"15_CR21"},{"key":"15_CR22","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0167-6423(87)90035-9","volume":"8","author":"D. Harel","year":"1987","unstructured":"Harel, D.: Statecharts: A visual formalism for complex systems. Science of Computer Programming\u00a08, 231\u2013274 (1987)","journal-title":"Science of Computer Programming"},{"key":"15_CR23","first-page":"5","volume-title":"History of Programming Languages","author":"D. Harel","year":"2007","unstructured":"Harel, D.: Statecharts in the making: A personal account. In: History of Programming Languages, pp. 5-1\u20135-43. ACM Press, New York (2007)"},{"doi-asserted-by":"crossref","unstructured":"Harel, D., Gery, E.: Executable object modeling with Statecharts. IEEE Computer, 31\u201342 (July 1997)","key":"15_CR24","DOI":"10.1109\/2.596624"},{"issue":"4","key":"15_CR25","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1109\/32.54292","volume":"16","author":"D. Harel","year":"1990","unstructured":"Harel, D., Lachover, H., Naamad, A., Pnueli, A., Politi, M., Sherman, R., Shtul-Trauring, A., Trakhtenbrot, M.: STATEMATE: A working environment for the development of complex reactive systems. IEEE Trans. on Software Engineering\u00a016(4), 403\u2013414 (1990)","journal-title":"IEEE Trans. on Software Engineering"},{"issue":"4","key":"15_CR26","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/235321.235322","volume":"5","author":"D. Harel","year":"1996","unstructured":"Harel, D., Naamad, A.: The STATEMATE semantics of Statecharts. ACM Trans. on Software Engineering Methodology\u00a05(4), 293\u2013333 (1996)","journal-title":"ACM Trans. on Software Engineering Methodology"},{"key":"15_CR27","series-title":"NATO ASI Series","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-642-82453-1_17","volume-title":"Logics and Models of Concurrent Systems","author":"D. Harel","year":"1985","unstructured":"Harel, D., Pnueli, A.: On the development of reactive systems. In: Logics and Models of Concurrent Systems. NATO ASI Series, vol.\u00a0F-13, pp. 477\u2013498. Springer, Heidelberg (1985)"},{"key":"15_CR28","first-page":"54","volume-title":"LICS\u00a0\u201987","author":"D. Harel","year":"1987","unstructured":"Harel, D., Pnueli, A., Schmidt, J.P., Sherman, R.: On the formal semantics of Statecharts. In: LICS\u00a0\u201987, pp. 54\u201364. IEEE Computer Society Press, Los Alamitos (1987)"},{"key":"15_CR29","volume-title":"Modeling Reactive Systems with Statecharts: The STATEMATE Approach","author":"D. Harel","year":"1998","unstructured":"Harel, D., Politi, M.: Modeling Reactive Systems with Statecharts: The STATEMATE Approach. McGraw Hill, New York (1998)"},{"key":"15_CR30","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0304-3975(92)90053-I","volume":"101","author":"J.J.M. Hooman","year":"1992","unstructured":"Hooman, J.J.M., Ramesh, S., de Roever, W.-P.: A compositional axiomatization of Statecharts. Theoretical Computer Science\u00a0101, 289\u2013335 (1992)","journal-title":"Theoretical Computer Science"},{"key":"15_CR31","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0020-0190(91)90190-S","volume":"37","author":"C. Huizing","year":"1991","unstructured":"Huizing, C., de Roever, W.-P.: Introduction to design choices in the semantics of Statecharts. Information Processing Letters\u00a037, 205\u2013213 (1991)","journal-title":"Information Processing Letters"},{"key":"15_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/BFb0031997","volume-title":"Real-Time: Theory in Practice","author":"C. Huizing","year":"1992","unstructured":"Huizing, C., Gerth, R.: Semantics of reactive systems in abstract time. In: Huizing, C., de Bakker, J.W., Rozenberg, G., de Roever, W.-P. (eds.) REX 1991. LNCS, vol.\u00a0600, pp. 291\u2013314. Springer, Heidelberg (1992)"},{"key":"15_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BFb0026110","volume-title":"CAAP \u201988","author":"C. Huizing","year":"1988","unstructured":"Huizing, C., Gerth, R., de Roever, W.-P.: Modeling Statecharts behavior in a fully abstract way. In: Dauchet, M., Nivat, M. (eds.) CAAP 1988. LNCS, vol.\u00a0299, pp. 271\u2013294. Springer, Heidelberg (1988)"},{"issue":"12","key":"15_CR34","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1109\/32.368134","volume":"20","author":"F. Jahanian","year":"1994","unstructured":"Jahanian, F., Mok, A.K.: Modechart: A specification language for real-time systems. IEEE Trans. on Software Engineering\u00a020(12), 933\u2013947 (1994)","journal-title":"IEEE Trans. on Software Engineering"},{"issue":"9","key":"15_CR35","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1109\/32.317428","volume":"20","author":"N.G. Leveson","year":"1994","unstructured":"Leveson, N.G., Heimdahl, M., Hildreth, H., Reese, J.D.: Requirements specification for process-control systems. IEEE Trans. on Software Engineering\u00a020(9), 684\u2013707 (1994)","journal-title":"IEEE Trans. on Software Engineering"},{"issue":"1-2","key":"15_CR36","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0304-3975(97)00245-4","volume":"216","author":"F. Levi","year":"1999","unstructured":"Levi, F.: A compositional \u03bc-calculus proof system for Statecharts processes. Theoretical Computer Science\u00a0216(1-2), 271\u2013311 (1999)","journal-title":"Theoretical Computer Science"},{"key":"15_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/3-540-48320-9_28","volume-title":"CONCUR\u201999. Concurrency Theory","author":"G. L\u00fcttgen","year":"1999","unstructured":"L\u00fcttgen, G., von der Beeck, M., Cleaveland, R.: Statecharts via process algebra. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol.\u00a01664, pp. 399\u2013414. Springer, Heidelberg (1999)"},{"doi-asserted-by":"crossref","unstructured":"L\u00fcttgen, G., von der Beeck, M., Cleaveland, R.: A compositional approach to Statecharts semantics. In: FSE\u00a02000, ACM Software Engineering Notes, pp. 120\u2013129 (2000)","key":"15_CR38","DOI":"10.1145\/355045.355062"},{"unstructured":"L\u00fcttgen, G., Mendler, M.: Statecharts: From visual syntax to model-theoretic semantics. In: Integrating Diagrammatic and Formal Specification Techniques, pp. 615\u2013621. Austrian Computer Society (2001)","key":"15_CR39"},{"key":"15_CR40","series-title":"Lecture Notes in Computer Science","first-page":"163","volume-title":"CONCUR 2002 - Concurrency Theory","author":"G. L\u00fcttgen","year":"2002","unstructured":"L\u00fcttgen, G., Mendler, M.: Axiomatizing an algebra of step reactions for synchronous languages. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 163\u2013174. Springer, Heidelberg (2002)"},{"issue":"1","key":"15_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/504077.504078","volume":"3","author":"G. L\u00fcttgen","year":"2002","unstructured":"L\u00fcttgen, G., Mendler, M.: The intuitionism behind Statecharts steps. ACM Trans. on Computational Logic\u00a03(1), 1\u201341 (2002)","journal-title":"ACM Trans. on Computational Logic"},{"doi-asserted-by":"crossref","unstructured":"L\u00fcttgen, G., Mendler, M.: Towards a model-theory for Esterel. In: SLAP\u00a0\u201902. ENTCS, vol.\u00a065(5) (2002)","key":"15_CR42","DOI":"10.1016\/S1571-0661(05)80444-X"},{"key":"15_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/3-540-61604-7_84","volume-title":"CONCUR \u201996: Concurrency Theory","author":"A. Maggiolo-Schettini","year":"1996","unstructured":"Maggiolo-Schettini, A., Peron, A., Tini, S.: Equivalences of Statecharts. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 687\u2013702. Springer, Heidelberg (1996)"},{"issue":"1","key":"15_CR44","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/S0304-3975(01)00381-4","volume":"290","author":"A. Maggiolo-Schettini","year":"2003","unstructured":"Maggiolo-Schettini, A., Peron, A., Tini, S.: A comparison of Statecharts step semantics. Theoretical Computer Science\u00a0290(1), 465\u2013498 (2003)","journal-title":"Theoretical Computer Science"},{"key":"15_CR45","volume-title":"PPDP\u00a0\u201905","author":"L. Mandel","year":"2005","unstructured":"Mandel, L., Pouzet, M.: ReactiveML: A reactive extension to ML. In: PPDP\u00a0\u201905. ACM Press, New York (2005)"},{"issue":"1\/3","key":"15_CR46","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0096-0551(01)00016-9","volume":"27","author":"F. Maraninchi","year":"2001","unstructured":"Maraninchi, F., R\u00e9mond, Y.: Argos: An automaton-based synchronous language. Comput. Lang.\u00a027(1\/3), 61\u201392 (2001)","journal-title":"Comput. Lang."},{"unstructured":"The Mathworks. Stateflow user\u2019s guide, http:\/\/www.mathworks.com","key":"15_CR47"},{"unstructured":"Niemel\u00e4, I., Simons, P., Syrj\u00e4nen, T.: Smodels: A system for answer set programming. In: Workshop on Non-Monotonic Reasoning, Breckenridge, Colorado, USA (April 2000)","key":"15_CR48"},{"key":"15_CR49","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-94-015-9309-0_8","volume-title":"What is Negation?","author":"D. Pearce","year":"1999","unstructured":"Pearce, D.: From here to there: Stable negation in logic programming. In: Gabbay, D.M., Wansig, H. (eds.) What is Negation?, pp. 161\u2013181. Kluwer, Dordrecht (1999)"},{"key":"15_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/BFb0030631","volume-title":"TAPSOFT\u201997: Theory and Practice of Software Development","author":"J. Phillips","year":"1997","unstructured":"Phillips, J., Scholz, P.: Compositional specification of embedded systems with Statecharts. In: Bidoit, M., Dauchet, M. (eds.) CAAP 1997, FASE 1997, and TAPSOFT 1997. LNCS, vol.\u00a01214, pp. 637\u2013651. Springer, Heidelberg (1997)"},{"key":"15_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-54415-1_49","volume-title":"Theoretical Aspects of Computer Software","author":"A. Pnueli","year":"1991","unstructured":"Pnueli, A., Shalev, M.: What is in a step: On the semantics of Statecharts. In: Ito, T., Meyer, A.R. (eds.) TACS 1991. LNCS, vol.\u00a0526, pp. 244\u2013264. Springer, Heidelberg (1991)"},{"key":"15_CR52","volume-title":"Compiling ESTEREL","author":"D. Potop-Butucaru","year":"2007","unstructured":"Potop-Butucaru, D., Edwards, S.A., Berry, G.: Compiling ESTEREL. Springer, Heidelberg (2007)"},{"key":"15_CR53","first-page":"71","volume-title":"LICS\u00a0\u201994","author":"V.A. Saraswat","year":"1994","unstructured":"Saraswat, V.A., Jagadeesan, R., Gupta, V.: Foundations of timed concurrent constraint programming. In: LICS\u00a0\u201994, pp. 71\u201380. IEEE Computer Society Press, Los Alamitos (1994)"},{"key":"15_CR54","first-page":"521","volume-title":"Logic from Computer Science","author":"J.C. Shepherdson","year":"1991","unstructured":"Shepherdson, J.C.: Logics for negation as failure. In: Logic from Computer Science, pp. 521\u2013583. Springer, Heidelberg (1991)"},{"key":"15_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/11880240_18","volume-title":"Model Driven Engineering Languages and Systems","author":"A. Taleghani","year":"2006","unstructured":"Taleghani, A., Atlee, J.M.: Semantic variations among UML State Machines. In: Nierstrasz, O., Whittle, J., Harel, D., Reggio, G. (eds.) MoDELS 2006. LNCS, vol.\u00a04199, pp. 245\u2013259. Springer, Heidelberg (2006)"},{"key":"15_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-48654-1_2","volume-title":"CONCUR \u201994: Concurrency Theory","author":"A.C. Uselton","year":"1994","unstructured":"Uselton, A.C., Smolka, S.A.: A compositional semantics for Statecharts using labeled transition systems. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol.\u00a0836, pp. 2\u201317. Springer, Heidelberg (1994)"}],"container-title":["Lecture Notes in Computer Science","Time for Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13754-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T20:16:41Z","timestamp":1685650601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13754-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137532","9783642137549"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13754-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}