{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:06:29Z","timestamp":1725483989347},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439974"},{"type":"electronic","value":"9783540456575"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45657-0_28","type":"book-chapter","created":{"date-parts":[[2007,5,19]],"date-time":"2007-05-19T14:59:43Z","timestamp":1179586783000},"page":"354-359","source":"Crossref","is-referenced-by-count":7,"title":["SPeeDI \u2014 A Verification Tool for Polygonal Hybrid Systems"],"prefix":"10.1007","author":[{"given":"Eugene","family":"Asarin","sequence":"first","affiliation":[]},{"given":"Gordon","family":"Pace","sequence":"additional","affiliation":[]},{"given":"Gerardo","family":"Schneider","sequence":"additional","affiliation":[]},{"given":"Sergio","family":"Yovine","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,20]]},"reference":[{"key":"28_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/3-540-46430-1_6","volume-title":"HSCC\u201900","author":"E. Asarin","year":"2000","unstructured":"E. Asarin, O. Bournez, T. Dang, and O. Maler. Reachability analysis of piecewise-linear dynamical systems. In HSCC\u201900, pages 20\u201331. LNCS 1790, Springer, 2000."},{"key":"28_CR2","series-title":"Lect Notes Comput Sci","volume-title":"HSCC\u201901","author":"E. Asarin","year":"2001","unstructured":"E. Asarin, G. Schneider, and S. Yovine. On the decidability of the reachability problem for planar differential inclusions. In HSCC\u201901. LNCS 2034, Springer, 2001."},{"key":"28_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/3-540-45873-5_7","volume-title":"HSCC\u201902","author":"E. Asarin","year":"2002","unstructured":"E. Asarin, G. Schneider, and S. Yovine. Towards computing phase portraits of polygonal differential inclusions. In HSCC\u201902, pages 49\u201361. LNCS 2289, Springer, 2002."},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"T. A. Henzinger, P. W. Kopke, A. Puri, and P. Varaiya. What\u2019s decidable about hybrid automata? In STOC\u201995, pages 373\u2013382. ACM Press, 1995.","DOI":"10.1145\/225058.225162"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"T. A. Henzinger, P.-H. Ho, and H. Wong-toi. Hytech: A model checker for hybrid systems. Software Tools for Technology Transfer, 1(1), 1997.","DOI":"10.1007\/s100090050008"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/s100090050008","volume":"1","author":"T. A. Henzinger","year":"1997","unstructured":"Thomas A. Henzinger, Pei-Hsin Ho, and Howard Wong-Toi. Hytech: A model checker for hybrid systems. Software Tools for Technology Transfer, 1:110\u2013122, 1997.","journal-title":"Software Tools for Technology Transfer"},{"key":"28_CR7","unstructured":"Simon Peyton Jones and John Hughes. Report on Haskell 98: A non-strict, purely functional language, 1999. available from http:\/\/www.haskell.org ."},{"key":"28_CR8","series-title":"Lect Notes Comput Sci","volume-title":"HSCC\u201900","author":"A. B. Kurzhanski","year":"2000","unstructured":"A. B. Kurzhanski and P. Varaiya. Ellipsoidal techniques for reachability analysis. In HSCC\u201900. LNCS 1790, Springer, 2000."},{"issue":"3","key":"28_CR9","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1006\/jsco.2001.0472","volume":"32","author":"G. Lafferriere","year":"2001","unstructured":"G. Lafferriere, G. Pappas, and S. Yovine. Symbolic reachability computation of families of linear vector fields. Journal of Symbolic Computation, 32(3):231\u2013253, September 2001.","journal-title":"Journal of Symbolic Computation"},{"key":"28_CR10","unstructured":"M. Leucker, T. Noll, P. Stevens, and M. Weber. Functional programming languages for verification tools: Experiences with ML and Haskell. In Proceedings of the Scottish Functional Programming Workshop (SFPW\u201901), 2001."}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45657-0_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T05:21:09Z","timestamp":1556428869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45657-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439974","9783540456575"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-45657-0_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}