{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:02:59Z","timestamp":1742918579601,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030850364"},{"type":"electronic","value":"9783030850371"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85037-1_4","type":"book-chapter","created":{"date-parts":[[2021,8,15]],"date-time":"2021-08-15T23:03:01Z","timestamp":1629068581000},"page":"50-66","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Automatic Dynamic Parallelotope Bundles for Reachability Analysis of Nonlinear Systems"],"prefix":"10.1007","author":[{"given":"Edward","family":"Kim","sequence":"first","affiliation":[]},{"given":"Stanley","family":"Bak","sequence":"additional","affiliation":[]},{"given":"Parasara Sridhar","family":"Duggirala","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,16]]},"reference":[{"key":"4_CR1","unstructured":"Kodiak, a C++ library for rigorous branch and bound computation. https:\/\/github.com\/nasa\/Kodiak. Accessed July 2020"},{"issue":"2","key":"4_CR2","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.nahs.2009.03.009","volume":"4","author":"M Althoff","year":"2010","unstructured":"Althoff, M., Stursberg, O., Buss, M.: Computing reachable sets of hybrid systems using a combination of zonotopes and polytopes. Nonlinear Anal. hybrid Syst. 4(2), 233\u2013249 (2010)","journal-title":"Nonlinear Anal. hybrid Syst."},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Ansumali, S., Kaushal, S., Kumar, A., Prakash, M.K., Vidyasagar, M.: Modelling a pandemic with asymptomatic patients, impact of lockdown and herd immunity, with applications to SARS-CoV-2. Ann. Rev. Control (2020)","DOI":"10.1016\/j.arcontrol.2020.10.003"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Bak, S., Bogomolov, S., Duggirala, P.S., Gerlach, A.R., Potomkin, K.: Reachability of black-box nonlinear systems after Koopman operator linearization (2021)","DOI":"10.1016\/j.ifacol.2021.08.507"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-642-27549-4_69","volume-title":"Computer Aided Systems Theory \u2013 EUROCAST 2011","author":"X Chen","year":"2012","unstructured":"Chen, X., \u00c1brah\u00e1m, E.: Choice of directions for the approximation of reachable sets for hybrid systems. In: Moreno-D\u00edaz, R., Pichler, F., Quesada-Arencibia, A. (eds.) EUROCAST 2011, Part I. LNCS, vol. 6927, pp. 535\u2013542. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27549-4_69"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-540-27864-1_23","volume-title":"Static Analysis","author":"R Claris\u00f3","year":"2004","unstructured":"Claris\u00f3, R., Cortadella, J.: The octahedron abstract domain. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol. 3148, pp. 312\u2013327. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27864-1_23"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-319-27656-4_4","volume-title":"Hybrid Systems Biology","author":"T Dang","year":"2015","unstructured":"Dang, T., Dreossi, T., Piazza, C.: Parameter synthesis using parallelotopic enclosure and applications to epidemic models. In: Maler, O., Hal\u00e1sz, \u00c1., Dang, T., Piazza, C. (eds.) HSB 2014. LNCS, vol. 7699, pp. 67\u201382. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27656-4_4"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-642-25318-8_6","volume-title":"Programming Languages and Systems","author":"T Dang","year":"2011","unstructured":"Dang, T., Gawlitza, T.M.: Template-based unbounded time verification of affine hybrid automata. In: Yang, H. (ed.) APLAS 2011. LNCS, vol. 7078, pp. 34\u201349. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25318-8_6"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-642-02658-4_19","volume-title":"Computer Aided Verification","author":"T Dang","year":"2009","unstructured":"Dang, T., Salinas, D.: Image computation for polynomial dynamical systems using the Bernstein expansion. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 219\u2013232. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02658-4_19"},{"issue":"2","key":"4_CR10","first-page":"128","volume":"17","author":"T Dang","year":"2012","unstructured":"Dang, T., Testylier, R.: Reachability analysis for polynomial dynamical systems using the Bernstein expansion. Reliab. Comput. 17(2), 128\u2013152 (2012)","journal-title":"Reliab. Comput."},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/978-3-030-53288-8_27","volume-title":"Computer Aided Verification","author":"A Devonport","year":"2020","unstructured":"Devonport, A., Khaled, M., Arcak, M., Zamani, M.: PIRK: scalable interval reachability analysis for high-dimensional nonlinear systems. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020. LNCS, vol. 12224, pp. 556\u2013568. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53288-8_27"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Dreossi, T.: Sapo: reachability computation and parameter synthesis of polynomial dynamical systems. In Proceedings of the 20th International Conference on Hybrid Systems: Computation and Control, pp. 29\u201334 (2017)","DOI":"10.1145\/3049797.3049824"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Dreossi, T., Dang, T., Piazza, C.: Parallelotope bundles for polynomial reachability. In: Proceedings of the 19th International Conference on Hybrid Systems: Computation and Control, pages 297\u2013306 (2016)","DOI":"10.1145\/2883817.2883838"},{"issue":"1","key":"4_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10703-016-0266-3","volume":"50","author":"T Dreossi","year":"2017","unstructured":"Dreossi, T., Dang, T., Piazza, C.: Reachability computation for polynomial dynamical systems. Formal Methods Syst. Des. 50(1), 1\u201338 (2017)","journal-title":"Formal Methods Syst. Des."},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-319-41528-4_26","volume-title":"Computer Aided Verification","author":"PS Duggirala","year":"2016","unstructured":"Duggirala, P.S., Viswanathan, M.: Parsimonious, simulation based verification of linear systems. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016, Part I. LNCS, vol. 9779, pp. 477\u2013494. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41528-4_26"},{"issue":"6","key":"4_CR16","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/S0006-3495(61)86902-6","volume":"1","author":"R FitzHugh","year":"1961","unstructured":"FitzHugh, R.: Impulses and physiological states in theoretical models of nerve membrane. Biophys. J. 1(6), 445\u2013466 (1961)","journal-title":"Biophys. J."},{"key":"4_CR17","first-page":"27","volume":"25","author":"J Garloff","year":"2003","unstructured":"Garloff, J.: The Bernstein expansion and its applications. J. Am. Rom. Acad. 25, 27 (2003)","journal-title":"J. Am. Rom. Acad."},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-540-31954-2_19","volume-title":"Hybrid Systems: Computation and Control","author":"A Girard","year":"2005","unstructured":"Girard, A.: Reachability of uncertain linear systems using zonotopes. In: Morari, M., Thiele, L. (eds.) HSCC 2005. LNCS, vol. 3414, pp. 291\u2013305. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31954-2_19"},{"issue":"1","key":"4_CR19","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10703-018-0323-1","volume":"54","author":"J Gronski","year":"2019","unstructured":"Gronski, J., Sassi, M.-A.B., Becker, S., Sankaranarayanan, S.: Template polyhedra and bilinear optimization. Formal Methods Syst. Des. 54(1), 27\u201363 (2019). https:\/\/doi.org\/10.1007\/s10703-018-0323-1","journal-title":"Formal Methods Syst. Des."},{"issue":"5s","key":"4_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3358228","volume":"18","author":"C Huang","year":"2019","unstructured":"Huang, C., Fan, J., Li, W., Chen, X., Zhu, Q.: ReachNN: reachability analysis of neural-network controlled systems. ACM Trans. Embed. Comput. Syst. (TECS) 18(5s), 1\u201322 (2019)","journal-title":"ACM Trans. Embed. Comput. Syst. (TECS)"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"184","DOI":"10.29007\/rs5n","volume":"74","author":"E Kim","year":"2020","unstructured":"Kim, E., Duggirala, P.S.: Kaa: a python implementation of reachable set computation using Bernstein polynomials. EPiC Ser. Comput. 74, 184\u2013196 (2020)","journal-title":"EPiC Ser. Comput."},{"issue":"2","key":"4_CR22","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10817-012-9256-3","volume":"51","author":"C Mu\u00f1oz","year":"2013","unstructured":"Mu\u00f1oz, C., Narkawicz, A.: Formalization of Bernstein polynomials and applications to global optimization. J. Autom. Reason. 51(2), 151\u2013196 (2013)","journal-title":"J. Autom. Reason."},{"issue":"4","key":"4_CR23","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/s11633-007-0342-7","volume":"4","author":"PS Nataraj","year":"2007","unstructured":"Nataraj, P.S., Arounassalame, M.: A new subdivision algorithm for the Bernstein polynomial approach to global optimization. Int. J. Autom. Comput. 4(4), 342\u2013352 (2007). https:\/\/doi.org\/10.1007\/s11633-007-0342-7","journal-title":"Int. J. Autom. Comput."},{"issue":"4","key":"4_CR24","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1023\/A:1021296315884","volume":"24","author":"P Nataray","year":"2002","unstructured":"Nataray, P., Kotecha, K.: An algorithm for global optimization using the Taylor-Bernstein form as inclusion function. J. Glob. Optim. 24(4), 417\u2013436 (2002). https:\/\/doi.org\/10.1023\/A:1021296315884","journal-title":"J. Glob. Optim."},{"key":"4_CR25","unstructured":"National Supermodel Committee. Indian Supermodel for COVID-19 Pandemic"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-540-78800-3_14","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Sankaranarayanan","year":"2008","unstructured":"Sankaranarayanan, S., Dang, T., Ivan\u010di\u0107, F.: Symbolic model checking of hybrid systems using template polyhedra. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 188\u2013202. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_14"},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-642-33386-6_12","volume-title":"Automated Technology for Verification and Analysis","author":"MA Ben Sassi","year":"2012","unstructured":"Ben Sassi, M.A., Testylier, R., Dang, T., Girard, A.: Reachability analysis of polynomial systems using linear programming relaxations. In: Chakraborty, S., Mukund, M. (eds.) ATVA 2012. LNCS, pp. 137\u2013151. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33386-6_12"},{"key":"4_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-319-52234-0_26","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"Y Seladji","year":"2017","unstructured":"Seladji, Y.: Finding relevant templates via the principal component analysis. In: Bouajjani, A., Monniaux, D. (eds.) VMCAI 2017. LNCS, vol. 10145, pp. 483\u2013499. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-52234-0_26"},{"issue":"2\u20133","key":"4_CR29","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s10898-007-9195-4","volume":"43","author":"AP Smith","year":"2009","unstructured":"Smith, A.P.: Fast construction of constant bound functions for sparse polynomials. J. Glob. Optim. 43(2\u20133), 445\u2013458 (2009). https:\/\/doi.org\/10.1007\/s10898-007-9195-4","journal-title":"J. Glob. Optim."},{"key":"4_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/3-540-36580-X_35","volume-title":"Hybrid Systems: Computation and Control","author":"O Stursberg","year":"2003","unstructured":"Stursberg, O., Krogh, B.H.: Efficient representation and computation of reachable sets for hybrid systems. In: Maler, O., Pnueli, A. (eds.) HSCC 2003. LNCS, vol. 2623, pp. 482\u2013497. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36580-X_35"}],"container-title":["Lecture Notes in Computer Science","Formal Modeling and Analysis of Timed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85037-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T11:50:38Z","timestamp":1673092238000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85037-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030850364","9783030850371"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85037-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"16 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FORMATS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Modeling and Analysis of Timed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"formats2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/qonfest2021.lacl.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}