iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.crossref.org/works/10.1007/11590156_21
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:09:40Z","timestamp":1725566980143},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540304951"},{"type":"electronic","value":"9783540324195"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11590156_21","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T15:43:16Z","timestamp":1133797396000},"page":"261-272","source":"Crossref","is-referenced-by-count":11,"title":["Refining the Undecidability Frontier of Hybrid Automata"],"prefix":"10.1007","author":[{"given":"Venkatesh","family":"Mysore","sequence":"first","affiliation":[]},{"given":"Amir","family":"Pnueli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(94)00202-T","volume":"138","author":"R. Alur","year":"1995","unstructured":"Alur, R., Courcoubetis, C., Halbwachs, N., Henzinger, T.A., Ho, P.-H., Nicollin, X., Olivero, A., Sifakis, J., Yovine, S.: The Algorithmic Analysis of Hybrid Systems. Theoretical Computer Science\u00a0138, 3\u201334 (1995)","journal-title":"Theoretical Computer Science"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A Theory of Timed Automata. TCS\u00a0126, 183\u2013235 (1994)","journal-title":"TCS"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0304-3975(94)00228-B","volume":"138","author":"E. Asarin","year":"1995","unstructured":"Asarin, E., Maler, O., Pnueli, A.: Reachability analysis of dynamical systems having piecewise-constant derivatives. Theoretical Computer Science\u00a0138, 35\u201365 (1995)","journal-title":"Theoretical Computer Science"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-45694-5_14","volume-title":"CONCUR 2002 - Concurrency Theory","author":"E. Asarin","year":"2002","unstructured":"Asarin, E., Schneider, G.: Widening the boundary between decidable and undecidable hybrid systems. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 193\u2013208. Springer, Heidelberg (2002)"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-45351-2_11","volume-title":"Hybrid Systems: Computation and Control","author":"E. Asarin","year":"2001","unstructured":"Asarin, E., Schneider, G., Yovine, S.: On the decidability of the reachability problem for planar differential inclusions. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol.\u00a02034, pp. 89\u2013104. Springer, Heidelberg (2001)"},{"issue":"1-2","key":"21_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0020-0190(00)00075-2","volume":"75","author":"B. Berard","year":"2000","unstructured":"Berard, B., Dufourd, C.: Timed automata and additive clock constraints. Information Processing Letter\u00a075(1-2), 1\u20137 (2000)","journal-title":"Information Processing Letter"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Henzinger, T., Kopke, P.W., Puri, A., Varaiya, P.: What\u2019s Decidable about Hybrid Automata. In: Symposium on the Theory of Computing (STOC), pp. 373\u2013382 (1995)","DOI":"10.1145\/225058.225162"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-64358-3","volume-title":"Hybrid Systems: Computation and Control","author":"T.A. Henzinger","year":"1998","unstructured":"Henzinger, T.A., Sastry, S.: Hybrid Systems-Computation and Control. In: Henzinger, T.A., Sastry, S.S. (eds.) HSCC 1998. LNCS, vol.\u00a01386, Springer, Heidelberg (1998)"},{"key":"21_CR9","unstructured":"Koiran, P.: My favourte problems (1999), http:\/\/perso.ens-lyon.fr\/pascal.koiran\/problems.html"},{"issue":"1","key":"21_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00009858","volume":"13","author":"G. Lafferiere","year":"2000","unstructured":"Lafferiere, G., Pappas, G.J., Sastry, S.: O-minimal Hybrid Systems. Mathematics of Control, Signals, and Systems\u00a013(1), 1\u201321 (2000)","journal-title":"Mathematics of Control, Signals, and Systems"},{"issue":"3","key":"21_CR11","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1006\/jsco.2001.0472","volume":"32","author":"G. Lafferriere","year":"2001","unstructured":"Lafferriere, G., Pappas, G.J., Yovine, S.: Symbolic reachability computation for families of linear vector fields. J. Symb. Comput.\u00a032(3), 231\u2013253 (2001)","journal-title":"J. Symb. Comput."},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-57499-9","volume-title":"Computer Aided Verification","author":"O. Maler","year":"1993","unstructured":"Maler, O., Pnueli, A.: Reachability analysis of planar multi-linear systems. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, Springer, Heidelberg (1993)"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"437","DOI":"10.2307\/1970290","volume":"74","author":"M.L. Minsky","year":"1961","unstructured":"Minsky, M.L.: Recursive unsolvability of post\u2019s problem of tag and other topics in theory of turing machines. Ann. of Math.\u00a074, 437\u2013455 (1961)","journal-title":"Ann. of Math."},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Mysore, V., Mishra, B.: Algorithmic Algebraic Model Checking III: Approximate Methods. Infinity (2005)","DOI":"10.1016\/j.entcs.2005.11.017"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/11513988_3","volume-title":"Computer Aided Verification","author":"C. Piazza","year":"2005","unstructured":"Piazza, C., Antoniotti, M., Mysore, V., Policriti, A., Winkler, F., Mishra, B.: Algorithmic Algebraic Model Checking I: The Case of Biochemical Systems and their Reachability Analysis. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 5\u201319. Springer, Heidelberg (2005)"},{"key":"21_CR16","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/3-540-58179-0_46","volume-title":"Computer Aided Verification","author":"Anuj Puri","year":"1994","unstructured":"Puri, A., Varaiya, P.: Decidebility of hybrid systems with rectangular differential inclusions. Computer Aided Verification, pp. 95\u2013104 (1994)"},{"key":"21_CR17","unstructured":"Schneider, G.: Algorithmic Analysis of Polygonal Hybrid Systems. Ph.D. thesis. VERIMAG - UJF, Grenoble, France (2002)"},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/3-540-36580-X_36","volume-title":"Hybrid Systems: Computation and Control","author":"P. Tabuada","year":"2003","unstructured":"Tabuada, P., Pappas, G.J.: Model checking ltl over controllable linear systems is decidable. In: Maler, O., Pnueli, A. (eds.) HSCC 2003. LNCS, vol.\u00a02623, pp. 498\u2013513. Springer, Heidelberg (2003)"},{"key":"21_CR19","unstructured":"Teschl, G.: Ordinary differential equations and dynamical systems (2004), Lecture Notes from http:\/\/www.mat.univie.ac.at\/gerald\/ftp\/book-ode\/index.html"},{"issue":"42","key":"21_CR20","first-page":"230","volume":"2","author":"A. Turing","year":"1936","unstructured":"Turing, A.: On computable numbers, with an application to the entscheidungs problem. Proceedings of the London Mathematical Society\u00a02(42), 230\u2013265 (1936)","journal-title":"Proceedings of the London Mathematical Society"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11590156_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T19:09:25Z","timestamp":1683313765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11590156_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540304951","9783540324195"],"references-count":20,"URL":"http:\/\/dx.doi.org\/10.1007\/11590156_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}