{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:04:14Z","timestamp":1725494654097},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671022"},{"type":"electronic","value":"9783540465621"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46562-6_2","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T19:12:56Z","timestamp":1194981176000},"page":"10-16","source":"Crossref","is-referenced-by-count":4,"title":["A Logical Approach to Specification of Hybrid Systems"],"prefix":"10.1007","author":[{"given":"Margarita V.","family":"Korovina","sequence":"first","affiliation":[]},{"given":"Oleg V.","family":"Kudinov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,1,28]]},"reference":[{"issue":"8","key":"2_CR1","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1145\/359576.359579","volume":"21","author":"J. Backus","year":"1978","unstructured":"J. Backus, Can Programming be Liberated from the von Neumann Style, A Functional Style and its Algebra of Programs, Comm. of the ACM, V. 21, N 8, 1978, pages 613\u2013642.","journal-title":"Comm. of the ACM"},{"key":"2_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-11035-5","volume-title":"Admissible sets and structures","author":"J. Barwise","year":"1975","unstructured":"J. Barwise, Admissible sets and structures, Berlin, Springer-Verlag, 1975."},{"issue":"1","key":"2_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","volume":"21","author":"L. Blum","year":"1989","unstructured":"L. Blum and M. Shub and S. Smale, On a theory of computation and complexity over the reals:NP-completeness, recursive functions and universal machines, Bull. Amer. Math. Soc., (N.S.), v. 21, no. 1, 1989, pages 1\u201346.","journal-title":"Bull. Amer. Math. Soc."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"A. Edalat, P. S\u00fcnderhauf, A domain-theoretic approach to computability on the real line, Theoretical Computer Science. To appear.","DOI":"10.1016\/S0304-3975(98)00097-8"},{"key":"2_CR5","volume-title":"Definability and computability","author":"Yu. L. Ershov","year":"1996","unstructured":"Yu. L. Ershov, Definability and computability, Plenum, New York, 1996."},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0304-3975(82)80003-0","volume":"20","author":"H. Freedman","year":"1982","unstructured":"H. Freedman and K. Ko, Computational complexity of real functions, Theoret. Comput. Sci., v. 20, 1982, pages 323\u2013352.","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR7","series-title":"Lect Notes Comput Sci","first-page":"143","volume-title":"A Logical for specification of Continuous System","year":"1998","unstructured":"A Logical for specification of Continuous System, LNCS N 1386, 1998, pages 143\u2013159."},{"key":"2_CR8","first-page":"3","volume":"107","author":"S.S. Goncharov","year":"1985","unstructured":"S.S. Goncharov, D.I. Sviridenko, \u03a3-programming, Vychislitel\u2019nye Sistemy, Novosibirsk, v. 107, 1985, pages 3\u201329.","journal-title":"\u03a3-programming, Vychislitel\u2019nye Sistemy, Novosibirsk"},{"key":"2_CR9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.4064\/fm-44-1-61-71","volume":"44","author":"A. Grzegorczyk","year":"1957","unstructured":"A. Grzegorczyk, On the definitions of computable real continuous functions, Fund. Math., N 44, 1957, pages 61\u201371.","journal-title":"Fund. Math."},{"key":"2_CR10","series-title":"Lect Notes Comput Sci","first-page":"36","volume-title":"Towards refining Temporal Specifications into Hybrid Systems","author":"T.A. Henzinger","year":"1993","unstructured":"T.A. Henzinger, Z. Manna, A. Pnueli, Towards refining Temporal Specifications into Hybrid Systems, LNCS N 736, 1993, pages 36\u201360."},{"key":"2_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/3-540-64358-3_40","volume-title":"Reachability Verification for Hybrid Automata","author":"T.A. Henzinger","year":"1998","unstructured":"T.A. Henzinger, V. Rusu, Reachability Verification for Hybrid Automata, LNCS N 1386, 1998, pages 190\u2013205."},{"issue":"4","key":"2_CR12","first-page":"1","volume":"2","author":"M. Korovina","year":"1992","unstructured":"M. Korovina, Generalized computability of real functions, Siberian Advance of Mathematics, v. 2, N 4, 1992, pages 1\u201318.","journal-title":"Siberian Advance of Mathematics"},{"issue":"3","key":"2_CR13","first-page":"59","volume":"8","author":"M. Korovina","year":"1998","unstructured":"M. Korovina, O. Kudinov, A New Approach to Computability over the Reals, SibAM, v. 8, N 3, 1998, pages 59\u201373.","journal-title":"SibAM"},{"key":"2_CR14","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of CSL\u201998","author":"M. Korovina","year":"1999","unstructured":"M. Korovina, O. Kudinov, Characteristic Properties of Majorant-Computability over the Reals, Proc. of CSL\u201998, LNCS, to appear."},{"key":"2_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/3-540-64358-3_44","volume-title":"Formal verification of Safety-Critical hybrid systems","author":"C. Livadas","year":"1998","unstructured":"C. Livadas, N.A. Lynch, Formal verification of Safety-Critical hybrid systems, LNCS N 1386, 1998, pages 253\u2013273."},{"key":"2_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/3-540-57318-6_22","volume-title":"Verifying Hybrid Systems","author":"Z. Manna","year":"1993","unstructured":"Z. Manna, A. Pnueli, Verifying Hybrid Systems, LNCS N 736, 1993, pages 4\u201336."},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"R. Montague, Recursion theory as a branch of model theory, Proc. of the third international congr. on Logic, Methodology and the Philos. of Sc., 1967, Amsterdam, 1968, pages 63\u201386.","DOI":"10.1016\/S0049-237X(08)71187-X"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"427","DOI":"10.2307\/1994926","volume":"138","author":"Y. N. Moschovakis","year":"1969","unstructured":"Y. N. Moschovakis, Abstract first order computability, Trans. Amer. Math. Soc., v. 138, 1969, pages 427\u2013464.","journal-title":"Trans. Amer. Math. Soc."},{"key":"2_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/3-540-57318-6_35","volume-title":"Models for Hybrid Systems: Automata, Topologies, Controllability, Observability","author":"A. Nerode","year":"1993","unstructured":"A. Nerode, W. Kohn Models for Hybrid Systems: Automata, Topologies, Controllability, Observability, LNCS N 736, 1993, pages 317\u2013357."},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"M. B. Pour-El, J. I. Richards, Computability in Analysis and Physics, Springer-Verlag, 1988.","DOI":"10.1007\/978-3-662-21717-7"},{"key":"2_CR21","unstructured":"D. Scott, Outline of a mathematical theory of computation, In 4th Annual Princeton Conference on Information Sciences and Systems, 1970, pages 169\u2013176."},{"key":"2_CR22","first-page":"375","volume":"4","author":"V. Stoltenberg-Hansen","year":"1995","unstructured":"V. Stoltenberg-Hansen and J. V. Tucker, Effective algebras, Handbook of Logic in computer Science, v. 4, Clarendon Press, 1995, pages 375\u2013526.","journal-title":"Handbook of Logic in computer Science"},{"key":"2_CR23","unstructured":"B.A. Trakhtenbrot, Yu. Barzdin, Finite automata: Behaviour and Syntheses, North-Holland, 1973."}],"container-title":["Lecture Notes in Computer Science","Perspectives of System Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46562-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T07:26:53Z","timestamp":1556954813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46562-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671022","9783540465621"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-46562-6_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}