{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:33:37Z","timestamp":1725456817500},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633860"},{"type":"electronic","value":"9783540695295"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0036202","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T07:47:22Z","timestamp":1134287242000},"page":"411-422","source":"Crossref","is-referenced-by-count":5,"title":["From finite automata toward hybrid systems (Extended abstract)"],"prefix":"10.1007","author":[{"given":"A.","family":"Rabinovich","sequence":"first","affiliation":[]},{"given":"B. A.","family":"Trakhtenbrot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,21]]},"reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"1543","DOI":"10.1145\/186025.186058","volume":"5","author":"M. Abadi","year":"1994","unstructured":"M. Abadi and L. Lamport. An Old-Fashioned Recipe for Real Time. In ACM Toplas 16, 5:1543\u20131571,1994.","journal-title":"ACM Toplas 16"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"R. Alur, C. Courcubetis, T. Henzinger and P. Ho. Hybrid Automata, an algorithmic approach to the specification and verification of hybrid systems. LNCS 736, 1993.","DOI":"10.1007\/3-540-57318-6_30"},{"key":"35_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":"35_CR4","unstructured":"R. Alur, T. Henzinger and P. Ho. Automatic Symbolic Verification of Embedded Systems, 1993."},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"T. Henzinger. A theory of hybrid automata. In Proceedings of LICS, 1996.","DOI":"10.1109\/LICS.1996.561342"},{"key":"35_CR6","unstructured":"N. Kobrinski and B. A. Trakhtenbrot. Introduction to the theory of Finite Automata, North Holland 1965."},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"S. Kleene. Representation of events in nerve nets and finite automata. Automata Studies, 32-41, Princeton, 1956.","DOI":"10.1515\/9781400882618-002"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"O. Maler, A. Pnueli and J. Sifakis. On the synthesis of discrete controller for timed systems. In Theoretical Aspects of Computer Science, LNCS vol 900, 1995.","DOI":"10.1007\/3-540-59042-0_76"},{"key":"35_CR9","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF02478259","volume":"5","author":"R. McCulloch","year":"1943","unstructured":"R. McCulloch and W. Pitts. A logical calculus of the ideas immanent inn nervous activity. Bull., Math. Biophysics, 5, 1943, pp. 115\u2013133.","journal-title":"Bull., Math. Biophysics"},{"key":"35_CR10","unstructured":"D. Pardo,A. Rabinovich and B. A. Trakhtenbrot. On Synchronous Circuits over Continuous Time. Technical Report Tel Aviv University, 1997. Available at http:\/\/www.math.tau.ac.il\/-rabino."},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"B. Trakhtenbrot. Origins and Metamorphoses of the Trinity: Logics, Nets, Automata. In Proceedings of LICS, 1995.","DOI":"10.1109\/LICS.1995.523284"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"D. Scott. Some definitional suggestions for automata theory. J. of Computer and System Science, 1967, pp.187\u2013212.","DOI":"10.1016\/S0022-0000(67)80014-X"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"T. Wilke. Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata, FTFRFT, 1994. *** DIRECT SUPPORT *** A0008123 00011","DOI":"10.1007\/3-540-58468-4_191"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0036202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T13:53:29Z","timestamp":1586613209000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0036202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633860","9783540695295"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0036202","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}