{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:29:34Z","timestamp":1725542974508},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642113185"},{"type":"electronic","value":"9783642113192"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11319-2_9","type":"book-chapter","created":{"date-parts":[[2010,1,6]],"date-time":"2010-01-06T05:00:05Z","timestamp":1262754005000},"page":"78-94","source":"Crossref","is-referenced-by-count":7,"title":["Path-Oriented Reachability Verification of a Class of Nonlinear Hybrid Automata Using Convex Programming"],"prefix":"10.1007","author":[{"given":"Lei","family":"Bu","sequence":"first","affiliation":[]},{"given":"Jianhua","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Xuandong","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(94)00202-T","volume":"138","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.: The algorithmic analysis of hybrid systems. Theoretical Computer Science\u00a0138, 3\u201334 (1995)","journal-title":"Theoretical Computer Science"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.entcs.2004.12.022","volume":"119","author":"G. Audemard","year":"2005","unstructured":"Audemard, G., Bozzano, M., Cimatti, A., Sebastiani, R.: Verifying Industrial Hybrid Systems with MathSAT. Electronic Notes on Theoretical Computer Science\u00a0119, 17\u201332 (2005)","journal-title":"Electronic Notes on Theoretical Computer Science"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Biere, A., Cimatti, A., Clarke, E.M., Strichman, O., Zhu, Y.: Bounded Model Checking. Advance in Computers\u00a058 (2003)","DOI":"10.1016\/S0065-2458(03)58003-2"},{"key":"9_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S. Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"9_CR5","unstructured":"Silva, B., Richeson, K., Krogh, B., Chutinan, A.: Modeling and verifying hybrid dynamic systems using checkmate. In: 4th International Conference on Automataion of Mixed Processes, pp. 323\u2013328 (2000)"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Bu, L., Li, Y., Wang, L., Li, X.: BACH: Bounded ReachAbility CHecker for Linear Hybrid Automata. In: 8th International Conference on Formal Methods in Computer Aided Design, pp. 65\u201368 (2008)","DOI":"10.1109\/FMCAD.2008.ECP.13"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Chinneck, J., Dravnieks, E.: Locating minimal infeasible constraint sets in linear programs. ORSA Journal on Computing, 157\u2013168 (1991)","DOI":"10.1287\/ijoc.3.2.157"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/10722167_15","volume-title":"Computer Aided Verification","author":"E.M. Clarke","year":"2000","unstructured":"Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 154\u2013169. Springer, Heidelberg (2000)"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Asarin, E., Dang, T., Maler, O.: d\/dt, a Tool for Reachability Analysis of Continuous and Hybrid Systems. In: IFAC Nonlinear Control Systems, pp. 20\u201331 (2001)","DOI":"10.1007\/3-540-46430-1_6"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.entcs.2004.08.061","volume":"133","author":"M. Franzle","year":"2005","unstructured":"Franzle, M., Herde, C.: Efficient Proof Engines for Bounded Model Checking of Hybrid Systems. Electronic Notes on Theoretical Computer Science\u00a0133, 119\u2013137 (2005)","journal-title":"Electronic Notes on Theoretical Computer Science"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Frehse, G.: PHAVer: Algorithmic Verification of Hybrid Systems past HyTech. In: International Conference on Hybrid Systems: Computation and Control, pp. 258\u2013273 (2005)","DOI":"10.1007\/978-3-540-31954-2_17"},{"key":"9_CR12","unstructured":"Grant, M., Boyd, S.: CVX: Matlab software for disciplined convex programming (web page and software) (2009), http:\/\/stanford.edu\/~boyd\/cvx"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Grant, M., Boyd, S., Ye, Y.: Disciplined Convex Programming. In: Global Optimization: From Theory to Implementation, pp. 155\u2013210 (2006)","DOI":"10.1007\/0-387-30528-9_7"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A., Ho, P., Wong-Toi, H.: Algorithmic Analysis of Nonlinear Hybrid Systems. IEEE Transactions on Automatic Control, 540\u2013554 (1998)","DOI":"10.1109\/9.664156"},{"key":"9_CR15","unstructured":"Thomas, A.: The Theory of Hybrid Automata. In: 11th Annual IEEE Symposium on Logic in Computer Science, pp. 278\u2013292 (1996)"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Jha, S., Krogh, B.H., Weimer, J.E., Clarke, E.M.: Reachability for Linear Hybrid Automata Using Iterative Relaxation Abstraction. In: 10th International Conference on Hybrid Systems: Computation and Control, pp. 287\u2013300 (2007)","DOI":"10.1007\/978-3-540-71493-4_24"},{"issue":"3","key":"9_CR17","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.entcs.2006.12.023","volume":"174","author":"X. Li","year":"2007","unstructured":"Li, X., Jha, S., Bu, L.: Towards an Efficient Path-Oriented Tool for Bounded Reachability Analysis of Linear Hybrid Systems using Linear Programming. Electronic Notes on Theoretical Computer Science\u00a0174(3), 57\u201370 (2007)","journal-title":"Electronic Notes on Theoretical Computer Science"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Silva, B.I., Stursberg, O., Krogh, B.H., Engell, S.: An Assessment of the Current Status of Algorithmic Approaches to the Verification of Hybrid Systems. In: 40th Conference on Decision and Control, pp. 2867\u20132874 (2001)","DOI":"10.1109\/CDC.2001.980711"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-45657-0_2","volume-title":"Computer Aided Verification","author":"L. Zhang","year":"2002","unstructured":"Zhang, L., Malik, S.: The Quest for Efficient Boolean Satifiability Solves. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 17\u201336. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11319-2_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:39:32Z","timestamp":1606185572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11319-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642113185","9783642113192"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11319-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}