{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T23:27:49Z","timestamp":1759879669810,"version":"3.37.3"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,7,11]],"date-time":"2016-07-11T00:00:00Z","timestamp":1468195200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2016,7,11]],"date-time":"2016-07-11T00:00:00Z","timestamp":1468195200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Inf Syst Front"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s10796-016-9671-9","type":"journal-article","created":{"date-parts":[[2016,7,11]],"date-time":"2016-07-11T07:19:55Z","timestamp":1468221595000},"page":"927-952","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Two CEGAR-based approaches for the safety verification of PLC-controlled plants"],"prefix":"10.1007","volume":"18","author":[{"given":"Johanna","family":"Nellen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Driessen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Neuh\u00e4u\u00dfer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erika","family":"\u00c1brah\u00e1m","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benedikt","family":"Wolters","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,11]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"\u00c1brah\u00e1m, E., Becker, B., Klaedtke, F., & Steffen, M. (2005). Optimizing bounded model checking for linear hybrid systems. In Proc. of the 6th Int. Conf. on Verification, Model Checking, and Abstract Interpretation (VMCAI\u201905), LNCS, vol. 3385. doi:http:\/\/dx.doi.org\/10.1007\/978-3-540-30579-8_26 (pp. 396\u2013412): Springer.","key":"9671_CR1","DOI":"10.1007\/978-3-540-30579-8_26"},{"issue":"4","key":"9671_CR2","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1109\/TRO.2014.2312453","volume":"s30","author":"M Althoff","year":"2014","unstructured":"Althoff, M., & Dolan, J. M. (2014). Online verification of automated road vehicles using reachability analysis. IEEE Transaction on Robotics, s30(4), 903\u2013918.","journal-title":"IEEE Transaction on Robotics"},{"doi-asserted-by":"crossref","unstructured":"Althoff, M., Stursberg, O., & Buss, M. (2008). Reachability analysis of nonlinear systems with uncertain parameters using conservative linearization. In Proc. of the 47th IEEE conf. on decision and control (CDC\u201908) (pp. 4042\u20134048): IEEE Computer Society Press.","key":"9671_CR3","DOI":"10.1109\/CDC.2008.4738704"},{"key":"9671_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(94)00202-T","volume":"s138","author":"R Alur","year":"1995","unstructured":"Alur, R., Courcoubetis, C., Halbwachs, N., Henzinger, T. A., Ho, P. H., Nicollin, X., Olivero, A., Sifakis, J., & Yovine, S. (1995). The algorithmic analysis of hybrid systems. Theoretical Computer Science, s138, 3\u201334.","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Alur, R., Dang, T., & Ivancic, F. (2002). Reachability analysis of hybrid systems via predicate abstraction. In Proc.of the 5th int.workshop on hybrid systems: Computation and control (HSCC\u201902), LNCS vol. 2289 (pp. 35\u201348): Springer.","key":"9671_CR5","DOI":"10.1007\/3-540-45873-5_6"},{"doi-asserted-by":"publisher","unstructured":"Alur, R., Dang, T., & Ivancic, F. (2003). Counter-example guided predicate abstraction of hybrid systems. In Proc. of TACAS\u201913, LNCS, vol. 2619. doi:10.1007\/3-540-36577-X_15 (pp. 208\u2013223): Springer.","key":"9671_CR6","DOI":"10.1007\/3-540-36577-X_15"},{"issue":"7","key":"9671_CR7","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s00236-006-0035-7","volume":"s43","author":"E Asarin","year":"2007","unstructured":"Asarin, E., Dang, T., & Girard, A. (2007). Hybridization methods for the analysis of nonlinear systems. Acta Informatica, s43(7), 451\u2013476.","journal-title":"Acta Informatica"},{"unstructured":"Asarin, E., Dang, T., & Maler, O. (2002). The d\/dt tool for verification of hybrid systems. In Proc. of CAV\u201902, LNCS, (Vol. 2404 pp. 746\u2013770): Springer.","key":"9671_CR8"},{"unstructured":"Balluchi, A., Casagrande, A., Collins, P., Ferrari, A., Villa, T., & Sangiovanni-Vincentelli, A. L. (2006). Ariadne: a framework for reachability analysis of hybrid automata. In Proc. of MTNS\u201906.","key":"9671_CR9"},{"unstructured":"Baresi, L., Carmeli, S., Monti, A., & Pezz\u00e8, M. (1998). PLC Programming languages: a formal approach. In Proc.of automation \u201998. ANIPLA.","key":"9671_CR10"},{"unstructured":"Bauer, N. (2004). Formale analyse von sequential function charts. Ph.D. thesis, Universit\u00e4t Dortmund.","key":"9671_CR11"},{"doi-asserted-by":"crossref","unstructured":"Bauer, N., Huuck, R., Lukoschus, B., & Engell, S. (2004). A unifying semantics for sequential function charts. In In the final report of the softspez DFG priority program, LNCS, (Vol. 3147 pp. 400\u2013418): Springer.","key":"9671_CR12","DOI":"10.1007\/978-3-540-27863-4_22"},{"unstructured":"Biere, A. (2009). Bounded model checking. In biere, A., Heule, M., van Maaren, H., & Walsh, T. (Eds.) Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, (Vol. 185 pp. 457\u2013481): IOS Press.","key":"9671_CR13"},{"doi-asserted-by":"crossref","unstructured":"Biere, A., Cimatti, A., Clarke, E. M., & Zhu, Y. (1999). Symbolic model checking without BDDs. In Tools and algorithms for construction and analysis of systems (TACAS), LNCS, (Vol. 1579 pp. 193\u2013207): Springer.","key":"9671_CR14","DOI":"10.1007\/3-540-49059-0_14"},{"doi-asserted-by":"crossref","unstructured":"Bogomolov, S., Donz\u00e9, A., Frehse, G., Grosu, R., Johnson, T. T., Ladan, H., Podelski, A., & Wehrle, M. (2013). Abstraction-based guided search for hybrid systems. In Proc.of SPIN\u201913, LNCS, (Vol. 7976 pp. 117\u2013134): Springer.","key":"9671_CR15","DOI":"10.1007\/978-3-642-39176-7_8"},{"doi-asserted-by":"crossref","unstructured":"Bogomolov, S., Frehse, G., Greitschus, M., Grosu, R., Pasareanu, C., Podelski, A., & Strump, T. (2014). Assume-guarantee abstraction refinement meets hybrid systems. In Proc.of HVC\u201914, LNCS, (Vol. 8855 pp. 116\u2013131): Springer.","key":"9671_CR16","DOI":"10.1007\/978-3-319-13338-6_10"},{"unstructured":"Bouissou, O., Chapoutot, A., & Mimram, S. (2013). Computing flowpipe of nonlinear hybrid systems with numerical methods. coRR sabs\/1306.2305. arXiv;1306.2305.","key":"9671_CR17"},{"doi-asserted-by":"crossref","unstructured":"Chen, X., \u00c1brah\u00e1m, E., & Sankaranarayanan, S. (2013). Flow*: an analyzer for non-linear hybrid systems. In Proc. of CAV\u201913, LNCS, (Vol. 8044 pp. 258\u2013263): Springer.","key":"9671_CR18","DOI":"10.1007\/978-3-642-39799-8_18"},{"doi-asserted-by":"publisher","unstructured":"Clarke, E., Fehnker, A., Han, Z., Krogh, B., Ouaknine, J., Stursberg, O., & Theobald, M. (2003a). Abstraction and counterexample-guided refinement in model checking of hybrid systems. International Journal of Foundations of Computer Science, s14(04), 583\u2013604. doi:10.1142\/S012905410300190X.","key":"9671_CR19","DOI":"10.1142\/S012905410300190X"},{"doi-asserted-by":"publisher","unstructured":"Clarke, E., Fehnker, A., Han, Z., Krogh, B., Stursberg, O., & Theobald, M. (2003b). Verification of hybrid systems based on counterexample-guided abstraction refinement. In Proc. of TACAS\u201903, LNCS. doi:10.1007\/3-540-36577-X_14, (Vol. 2619 pp. 192\u2013207): Springer.","key":"9671_CR20","DOI":"10.1007\/3-540-36577-X_14"},{"doi-asserted-by":"publisher","unstructured":"Clarke, E., Grumberg, O., Jha, S., Lu, Y., & Veith, H. (2000). Counterexample-guided abstraction refinement. In Proc. of CAV\u201900, LNCS. doi:10.1007\/10722167_15, (Vol. 1855 pp. 154\u2013169): Springer.","key":"9671_CR21","DOI":"10.1007\/10722167_15"},{"doi-asserted-by":"crossref","unstructured":"Clarke, E., & Kroening, D. (2003). Hardware verification using ANSI-c programs as a reference. In Proc. ASP-DAC\u201903 (pp. 308\u2013311).","key":"9671_CR22","DOI":"10.1145\/1119772.1119831"},{"issue":"1","key":"9671_CR23","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1011276507260","volume":"s19","author":"EM Clarke","year":"2001","unstructured":"Clarke, E.M., Biere, A., Raimi, R., & Zhu, Y. (2001). Bounded model checking using satisfiability solving. Formal Methods in System Design, s19(1), 7\u201334. doi:10.1023\/A:1011276507260.","journal-title":"Formal Methods in System Design"},{"doi-asserted-by":"publisher","unstructured":"Dierks, H., Kupferschmid, S., & Larsen, K. (2007). Automatic abstraction refinement for timed automata. In Proc. of FORMATS\u201907, LNCS. doi:10.1007\/978-3-540-75454-1_10, (Vol. 4763 pp. 114\u2013129): Springer.","key":"9671_CR24","DOI":"10.1007\/978-3-540-75454-1_10"},{"doi-asserted-by":"crossref","unstructured":"Duggirala, P., Mitra, S., Viswanathan, M., & Potok, M. (2015). C2e2: A verification tool for Stateflow models. In Proc.of the 21th int.conf.on tools and algorithms for the construction and analysis of systems (TACAS\u201915), LNCS, (Vol. 9035 pp. 68\u201382): Springer.","key":"9671_CR25","DOI":"10.1007\/978-3-662-46681-0_5"},{"unstructured":"Eggers, A. (2014). Direct handling of ordinary differential equations in constraint-solving-based analysis of hybrid systems. Ph.D. thesis, Universit\u00e4t Oldenburg, Germany.","key":"9671_CR26"},{"issue":"2","key":"9671_CR27","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1142\/S021819400500204X","volume":"s15","author":"S Engell","year":"2005","unstructured":"Engell, S., Lohmann, S., & Stursberg, O. (2005). Verification of embedded supervisory controllers considering hybrid plant dynamics. International Journal of Software Engineering and Knowledge Engineering, s15(2), 307\u2013312.","journal-title":"International Journal of Software Engineering and Knowledge Engineering"},{"doi-asserted-by":"publisher","unstructured":"Fehnker, A., Clarke, E., Jha, S., & Krogh, B. (2005). Refining abstractions of hybrid systems using counterexample fragments. In Proc. of HSCC\u201905, LNCS. doi:10.1007\/978-3-540-31954-2_16, (Vol. 3414 pp. 242\u2013257): Springer.","key":"9671_CR28","DOI":"10.1007\/978-3-540-31954-2_16"},{"issue":"3","key":"9671_CR29","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10703-006-0031-0","volume":"s30","author":"M Fr\u00e4nzle","year":"2006","unstructured":"Fr\u00e4nzle, M., & Herde, C. (2006). HySAT: An efficient proof engine for bounded model checking of hybrid systems. Formal Methods in System Design, s30(3), 179\u2013198. doi:10.1007\/s10703-006-0031-0.","journal-title":"Formal Methods in System Design"},{"key":"9671_CR30","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10009-007-0062-x","volume":"s10","author":"G Frehse","year":"2008","unstructured":"Frehse, G. (2008). PHAVEr: Algorithmic verification of hybrid systems past HyTech. International Journal on Software Tools for Technology Transfer, s10, 263\u2013279.","journal-title":"International Journal on Software Tools for Technology Transfer"},{"doi-asserted-by":"crossref","unstructured":"Frehse, G., Guernic, C. L., Donz\u00e9, A., Cotton, S., Ray, R., Lebeltel, O., Ripado, R., Girard, A., Dang, T., & Maler, O. (2011). Spaceex: Scalable verification of hybrid systems. In Proc.of CAV\u201911, LNCS, (Vol. 6806 pp. 379\u2013395): Springer.","key":"9671_CR31","DOI":"10.1007\/978-3-642-22110-1_30"},{"doi-asserted-by":"crossref","unstructured":"Frey, G., & Litz, L. (2000). Formal methods in PLC programming. In Proc. of SMC\u201900, (Vol. 4 pp. 2431\u20132436).","key":"9671_CR32","DOI":"10.1109\/ICSMC.2000.884356"},{"doi-asserted-by":"crossref","unstructured":"Giorgetti, N., Pappas, G., & Bemporad, A. (2005). Bounded model checking of hybrid dynamical systems. In Proc. of CDC\u201905 (pp. 672\u2013677).","key":"9671_CR33","DOI":"10.1109\/CDC.2005.1582233"},{"issue":"5","key":"9671_CR34","first-page":"782","volume":"s52","author":"A Girard","year":"2007","unstructured":"Girard, A., & Pappas, G. J. (2007). Approximation metrics for discrete and continuous systems. TAC\u201907\u2019, s52(5), 782\u2013798.","journal-title":"TAC\u201907\u2019"},{"unstructured":"Hagemann, W., M\u00f6hlmann, E., & Rakow, A. (2014). Verifying a PI controller using SoapBox and Stabhyli: Experiences on establishing properties for a steering controller. In 1St int. workshops on applied verification for continuous and hybrid systems (ARCH\u201914), EPic series in computer science, vol. 34. Easychair.","key":"9671_CR35"},{"unstructured":"Hassapis, G., Kotini, I., & Doulgeri, Z. (1998). Validation of a SFC software specification by using hybrid automata. In Proc. of INCOM\u201998 (pp. 65\u201370): Pergamon.","key":"9671_CR36"},{"doi-asserted-by":"crossref","unstructured":"Henzinger, T. A. (1996). The theory of hybrid automata. In Proc. of LICS\u201996) (pp. 278\u2013292).","key":"9671_CR37","DOI":"10.1109\/LICS.1996.561342"},{"issue":"1","key":"9671_CR38","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1006\/jcss.1998.1581","volume":"s57","author":"TA Henzinger","year":"1998","unstructured":"Henzinger, T. A., Kopke, P. W., Puri, A., & Varaiya, P. (1998). What\u2019s decidable about hybrid automata? Journal of Computer and System Sciences, s57(1), 94\u2013124. doi:10.1006\/jcss.1998.1581.","journal-title":"Journal of Computer and System Sciences"},{"unstructured":"HyCreate (2013). A tool for overapproximating reachability of hybrid automata . http:\/\/stanleybak.com\/projects\/hycreate\/hycreate.html.","key":"9671_CR39"},{"unstructured":"HyReach (2015). HyReach home page . https:\/\/embedded.rwth-aachen.de\/doku.php?id=en:tools:hyreach.","key":"9671_CR40"},{"unstructured":"Immler, F. (2015). Tool presentation: Isabelle\/hol for reachability analysis of continuous systems. In frehse, G., & Althoff, M. (Eds.) ARCH14-15. 1st and 2nd International Workshop on Applied veRification for Continuous and Hybrid Systems, EPiC Series in Computer Science, vol. 34, pp. 180\u2013187. EasyChair.","key":"9671_CR41"},{"unstructured":"Int. Electrotechnical Commission (2003). Programmable controllers, Part 3: Programming Languages, 61131\u20133.","key":"9671_CR42"},{"doi-asserted-by":"crossref","unstructured":"Jha, S. K., Krogh, B. H., Weimer, J. E., & Clarke, E. M. (2007). Reachability for linear hybrid automata using iterative relaxation abstraction. In Proc. of HSCC\u201907, LNCS (pp. 287\u2013300): Springer.","key":"9671_CR43","DOI":"10.1007\/978-3-540-71493-4_24"},{"doi-asserted-by":"crossref","unstructured":"Kong, S., Gao, S., Chen, W., & Clarke, E.M. (2015). dReach: \u03b4-reachability analysis for hybrid systems. In Proc.of TACAS\u201915, LNCS, (Vol. 9035 pp. 200\u2013205): Springer.","key":"9671_CR44","DOI":"10.1007\/978-3-662-46681-0_15"},{"doi-asserted-by":"crossref","unstructured":"Kurzhanskiy, A., & Varaiya, P. (2006). Ellipsoidal toolbox. Tech. rep., EECS UC Berkeley.","key":"9671_CR45","DOI":"10.1109\/CDC.2006.377036"},{"unstructured":"Lukoschus, B. (2005). Compositional verification of industrial control systems - Methods and case studies. Ph.D. thesis, Christian-Albrechts-Universit\u00e4t zu Kiel.","key":"9671_CR46"},{"doi-asserted-by":"publisher","unstructured":"Minopoli, S., & Frehse, G. (2014). Non-convex invariants and urgency conditions on linear hybrid automata. In Legay, A., & Bozga, M. (Eds.) Formal Modeling and Analysis of Timed Systems, LNCS. doi:10.1007\/978-3-319-10512-3_13, (Vol. 8711 pp. 176\u2013190): Springer.","key":"9671_CR47","DOI":"10.1007\/978-3-319-10512-3_13"},{"doi-asserted-by":"crossref","unstructured":"Mitchell, I., & Tomlin, C. (2000). Level set methods for computation in hybrid systems. In Proc. of HSCC\u201900, LNCS, (Vol. 1790 pp. 310\u2013323): Springer.","key":"9671_CR48","DOI":"10.1007\/3-540-46430-1_27"},{"unstructured":"Nellen, J., & \u00c1brah\u00e1m, E. (2012). Hybrid sequential function charts. In Proc. of MBMV\u201912, pp. 109\u2013120. Verlag dr. Kovac.","key":"9671_CR49"},{"doi-asserted-by":"crossref","unstructured":"Nellen, J., & \u00c1brah\u00e1m, E. (2014). A CEGAR approach for the reachability analysis of PLC-controlled chemical plants. In Proc.of FMi\u201914.","key":"9671_CR50","DOI":"10.1109\/IRI.2014.7051930"},{"doi-asserted-by":"crossref","unstructured":"Nellen, J., \u00c1brah\u00e1m, E., Chen, X., & Collins, P. (2014). Counterexample generation for hybrid automata. In Proc. of FTSCS\u201913, CCIS, (Vol. 419 pp. 88\u2013106): Springer.","key":"9671_CR51","DOI":"10.1007\/978-3-319-05416-2_7"},{"doi-asserted-by":"crossref","unstructured":"Nellen, J., \u00c1brah\u00e1m, E., & Wolters, B. (2015). A CEGAR tool for the reachability analysis of PLC-controlled plants using hybrid automata. In Bouabana-tebibel, T., & Rubin, S.H. (Eds.) forMalisms for reuse and systems integration, advances in intelligent systems and computing, (Vol. 346 pp. 55\u201378): Springer.","key":"9671_CR52","DOI":"10.1007\/978-3-319-16577-6_3"},{"unstructured":"SPACEEx with CEGAR (2014). http:\/\/ths.rwth-aachen.de\/research\/tools\/spaceex-with-cegar\/.","key":"9671_CR53"},{"doi-asserted-by":"publisher","unstructured":"Platzer, A., & Quesel, J.D. (2008). Keymaera: A hybrid theorem prover for hybrid systems. In Proc. of IJCAR\u201908, LNCS. doi:10.1007\/978-3-540-71070-7_15, (Vol. 5195 pp. 171\u2013178): Springer.","key":"9671_CR54","DOI":"10.1007\/978-3-540-71070-7_15"},{"doi-asserted-by":"publisher","unstructured":"Prabhakar, P., Duggirala, P., Mitra, S., & Viswanathan, M. (2013). Hybrid automata-based CEGAR for rectangular hybrid systems. In Proc. of VMCAI\u201913, LNCS. doi:10.1007\/978-3-642-35873-9_6, (Vol. 7737 pp. 48\u201367): Springer.","key":"9671_CR55","DOI":"10.1007\/978-3-642-35873-9_6"},{"doi-asserted-by":"crossref","unstructured":"Ratschan, S., & She, Z. (2005). Safety verification of hybrid systems by constraint propagation based abstraction refinement. In Proc. of HSCC\u201905, LNCS, (Vol. 3414 pp. 573\u2013589): Springer.","key":"9671_CR56","DOI":"10.1007\/978-3-540-31954-2_37"},{"doi-asserted-by":"crossref","unstructured":"Roohi, N., Prabhakar, P., & Viswanathan, M. (2016). Hybridization based CEGAR for hybrid automata with affine dynamics. In Proc. of TACAS\u201916, LNCS. TO APPEAR, Vol. 9636: Springer.","key":"9671_CR57","DOI":"10.1007\/978-3-662-49674-9_48"},{"unstructured":"Scheibler, K., Kupferschmid, S., & Becker, B. (2013). Recent improvements in the SMT solver iSAT. In Proc. MBMV, 231-241. Institut f\u00fcr Angewandte Mikroelektronik und Datentechnik, Fakult\u00e4t f\u00fcr Informatik und Elektrotechnik, Universit\u00e4t Rostock.","key":"9671_CR58"},{"doi-asserted-by":"publisher","unstructured":"Segelken, M. (2007). Abstraction and counterexample-guided construction of \u03c9-automata for model checking of step-discrete linear hybrid models. In Proc. of CAV\u201907, LNCS. doi:10.1007\/978-3-540-73368-3_46, (Vol. 4590 pp. 433\u2013448): Springer.","key":"9671_CR59","DOI":"10.1007\/978-3-540-73368-3_46"},{"doi-asserted-by":"publisher","unstructured":"Strichman, O. (2004). Accelerating bounded model checking of safety properties. Formal Methods in System Design, s24(1), 5\u201324. doi:10.1023\/B:FORM.0000004785.67232.f8.","key":"9671_CR60","DOI":"10.1023\/B:FORM.0000004785.67232.f8"},{"doi-asserted-by":"crossref","unstructured":"Testylier, R., & Dang, T. (2013). NLTOOLBOX: A library for reachability computation of nonlinear dynamical systems. In Proc. of the 11th int.symposium on automated technology for verification and analysis (ATVA\u201913), LNCS, (Vol. 8172 pp. 469\u2013 473): Springer.","key":"9671_CR61","DOI":"10.1007\/978-3-319-02444-8_37"}],"container-title":["Information Systems Frontiers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10796-016-9671-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10796-016-9671-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10796-016-9671-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10796-016-9671-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,23]],"date-time":"2023-06-23T16:59:43Z","timestamp":1687539583000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10796-016-9671-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,11]]},"references-count":61,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["9671"],"URL":"https:\/\/doi.org\/10.1007\/s10796-016-9671-9","relation":{},"ISSN":["1387-3326","1572-9419"],"issn-type":[{"type":"print","value":"1387-3326"},{"type":"electronic","value":"1572-9419"}],"subject":[],"published":{"date-parts":[[2016,7,11]]},"assertion":[{"value":"11 July 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}