{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:33:55Z","timestamp":1743125635165,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030912642"},{"type":"electronic","value":"9783030912659"}],"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-91265-9_14","type":"book-chapter","created":{"date-parts":[[2021,11,19]],"date-time":"2021-11-19T11:26:47Z","timestamp":1637321207000},"page":"261-278","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["$$\\mathbf{OURS} $$: Over- and Under-Approximating Reachable Sets for Analytic Time-Invariant Differential Equations"],"prefix":"10.1007","author":[{"given":"Ruiqi","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meilun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhikun","family":"She","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,18]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10703-008-0058-5","volume":"34","author":"E Plaku","year":"2009","unstructured":"Plaku, E., Kavraki, L., Vardi, M.: Hybrid systems: from verification to falsification by combining motion planning and discrete search. Formal Methods Syst. Design 34, 157\u2013182 (2009)","journal-title":"Formal Methods Syst. Design"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Goubault, E., Putot, S.: Inner and outer reachability for the verification of control systems. In: HSCC 2019, pp. 11\u201322 (2019)","DOI":"10.1145\/3302504.3311794"},{"issue":"3","key":"14_CR3","doi-asserted-by":"publisher","first-page":"1414","DOI":"10.1109\/TAC.2020.2994019","volume":"66","author":"M Li","year":"2021","unstructured":"Li, M., She, Z.: Over- and under-approximations of reachable sets with series representations of evolution functions. IEEE Trans. Automat. Contr. 66(3), 1414\u20131421 (2021)","journal-title":"IEEE Trans. Automat. Contr."},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-030-00151-3_15","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"M Li","year":"2018","unstructured":"Li, M., Mosaad, P.N., Fr\u00e4nzle, M., She, Z., Xue, B.: Safe over- and under-approximation of reachable sets for autonomous dynamical systems. In: Jansen, D.N., Prabhakar, P. (eds.) FORMATS 2018. LNCS, vol. 11022, pp. 252\u2013270. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00151-3_15"},{"issue":"1","key":"14_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1210268.1210276","volume":"6","author":"S Ratschan","year":"2007","unstructured":"Ratschan, S., She, Z.: Safety verification of hybrid systems by constraint propagation-based abstraction refinement. ACM Trans. Embed. Comput. Syst. 6(1), 1\u201323 (2007). Article No. 8","journal-title":"ACM Trans. Embed. Comput. Syst."},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Kurzhanskiy, A.A., Varaiya, P.: Ellipsoidal toolbox (ET). In: Proceedings of the 45th IEEE Conference on Decision and Control, pp. 1498\u20131503 (2006)","DOI":"10.1109\/CDC.2006.377036"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Girard, A., Le Guernic, C., Maler, O.: Efficient computation of reachable sets of linear time-invariant systems with inputs. In: HSCC 2006, pp. 257\u2013271. ACM (2006)","DOI":"10.1007\/11730637_21"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Dang, T., Maler, O., Testylier, R.: Accurate hybridization of nonlinear systems. In: HSCC 2010, pp. 11\u201320. ACM (2010)","DOI":"10.1145\/1755952.1755956"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Althoff, M.: Reachability analysis of nonlinear systems using conservative polynomialization and non-convex sets. In: HSCC 2013, pp. 173\u2013182. ACM (2013)","DOI":"10.1145\/2461328.2461358"},{"issue":"4","key":"14_CR10","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1109\/LCSYS.2020.2997261","volume":"4","author":"E Goubault","year":"2020","unstructured":"Goubault, E., Putot, S.: Robust under-approximations and application to reachability of non-linear control systems with disturbances. IEEE Control Syst. Lett. 4(4), 928\u2013933 (2020)","journal-title":"IEEE Control Syst. Lett."},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10009-007-0062-x","volume":"10","author":"G Frehse","year":"2008","unstructured":"Frehse, G.: PHAVer: algorithmic verification of hybrid systems past HyTech. Int. J. Softw. Tools Technol. Transf. 10, 263\u2013279 (2008)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-642-22110-1_30","volume-title":"Computer Aided Verification","author":"G Frehse","year":"2011","unstructured":"Frehse, G., et al.: SpaceEx: scalable verification of hybrid systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 379\u2013395. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_30"},{"issue":"10","key":"14_CR13","doi-asserted-by":"publisher","first-page":"2508","DOI":"10.1109\/TAC.2013.2263916","volume":"58","author":"TC Wang","year":"2013","unstructured":"Wang, T.C., Lall, S., West, M.: Polynomial level-set method for polynomial system reachable set estimation. IEEE Trans. Automat. Contr. 58(10), 2508\u20132521 (2013)","journal-title":"IEEE Trans. Automat. Contr."},{"issue":"7","key":"14_CR14","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1109\/TAC.2005.851439","volume":"50","author":"IM Mitchell","year":"2005","unstructured":"Mitchell, I.M., Bayen, A.M., Tomlin, C.J.: A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games. IEEE Trans. Automat. Contr. 50(7), 947\u2013957 (2005)","journal-title":"IEEE Trans. Automat. Contr."},{"issue":"2","key":"14_CR15","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/s10915-007-9174-4","volume":"35","author":"IM Mitchell","year":"2008","unstructured":"Mitchell, I.M.: The flexible, extensible and efficient toolbox of level set methods. J. Sci. Comput. 35(2), 300\u2013329 (2008)","journal-title":"J. Sci. Comput."},{"key":"14_CR16","unstructured":"Althoff, M.: An introduction to CORA 2015. In: Proceedings of the Workshop on Applied Verification for Continuous and Hybrid Systems, pp. 120\u2013151 (2015)"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Kochdumper, N., Althoff, M.: Computing non-convex inner-approximations of reachable sets for nonlinear continuous systems. In 59th IEEE Conference on Decision and Control (CDC), pp. 2130\u20132137 (2020)","DOI":"10.1109\/CDC42340.2020.9304022"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Kaynama, S., Oishi, M., Mitchell, I.M., Dumont, G.A.: The continual reachability set and its computation using maximal reachability techniques. In: 50th IEEE Conference on Decision and Control (CDC), pp. 6110\u20136115 (2011)","DOI":"10.1109\/CDC.2011.6161424"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Kaynama, S., Maidens, J., Oishi, M., Mitchell, I.M., Dumont, G.A.: Computing the viability kernel using maximal reachable sets. In: HSCC 2012, pp. 55\u201364. ACM (2012)","DOI":"10.1145\/2185632.2185644"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-642-39799-8_18","volume-title":"Computer Aided Verification","author":"X Chen","year":"2013","unstructured":"Chen, X., \u00c1brah\u00e1m, E., Sankaranarayanan, S.: Flow*: an analyzer for non-linear hybrid systems. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 258\u2013263. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_18"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Chen, X., \u00c1brah\u00e1m, E., Sankaranarayanan, S.: Taylor model flowpipe construction for non-linear hybrid systems. In: RTSS 2012, pp. 183\u2013192. IEEE Computer Society (2012)","DOI":"10.1109\/RTSS.2012.70"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Xue, B., Fr\u00e4nzle, M., Zhan, N.: Under-approximating reach sets for polynomial continuous systems. In: HSCC 2018, pp. 51\u201360 (2018)","DOI":"10.1145\/3178126.3178133"},{"issue":"7","key":"14_CR23","doi-asserted-by":"publisher","first-page":"4377","DOI":"10.1137\/090749955","volume":"48","author":"S Ratschan","year":"2010","unstructured":"Ratschan, S., She, Z.: Providing a basin of attraction to a target region of polynomial systems by computation of Lyapunov-like functions. SIAM J. Control Optim. 48(7), 4377\u20134394 (2010)","journal-title":"SIAM J. Control Optim."},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-642-00602-9_16","volume-title":"Hybrid Systems: Computation and Control","author":"AA Julius","year":"2009","unstructured":"Julius, A.A., Pappas, G.J.: Trajectory based verification using local finite-time invariance. In: Majumdar, R., Tabuada, P. (eds.) HSCC 2009. LNCS, vol. 5469, pp. 223\u2013236. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00602-9_16"},{"key":"14_CR25","series-title":"Mathematical Engineering","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-642-15956-5_1","volume-title":"Modeling, Design, and Simulation of Systems with Uncertainties","author":"NS Nedialkov","year":"2011","unstructured":"Nedialkov, N.S.: Implementing a rigorous ode solver through literate programming. In: Rauh, A., Auer, E. (eds.) Modeling, Design, and Simulation of Systems with Uncertainties. Mathematical Engineering, vol. 3, pp. 3\u201319. Springer, Berlin (2011). https:\/\/doi.org\/10.1007\/978-3-642-15956-5_1"},{"issue":"1","key":"14_CR26","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1145\/1132973.1132980","volume":"32","author":"L Granvilliers","year":"2006","unstructured":"Granvilliers, L., Benhamou, F.: RealPaver: an interval solver using constraint satisfaction techniques. ACM Trans. Math. Softw. 32(1), 138\u2013156 (2006)","journal-title":"ACM Trans. Math. Softw."},{"key":"14_CR27","unstructured":"http:\/\/www.cs.ubc.ca\/~mitchell\/ToolboxLS"},{"issue":"11","key":"14_CR28","doi-asserted-by":"publisher","first-page":"3675","DOI":"10.1109\/TAC.2018.2797194","volume":"63","author":"M Chen","year":"2018","unstructured":"Chen, M., Herbert, S.L., Vashishtha, M.S., Bansal, S., Tomlin, C.J.: Decomposition of reachable sets and tubes for a class of nonlinear systems. IEEE Trans. Automat. Contr. 63(11), 3675\u20133688 (2018)","journal-title":"IEEE Trans. Automat. Contr."}],"container-title":["Lecture Notes in Computer Science","Dependable Software Engineering. Theories, Tools, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91265-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,19]],"date-time":"2021-11-19T11:30:10Z","timestamp":1637321410000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91265-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030912642","9783030912659"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91265-9_14","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":"18 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SETTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Dependable Software Engineering: Theories, Tools, and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"25 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"setta2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lcs.ios.ac.cn\/setta2021\/","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":"39","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":"16","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":"41% - 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.05","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.53","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)"}}]}}