{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,17]],"date-time":"2025-02-17T00:40:15Z","timestamp":1739752815398,"version":"3.37.1"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114854"},{"type":"electronic","value":"9783642114861"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11486-1_20","type":"book-chapter","created":{"date-parts":[[2010,1,27]],"date-time":"2010-01-27T08:39:51Z","timestamp":1264581591000},"page":"230-241","source":"Crossref","is-referenced-by-count":1,"title":["\u03a3 K \u2013constraints for Hybrid Systems"],"prefix":"10.1007","author":[{"given":"Margarita","family":"Korovina","sequence":"first","affiliation":[]},{"given":"Oleg","family":"Kudinov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/3-540-45351-2_9","volume-title":"Hybrid Systems: Computation and Control","author":"H. Anai","year":"2001","unstructured":"Anai, H., Weispfenning, V.: Reach set computation using real quantifier elimination. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol.\u00a02034, p. 63. Springer, Heidelberg (2001)"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0304-3975(98)00284-9","volume":"219","author":"V. Brattka","year":"1999","unstructured":"Brattka, V., Weihrauch, K.: Computability on subsets of euclidean space I: Closed and compact sets. TCS\u00a0219, 65\u201393 (1999)","journal-title":"TCS"},{"key":"20_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-11035-5","volume-title":"Admissible sets and Structures","author":"J. Barwise","year":"1975","unstructured":"Barwise, J.: Admissible sets and Structures. Springer, Berlin (1975)"},{"key":"20_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-05355-3","volume-title":"Algorithms in Real Algebraic Geometry","author":"S. Basu","year":"2003","unstructured":"Basu, S., Pollack, R., Roy, M.-F.: Algorithms in Real Algebraic Geometry. Springer, Heidelberg (2003)"},{"issue":"4","key":"20_CR5","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1145\/1024922.1024927","volume":"5","author":"F.. Benhamou","year":"2004","unstructured":"Benhamou, F., Goualard, F., Langu\u00e9nou, E., Christie, M.: Interval constraint solving for camera control and motion planning. ACM Trans. Comput. Log.\u00a05(4), 732\u2013767 (2004)","journal-title":"ACM Trans. Comput. Log."},{"volume-title":"Quantifier Elimination and Cylindrical Algebraic Decomposition","year":"1998","key":"20_CR6","unstructured":"Caviness, B.F., Johnson, J.R. (eds.): Quantifier Elimination and Cylindrical Algebraic Decomposition. Springer, Wien (1998)"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/3-540-07407-4_17","volume-title":"Automata Theory and Formal Languages","author":"G.E. Collins","year":"1975","unstructured":"Collins, G.E.: Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol.\u00a033, pp. 134\u2013183. Springer, Heidelberg (1975)"},{"key":"20_CR8","volume-title":"Definability and computability","author":"Y.L. Ershov","year":"1996","unstructured":"Ershov, Y.L.: Definability and computability. Plenum, New York (1996)"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/3-540-64358-3_40","volume-title":"Hybrid Systems: Computation and Control","author":"T.A. Henzinger","year":"1998","unstructured":"Henzinger, T.A., Rusu, V.: Reachability Verification for Hybrid Automata. In: Henzinger, T.A., Sastry, S.S. (eds.) HSCC 1998. LNCS, vol.\u00a01386, pp. 190\u2013205. Springer, Heidelberg (1998)"},{"key":"20_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0539-5","volume-title":"Descriptive Complexity","author":"N. Immerman","year":"1999","unstructured":"Immerman, N.: Descriptive Complexity. Springer, Heidelberg (1999)"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44622-2_1","volume-title":"Computer Science Logic","author":"A. Blass","year":"2000","unstructured":"Blass, A., Gurevich, Y.: Background, reserve and Gandy machines. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol.\u00a01862, pp. 1\u201317. Springer, Heidelberg (2000)"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/j.entcs.2008.03.023","volume":"202","author":"M.V. Korovina","year":"2008","unstructured":"Korovina, M.V., Kudinov, O.V.: Towards Computability over Effectively Enumerable Topological Spaces. Electr. Notes Theor. Comput. Sci.\u00a0202, 305\u2013313 (2008)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/11494645_30","volume-title":"New Computational Paradigms","author":"M.V. Korovina","year":"2005","unstructured":"Korovina, M.V., Kudinov, O.V.: Towards computability of higher type continuous data. In: Cooper, S.B., L\u00f6we, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol.\u00a03526, pp. 235\u2013241. Springer, Heidelberg (2005)"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1007\/978-3-540-45220-1_27","volume-title":"Computer Science Logic","author":"M.V. Korovina","year":"2003","unstructured":"Korovina, M.V.: Computational aspects of \u03a3-definability over the real numbers without the equality test. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol.\u00a02803, pp. 330\u2013344. Springer, Heidelberg (2003)"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/978-3-540-39813-4_21","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"M.V. Korovina","year":"2003","unstructured":"Korovina, M.V.: Gandy\u2019s theorem for abstract structures without the equality test. In: Vardi, M.Y., Voronkov, A. (eds.) LPAR 2003. LNCS, vol.\u00a02850, pp. 290\u2013301. Springer, Heidelberg (2003)"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/3-540-44802-0_12","volume-title":"Computer Science Logic","author":"M.V. Korovina","year":"2001","unstructured":"Korovina, M.V., Kudinov, O.V.: Semantic characterisations of second-order computability over the real numbers. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol.\u00a02142, pp. 160\u2013172. Springer, Heidelberg (2001)"},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-45335-0_10","volume-title":"Computability and Complexity in Analysis","author":"M.V. Korovina","year":"2001","unstructured":"Korovina, M.V., Kudinov, O.V.: Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory. In: Blank, J., Brattka, V., Hertling, P. (eds.) CCA 2000. LNCS, vol.\u00a02064, pp. 146\u2013168. Springer, Heidelberg (2001)"},{"key":"20_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/3-540-45575-2_47","volume-title":"Perspectives of System Informatics","author":"M.V. Korovina","year":"2001","unstructured":"Korovina, M.V., Kudinov, O.V.: Generalised Computability and Applications to Hybrid Systems. In: Bj\u00f8rner, D., Broy, M., Zamulin, A.V. (eds.) PSI 2001. LNCS, vol.\u00a02244, pp. 494\u2013499. Springer, Heidelberg (2001)"},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/10703163_14","volume-title":"Computer Science Logic","author":"M.V. Korovina","year":"1999","unstructured":"Korovina, M.V., Kudinov, O.V.: Characteristic properties of majorant-computability over the reals. In: Gottlob, G., Grandjean, E., Seyr, K. (eds.) CSL 1998. LNCS, vol.\u00a01584, pp. 188\u2013203. Springer, Heidelberg (1999)"},{"key":"20_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90074-P","volume":"101","author":"E. Dahlhaus","year":"1992","unstructured":"Dahlhaus, E., Makowsky, J.A.: Query languages for hierarchic databases. Information and Computation\u00a0101, 1\u201332 (1992)","journal-title":"Information and Computation"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/3-540-57318-6_35","volume-title":"Hybrid Systems","author":"A. Nerode","year":"1993","unstructured":"Nerode, A., Kohn, W.: Models for Hybrid Systems: Automata, Topologies, Controllability, Observability. In: Grossman, R.L., Ravn, A.P., Rischel, H., Nerode, A. (eds.) HS 1991 and HS 1992. LNCS, vol.\u00a0736, pp. 317\u2013357. Springer, Heidelberg (1993)"},{"key":"20_CR22","volume-title":"Computability in Analysis and Physics","author":"M.B. Pour-El","year":"1988","unstructured":"Pour-El, M.B., Richards, J.I.: Computability in Analysis and Physics. Springer, Heidelberg (1988)"},{"key":"20_CR23","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/11856290_18","volume-title":"Artificial Intelligence and Symbolic Computation","author":"S. Ratschan","year":"2006","unstructured":"Ratschan, S., She, Z.: Constraints for Continuous Reachability in the Verification of Hybrid Systems. In: Calmet, J., Ida, T., Wang, D. (eds.) AISC 2006. LNCS (LNAI), vol.\u00a04120, pp. 196\u2013210. Springer, Heidelberg (2006)"},{"key":"20_CR24","volume-title":"A Decidion Method in Algebra and Geometry","author":"A. Tarski","year":"1951","unstructured":"Tarski, A.: A Decidion Method in Algebra and Geometry. University of California Press, Berkeley (1951)"},{"issue":"1","key":"20_CR25","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10703-007-0044-3","volume":"32","author":"A. Tiwari","year":"2008","unstructured":"Tiwari, A.: Abstractions for hybrid systems. Formal Methods in System Design\u00a032(1), 57\u201383 (2008)","journal-title":"Formal Methods in System Design"},{"key":"20_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis","author":"K. Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis. Springer, Berlin (2000)"}],"container-title":["Lecture Notes in Computer Science","Perspectives of Systems Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11486-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,17]],"date-time":"2025-02-17T00:23:28Z","timestamp":1739751808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11486-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114854","9783642114861"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11486-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}