{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T11:45:43Z","timestamp":1752666343529},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,4,9]],"date-time":"2016-04-09T00:00:00Z","timestamp":1460160000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Softw Tools Technol Transfer"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s10009-016-0416-3","type":"journal-article","created":{"date-parts":[[2016,4,9]],"date-time":"2016-04-09T17:21:12Z","timestamp":1460222472000},"page":"367-390","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["The first reactive synthesis competition (SYNTCOMP 2014)"],"prefix":"10.1007","volume":"19","author":[{"given":"Swen","family":"Jacobs","sequence":"first","affiliation":[]},{"given":"Roderick","family":"Bloem","sequence":"additional","affiliation":[]},{"given":"Romain","family":"Brenguier","sequence":"additional","affiliation":[]},{"given":"R\u00fcdiger","family":"Ehlers","sequence":"additional","affiliation":[]},{"given":"Timotheus","family":"Hell","sequence":"additional","affiliation":[]},{"given":"Robert","family":"K\u00f6nighofer","sequence":"additional","affiliation":[]},{"given":"Guillermo A.","family":"P\u00e9rez","sequence":"additional","affiliation":[]},{"given":"Jean-Fran\u00e7ois","family":"Raskin","sequence":"additional","affiliation":[]},{"given":"Leonid","family":"Ryzhyk","sequence":"additional","affiliation":[]},{"given":"Ocan","family":"Sankur","sequence":"additional","affiliation":[]},{"given":"Martina","family":"Seidl","sequence":"additional","affiliation":[]},{"given":"Leander","family":"Tentrup","sequence":"additional","affiliation":[]},{"given":"Adam","family":"Walker","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,9]]},"reference":[{"key":"416_CR1","unstructured":"Alur, R., Bod\u00edk, R., Dallal, E., Fisman, D., Garg, P., Juniwal, G., Kress-Gazit, H., Madhusudan, P., Martin, M.M.K., Raghothaman, M., Saha, S., Seshia, S.A., Singh, R., Solar-Lezama, A., Torlak, E., Udupa, A.: Syntax-guided synthesis. In: Dependable Software Systems Engineering, NATO Science for Peace and Security Series, D: Information and Communication Security, vol. 40, pp. 1\u201325. IOS Press (2015)"},{"issue":"2","key":"416_CR2","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/s10009-004-0179-0","volume":"7","author":"R Alur","year":"2005","unstructured":"Alur, R., Madhusudan, P., Nam, W.: Symbolic computational techniques for solving games. STTT 7(2), 118\u2013128 (2005)","journal-title":"STTT"},{"key":"416_CR3","doi-asserted-by":"publisher","unstructured":"Aziz, A., Tasiran, S., Brayton, R.K.: BDD variable ordering for interacting finite state machines. In: DAC, pp. 283\u2013288 (1994)","DOI":"10.1145\/196244.196379"},{"key":"416_CR4","unstructured":"Balint, A., Diepold, D., Gall, D., Gerber, S., Kapler, G., Retz, R.: EDACC - an advanced platform for the experiment design, administration and analysis of empirical algorithms. In: LION 5. Selected Papers, LNCS, vol. 6683, pp. 586\u2013599. Springer, (2011)"},{"issue":"4","key":"416_CR5","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s10817-006-9026-1","volume":"35","author":"CW Barrett","year":"2005","unstructured":"Barrett, C.W., de Moura, L.M., Stump, A.: Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005). J. Autom. Reason. 35(4), 373\u2013390 (2005)","journal-title":"J. Autom. Reason."},{"key":"416_CR6","doi-asserted-by":"crossref","unstructured":"Beyer, D.: Competition on software verification - (SV-COMP). In: TACAS, LNCS, vol. 7214, pp. 504\u2013524. Springer (2012)","DOI":"10.1007\/978-3-642-28756-5_38"},{"key":"416_CR7","doi-asserted-by":"publisher","unstructured":"Beyer, D., L\u00f6we, S., Wendler, P.: Benchmarking and resource measurement. In: SPIN 2015, LNCS, vol. 9232, pp. 160\u2013178. Springer (2015)","DOI":"10.1007\/978-3-319-23404-5_12"},{"key":"416_CR8","doi-asserted-by":"publisher","unstructured":"Bloem, R., Cimatti, A., Greimel, K., Hofferek, G., K\u00f6nighofer, R., Roveri, M., Schuppan, V., Seeber, R.: RATSY - A new requirements analysis tool with synthesis. In: CAV, LNCS, vol. 6174, pp. 425\u2013429. Springer (2010)","DOI":"10.1007\/978-3-642-14295-6_37"},{"key":"416_CR9","doi-asserted-by":"publisher","unstructured":"Bloem, R., Egly, U., Klampfl, P., K\u00f6nighofer, R., Lonsing, F.: SAT-based methods for circuit synthesis. In: FMCAD\u201914, pp. 31\u201334. IEEE (2014)","DOI":"10.1109\/FMCAD.2014.6987592"},{"key":"416_CR10","doi-asserted-by":"publisher","unstructured":"Bloem, R., Galler, S.J., Jobstmann, B., Piterman, N., Pnueli, A., Weiglhofer, M.: Automatic hardware synthesis from specifications: a case study. In: DATE, pp. 1188\u20131193. ACM (2007)","DOI":"10.1109\/DATE.2007.364456"},{"issue":"4","key":"416_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2007.09.004","volume":"190","author":"R Bloem","year":"2007","unstructured":"Bloem, R., Galler, S.J., Jobstmann, B., Piterman, N., Pnueli, A., Weiglhofer, M.: Specify, compile, run: hardware from PSL. Electr. Notes Theor. Comput. Sci. 190(4), 3\u201316 (2007)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"3","key":"416_CR12","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1016\/j.jcss.2011.08.007","volume":"78","author":"R Bloem","year":"2012","unstructured":"Bloem, R., Jobstmann, B., Piterman, N., Pnueli, A., Sa\u2019ar, Y.: Synthesis of reactive(1) designs. J. Comput. Syst. Sci. 78(3), 911\u2013938 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"416_CR13","doi-asserted-by":"publisher","unstructured":"Bloem, R., K\u00f6nighofer, R., Seidl, M.: SAT-based synthesis methods for safety specs. In: VMCAI, LNCS, vol. 8318, pp. 1\u201320. Springer (2014)","DOI":"10.1007\/978-3-642-54013-4_1"},{"key":"416_CR14","doi-asserted-by":"crossref","unstructured":"Bohy, A., Bruy\u00e8re, V., Filiot, E., Jin, N., Raskin, J.-F.: Acacia+, a tool for LTL synthesis. In: CAV, LNCS, vol. 7358, pp. 652\u2013657. Springer (2012)","DOI":"10.1007\/978-3-642-31424-7_45"},{"key":"416_CR15","doi-asserted-by":"publisher","unstructured":"Bradley, A.R.: SAT-based model checking without unrolling. In: VMCAI, LNCS, vol. 6538, pp. 70\u201387. Springer (2011)","DOI":"10.1007\/978-3-642-18275-4_7"},{"key":"416_CR16","doi-asserted-by":"publisher","unstructured":"Brayton, R.K., Hachtel, G.D., Sangiovanni-Vincentelli, A.L., Somenzi, F., Aziz, A., Cheng, S., Edwards, S.A., Khatri, S.P., Kukimoto, Y., Pardo, A., Qadeer, S., Ranjan, R.K., Sarwary, S., Shiple, T.R., Swamy, G., Villa, T.: VIS: a system for verification and synthesis. In: CAV, LNCS, vol. 1102, pp. 428\u2013432. Springer (1996)","DOI":"10.1007\/3-540-61474-5_95"},{"key":"416_CR17","doi-asserted-by":"publisher","unstructured":"Brayton, R.K., Mishchenko, A.: ABC: an academic industrial-strength verification tool. In: CAV, LNCS, vol. 6174, pp. 24\u201340. Springer (2010)","DOI":"10.1007\/978-3-642-14295-6_5"},{"key":"416_CR18","doi-asserted-by":"publisher","unstructured":"Brenguier, R., P\u00e9rez, G.A., Raskin, J.-F., Sankur, O.: AbsSynthe: abstract synthesis from succinct safety specifications. In: SYNT, EPTCS, vol. 157, pp. 100\u2013116. Open Publishing Association (2014)","DOI":"10.4204\/EPTCS.157.11"},{"issue":"8","key":"416_CR19","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. 35(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"key":"416_CR20","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1090\/S0002-9947-1969-0280205-0","volume":"138","author":"J B\u00fcchi","year":"1969","unstructured":"B\u00fcchi, J., Landweber, L.: Solving sequential conditions by finite-state strategies. Trans. Am. Math. Soc. 138, 295\u2013311 (1969)","journal-title":"Trans. Am. Math. Soc."},{"key":"416_CR21","unstructured":"Burch, J.R., Clarke, E.M., Long, D.E.: Symbolic model checking with partitioned transistion relations. In: VLSI, pp. 49\u201358 (1991)"},{"key":"416_CR22","doi-asserted-by":"crossref","unstructured":"Chiang, T., Jiang. J.R.: Property-directed synthesis of reactive systems from safety specifications. In: ICCAD, pp. 794\u2013801. ACM (2015)","DOI":"10.1109\/ICCAD.2015.7372652"},{"key":"416_CR23","unstructured":"Church, A.: Logic, arithmetic and automata. In: Proceedings of the International Congress of Mathematicians, pp. 23\u201335 (1962)"},{"key":"416_CR24","doi-asserted-by":"publisher","unstructured":"Coudert, O., Madre, J.C.: A unified framework for the formal verification of sequential circuits. In: ICCAD, pp. 126\u2013129 (1990)","DOI":"10.1109\/ICCAD.1990.129859"},{"key":"416_CR25","doi-asserted-by":"publisher","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL, pp. 238\u2013252. ACM (1977)","DOI":"10.1145\/512950.512973"},{"key":"416_CR26","doi-asserted-by":"publisher","unstructured":"de Alfaro, L., Roy, P.: Solving games via three-valued abstraction refinement. In: CONCUR, LNCS, vol. 4703, pp. 74\u201389. Springer (2007)","DOI":"10.1007\/978-3-540-74407-8_6"},{"key":"416_CR27","doi-asserted-by":"publisher","unstructured":"Ehlers, R.: Experimental aspects of synthesis. In: iWIGP, EPTCS, vol. 50, pp. 1\u201316 (2011)","DOI":"10.4204\/EPTCS.50.1"},{"key":"416_CR28","doi-asserted-by":"publisher","unstructured":"Ehlers, R.: Unbeast: symbolic bounded synthesis. In: TACAS, LNCS, vol. 6605, pp. 272\u2013275. Springer (2011)","DOI":"10.1007\/978-3-642-19835-9_25"},{"issue":"2","key":"416_CR29","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/s10703-011-0137-x","volume":"40","author":"R Ehlers","year":"2012","unstructured":"Ehlers, R.: Symbolic bounded synthesis. Formal Methods Syst. Des. 40(2), 232\u2013262 (2012)","journal-title":"Formal Methods Syst. Des."},{"key":"416_CR30","unstructured":"Ehlers, R., K\u00f6nighofer, R., Hofferek, G.: Symbolically synthesizing small circuits. In: FMCAD\u201912, pp. 91\u2013100. IEEE (2012)"},{"issue":"3","key":"416_CR31","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0167-6423(83)90017-5","volume":"2","author":"EA Emerson","year":"1982","unstructured":"Emerson, E.A., Clarke, E.M.: Using branching time temporal logic to synthesize synchronization skeletons. Sci. Comput. Program. 2(3), 241\u2013266 (1982)","journal-title":"Sci. Comput. Program."},{"issue":"5\u20136","key":"416_CR32","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s10009-012-0222-5","volume":"15","author":"E Filiot","year":"2013","unstructured":"Filiot, E., Jin, N., Raskin, J.: Exploiting structure in LTL synthesis. STTT 15(5\u20136), 541\u2013561 (2013)","journal-title":"STTT"},{"issue":"3","key":"416_CR33","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10703-011-0115-3","volume":"39","author":"E Filiot","year":"2011","unstructured":"Filiot, E., Jin, N., Raskin, J.-F.: Antichains and compositional algorithms for LTL synthesis. Formal Methods Syst. Des. 39(3), 261\u2013296 (2011)","journal-title":"Formal Methods Syst. Des."},{"key":"416_CR34","doi-asserted-by":"publisher","unstructured":"Finkbeiner, B., Jacobs, S.: Lazy synthesis. In: VMCAI, LNCS, vol. 7148, pp. 219\u2013234. Springer (2012)","DOI":"10.1007\/978-3-642-27940-9_15"},{"issue":"5\u20136","key":"416_CR35","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s10009-012-0228-z","volume":"15","author":"B Finkbeiner","year":"2013","unstructured":"Finkbeiner, B., Schewe, S.: Bounded synthesis. STTT 15(5\u20136), 519\u2013539 (2013)","journal-title":"STTT"},{"key":"416_CR36","doi-asserted-by":"publisher","unstructured":"Graf, S., Sa\u00efdi, H.: Construction of abstract state graphs with PVS. In: CAV, LNCS, vol. 1254, pp. 72\u201383. Springer (1997)","DOI":"10.1007\/3-540-63166-6_10"},{"key":"416_CR37","doi-asserted-by":"publisher","unstructured":"Henzinger, T.A., Jhala, R., Majumdar, R.: Counterexample-guided control. In: ICALP, LNCS, vol. 2719, pp. 886\u2013902, Springer (2003)","DOI":"10.1007\/3-540-45061-0_69"},{"issue":"1","key":"416_CR38","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1109\/43.822619","volume":"19","author":"Y Hong","year":"2000","unstructured":"Hong, Y., Beerel, P.A., Burch, J.R., McMillan, K.L.: Sibling-substitution-based BDD minimization using don\u2019t cares. IEEE Trans. CAD of Integr. Circuits Syst. 19(1), 44\u201355 (2000)","journal-title":"IEEE Trans. CAD of Integr. Circuits Syst."},{"key":"416_CR39","unstructured":"Jacobs, S.: Extended AIGER format for synthesis. CoRR (2014). arXiv:1405.5793 . Accessed Feb 2016"},{"key":"416_CR40","unstructured":"Jacobs, S., Bloem, R., Brenguier, R., Ehlers, R., Hell, T., K\u00f6nighofer, R., P\u00e9rez, G.A., Raskin, J., Ryzhyk, L., Sankur, O., Seidl, M., Tentrup, L., Walker, A.: The first reactive synthesis competition (SYNTCOMP 2014). CoRR (2015). arXiv:1506.08726 . Accessed Feb 2016"},{"key":"416_CR41","doi-asserted-by":"crossref","unstructured":"Jacobs, S., Bloem, R., Brenguier, R., K\u00f6nighofer, R., P\u00e9rez, G.A., Raskin, J.-F., Ryzhyk, L., Sankur, O., Seidl, M., Tentrup, L., Walker, A.: The second reactive synthesis competition (SYNTCOMP 2015). In: SYNT, EPTCS, vol. 202, pp. 27\u201357. Open Publishing Association (2016)","DOI":"10.4204\/EPTCS.202.4"},{"key":"416_CR42","unstructured":"Jacobs, S., Klein, F.: A high-level LTL synthesis format: TLSF v1.0. CoRR (2016). arXiv:1601.05228 . Accessed Feb 2016"},{"issue":"1","key":"416_CR43","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1609\/aimag.v33i1.2395","volume":"33","author":"M J\u00e4rvisalo","year":"2012","unstructured":"J\u00e4rvisalo, M., Berre, D.L., Roussel, O., Simon, L.: The international SAT solver competitions. AI Mag 33(1), 89\u201394 (2012)","journal-title":"AI Mag"},{"key":"416_CR44","doi-asserted-by":"publisher","unstructured":"Jobstmann, B., Bloem, R.: Optimizations for LTL synthesis. In: FMCAD, pp. 117\u2013124. IEEE Computer Society (2006)","DOI":"10.1109\/FMCAD.2006.22"},{"key":"416_CR45","doi-asserted-by":"crossref","unstructured":"Jobstmann, B., Galler, S.J., Weiglhofer, M., Bloem, R.: Anzu: A tool for property synthesis. In: CAV, LNCS, vol. 4590, pp. 258\u2013262. Springer (2006)","DOI":"10.1007\/978-3-540-73368-3_29"},{"key":"416_CR46","doi-asserted-by":"publisher","unstructured":"Kupferman, O., Vardi, M.Y.: Safraless decision procedures. In: FOCS, pp. 531\u2013542. IEEE Computer Society (2005)","DOI":"10.1109\/SFCS.2005.66"},{"key":"416_CR47","doi-asserted-by":"publisher","unstructured":"Kurshan, R.P.: Automata-theoretic verification of coordinating processes. In: Analysis and Optimization of Systems: Discrete Event Systems, pp. 16\u201328. Springer (1994)","DOI":"10.1007\/BFb0033528"},{"issue":"3","key":"416_CR48","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10601-010-9092-1","volume":"15","author":"C Lecoutre","year":"2010","unstructured":"Lecoutre, C., Roussel, O., van Dongen, M.R.C.: Promoting robust black-box solvers through competitions. Constraints 15(3), 317\u2013326 (2010)","journal-title":"Constraints"},{"key":"416_CR49","doi-asserted-by":"publisher","unstructured":"Mishchenko, A., Chatterjee, S., Brayton, R.K.: Dag-aware AIG rewriting a fresh look at combinational logic synthesis. In: DAC, pp. 532\u2013535. ACM (2006)","DOI":"10.1145\/1146909.1147048"},{"key":"416_CR50","unstructured":"Mishchenko, A., Chatterjee, S., Jiang, R., Brayton, R.: FRAIGs: A unifying representation for logic synthesis and verification. Technical report, EECS Department, U. C. Berkeley (2005)"},{"key":"416_CR51","doi-asserted-by":"publisher","unstructured":"Morgenstern, A., Gesell, M., Schneider, K.: Solving games using incremental induction. In: IFM\u201913, LNCS 7940, pp. 177\u2013191. Springer (2013)","DOI":"10.1007\/978-3-642-38613-8_13"},{"key":"416_CR52","doi-asserted-by":"publisher","unstructured":"Niemetz, A., Preiner, M., Lonsing, F., Seidl, M., Biere, A.: Resolution-based certificate extraction for QBF. In: SAT\u201912, LNCS 7317, pp. 430\u2013435. Springer (2012)","DOI":"10.1007\/978-3-642-31612-8_33"},{"key":"416_CR53","doi-asserted-by":"publisher","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: POPL, pp. 179\u2013190. ACM Press (1989)","DOI":"10.1145\/75277.75293"},{"key":"416_CR54","first-page":"1","volume":"141","author":"MO Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Am. Math. Soc. 141, 1\u201335 (1969)","journal-title":"Trans. Am. Math. Soc."},{"key":"416_CR55","unstructured":"Ranjan, R.K., Aziz, A., Brayton, R.K., Plessier, B., Pixley, C.: Efficient bdd algorithms for fsm synthesis and verification. In: International Workshop on Logic Synthesis (1995)"},{"issue":"4","key":"416_CR56","first-page":"139","volume":"7","author":"O Roussel","year":"2011","unstructured":"Roussel, O.: Controlling a solver execution with the runsolver tool. JSAT 7(4), 139\u2013144 (2011)","journal-title":"JSAT"},{"key":"416_CR57","doi-asserted-by":"publisher","unstructured":"Rudell, R.: Dynamic variable ordering for ordered binary decision diagrams. In: ICCAD, pp. 42\u201347. IEEE Computer Society (1993)","DOI":"10.1109\/ICCAD.1993.580029"},{"key":"416_CR58","doi-asserted-by":"crossref","unstructured":"Seidl, M., K\u00f6nighofer, R.: Partial witnesses from preprocessed quantified boolean formulas. In: DATE\u201914, pp. 1\u20136. IEEE (2014)","DOI":"10.7873\/DATE2014.162"},{"issue":"5\u20136","key":"416_CR59","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s10009-012-0224-3","volume":"15","author":"S Sohail","year":"2013","unstructured":"Sohail, S., Somenzi, F.: Safety first: a two-stage algorithm for the synthesis of reactive systems. STTT 15(5\u20136), 433\u2013454 (2013)","journal-title":"STTT"},{"key":"416_CR60","unstructured":"Somenzi, F.: Binary decision diagrams. In: Calculational System Design, vol. 173, pp. 303. IOS Press (1999)"},{"issue":"1\u20132","key":"416_CR61","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0004-3702(01)00113-8","volume":"131","author":"G Sutcliffe","year":"2001","unstructured":"Sutcliffe, G., Suttner, C.B.: Evaluating general purpose automated theorem proving systems. Artif. Intell. 131(1\u20132), 39\u201354 (2001)","journal-title":"Artif. Intell."},{"issue":"1","key":"416_CR62","first-page":"35","volume":"19","author":"G Sutcliffe","year":"2006","unstructured":"Sutcliffe, G., Suttner, C.B.: The state of CASC. AI Commun. 19(1), 35\u201348 (2006)","journal-title":"AI Commun."},{"key":"416_CR63","doi-asserted-by":"publisher","unstructured":"Thomas, W.: On the synthesis of strategies in infinite games. In: STACS, pp. 1\u201313 (1995)","DOI":"10.1007\/3-540-59042-0_57"},{"key":"416_CR64","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.entcs.2013.07.009","volume":"296","author":"T Dijk van","year":"2013","unstructured":"van Dijk, T., Laarman, A., van de Pol, J.: Multi-core BDD operations for symbolic reachability. Electron. Notes Theor. Comput. Sci. 296, 127\u2013143 (2013)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"416_CR65","doi-asserted-by":"crossref","unstructured":"van Dijk, T., van de Pol, J.: Sylvan: Multi-core decision diagrams. In: TACAS 2015, LNCS, vol. 9035, pp. 677\u2013691 Springer (2015)","DOI":"10.1007\/978-3-662-46681-0_60"}],"container-title":["International Journal on Software Tools for Technology Transfer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10009-016-0416-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10009-016-0416-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10009-016-0416-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10009-016-0416-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T11:37:57Z","timestamp":1567769877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10009-016-0416-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,9]]},"references-count":65,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["416"],"URL":"https:\/\/doi.org\/10.1007\/s10009-016-0416-3","relation":{},"ISSN":["1433-2779","1433-2787"],"issn-type":[{"value":"1433-2779","type":"print"},{"value":"1433-2787","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,9]]}}}