{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:24:12Z","timestamp":1725456252937},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540611554"},{"type":"electronic","value":"9783540683346"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0020962","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T03:16:01Z","timestamp":1132715761000},"page":"389-400","source":"Crossref","is-referenced-by-count":6,"title":["Deciding reachability for planar multi-polynomial systems"],"prefix":"10.1007","author":[{"given":"K\u0101rlis","family":"\u010cer\u0101ns","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juris","family":"V\u012bksna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(94)00202-T","volume":"138","author":"R. Alur","year":"1995","unstructured":"R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P.H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and Y. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138:3\u201334, 1995.","journal-title":"Theoretical Computer Science"},{"key":"31_CR2","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1007\/BFb0032042","volume":"443","author":"R. Alur","year":"1990","unstructured":"R. Alur and D. Dill. Automata for modeling real time systems. In Proceedings of ICALP'90, volume 443 of Lecture Notes in Computer Science, pages 322\u2013335, 1990.","journal-title":"Lecture Notes in Computer Science"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183\u2013235, 1994.","journal-title":"Theoretical Computer Science"},{"key":"31_CR4","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/3-540-58201-0_58","volume":"820","author":"E. Asarin","year":"1994","unstructured":"E. Asarin and O. Maler. On some relations between dynamical systems and transition systems. In Proceedings of the 21st International Colloquium ICALP94, volume 820 of Lecture Notes in Computer Science, pages 59\u201372, 1994.","journal-title":"Lecture Notes in Computer Science"},{"key":"31_CR5","unstructured":"K. \u010cer\u0101ns. Algorithmic problems in analysis of real time system specifications. PhD thesis, University of Latvia, 1992."},{"key":"31_CR6","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/3-540-56496-9_24","volume":"663","author":"K. \u010cer\u0101ns","year":"1992","unstructured":"K. \u010cer\u0101ns. Decidability of bisimulation equivalences for parallel timer processes. In Proceedings of CAV'92, volume 663 of Lecture Notes in Computer Science, pages 302\u2013315, 1992.","journal-title":"Lecture Notes in Computer Science"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"P.A. Henzinger and P.H. Ho. Algorithmic analysis of nonlinear hybrid systems. In Proceedings of CAV'95, Lecture Notes in Computer Science, 1995.","DOI":"10.1007\/3-540-60045-0_53"},{"key":"31_CR8","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/3-540-60084-1_85","volume":"944","author":"T.A. Henzinger","year":"1995","unstructured":"T.A. Henzinger. Hybrid automata with finite bisimulations. In Proceedings of ICALP'95, volume 944 of Lecture Notes in Computer Science, pages 324\u2013335, 1995.","journal-title":"Lecture Notes in Computer Science"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"T.A. Henzinger, P. Kopke, A. Puri, and P. Varaiya. What's decidable about hybrid automata? In Proceedings of the 27th ACM Symposium on Theory of Computing, 1995.","DOI":"10.1145\/225058.225162"},{"key":"31_CR10","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/3-540-56922-7_17","volume":"697","author":"O. Maler","year":"1993","unstructured":"O. Maler and A. Pnueli. Reachability analysis of planar multi-linear systems. In Proceedings of the 5th International Conference of Computer Aided Verification, volume 697 of Lecture Notes in Computer Science, pages 194\u2013209, 1993.","journal-title":"Lecture Notes in Computer Science"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"R. Zippel. Effective polynomial computation. Kluwer Academic Publishers, 1993.","DOI":"10.1007\/978-1-4615-3188-3"}],"container-title":["Lecture Notes in Computer Science","Hybrid Systems III"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0020962","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,5]],"date-time":"2019-02-05T05:40:07Z","timestamp":1549345207000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0020962"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540611554","9783540683346"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0020962","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}