{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:00:14Z","timestamp":1725487214583},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540727323"},{"type":"electronic","value":"9783540727347"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72734-7_16","type":"book-chapter","created":{"date-parts":[[2007,6,28]],"date-time":"2007-06-28T09:40:50Z","timestamp":1183023650000},"page":"224-240","source":"Crossref","is-referenced-by-count":5,"title":["Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking"],"prefix":"10.1007","author":[{"given":"R.","family":"Gentilini","sequence":"first","affiliation":[]},{"given":"K.","family":"Schneider","sequence":"additional","affiliation":[]},{"given":"B.","family":"Mishra","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"16_CR1","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. Theoretical Computer Science\u00a0126(2), 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1109\/5.871304","volume":"88","author":"R. Alur","year":"2000","unstructured":"Alur, R., Henzinger, T.A., Lafferriere, G., Pappas, G.J.: Discrete abstractions of hybrid systems. Proceedings of the IEEE\u00a088, 971\u2013984 (2000)","journal-title":"Proceedings of the IEEE"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/978-3-540-24743-2_15","volume-title":"Hybrid Systems: Computation and Control","author":"T. Brihaye","year":"2004","unstructured":"Brihaye, T., Michaux, C., Rivi\u00e8re, C., Troestler, C.: On O-minimal hybrid systems. In: Alur, R., Pappas, G.J. (eds.) HSCC 2004. LNCS, vol.\u00a02993, pp. 219\u2013233. Springer, Heidelberg (2004)"},{"key":"16_CR4","volume-title":"Model Checking","author":"E.M. Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999)"},{"issue":"1-3","key":"16_CR5","doi-asserted-by":"crossref","first-page":"113","DOI":"10.3233\/FI-1994-201234","volume":"20","author":"M. Fitting","year":"1994","unstructured":"Fitting, M.: Kleene\u2019s three valued logics and their children. Fundam. Inf.\u00a020(1-3), 113\u2013131 (1994)","journal-title":"Fundam. Inf."},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/3-540-45500-0_17","volume-title":"Theoretical Aspects of Computer Software","author":"M. Fr\u00e4nzle","year":"2001","unstructured":"Fr\u00e4nzle, M.: What will be eventually true of polynomial hybrid automata? In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol.\u00a02215, pp. 340\u2013359. Springer, Heidelberg (2001)"},{"key":"16_CR7","unstructured":"Gentilini, R., Mishra, B., Schneider, K.: Successive abstractions of hybrid automata for monotonic CTL model checking. Technical report, Kaiserslautern University (2007)"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/3-540-36580-X_19","volume-title":"Hybrid Systems: Computation and Control","author":"R. Ghosh","year":"2003","unstructured":"Ghosh, R., Tiwari, A., Tomlin, C.J.: Automated symbolic reachability analysis; with application to delta-notch signaling automata. In: Maler, O., Pnueli, A. (eds.) HSCC 2003. LNCS, vol.\u00a02623, pp. 233\u2013248. Springer, Heidelberg (2003)"},{"key":"16_CR9","first-page":"373","volume-title":"Proc. of the 27th Symposium on Theory of Computing","author":"T.A. Henzinger","year":"1995","unstructured":"Henzinger, T.A., Kopke, P.W., Puri, A., Varaiya, P.: What\u2019s decidable about hybrid automata? In: Proc. of the 27th Symposium on Theory of Computing, pp. 373\u2013382. ACM Press, New York (1995)"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1109\/LICS.1996.561342","volume-title":"Proc. of the 11th IEEE Symp. on Logic in Computer Science","author":"T.A. Henzinger","year":"1996","unstructured":"Henzinger, T.A.: The theory of hybrid automata. In: Proc. of the 11th IEEE Symp. on Logic in Computer Science, pp. 278\u2013292. IEEE Computer Society Press, Los Alamitos (1996)"},{"issue":"1","key":"16_CR11","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"P.C. Kannellakis","year":"1990","unstructured":"Kannellakis, P.C., Smolka, S.A.: CCS expressions, finite state processes, and three problems of equivalence. Information and Computation\u00a086(1), 43\u201368 (1990)","journal-title":"Information and Computation"},{"key":"16_CR12","volume-title":"Introduction to Metamathematics","author":"S.C. Kleene","year":"1971","unstructured":"Kleene, S.C.: Introduction to Metamathematics. Wolters-Noordhoff, Groningen (1971)"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00009858","volume":"13","author":"G. Lafferriere","year":"2000","unstructured":"Lafferriere, G., Pappas, G., Sastry, S.: O-minimal hybrid systems. Mathematics of Control, Signals, and Systems\u00a013, 1\u201321 (2000)","journal-title":"Mathematics of Control, Signals, and Systems"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/3-540-48983-5_15","volume-title":"Hybrid Systems: Computation and Control","author":"G. Lafferriere","year":"1999","unstructured":"Lafferriere, G., Pappas, G.J., Yovine, S.: A new class of decidable hybrid systems. In: Vaandrager, F.W., van Schuppen, J.H. (eds.) HSCC 1999. LNCS, vol.\u00a01569, pp. 137\u2013151. Springer, Heidelberg (1999)"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/3-540-46430-1_26","volume-title":"Hybrid Systems: Computation and Control","author":"J.S. Miller","year":"2000","unstructured":"Miller, J.S.: Decidability and complexity results for timed automata and semi-linear hybrid automata. In: Lynch, N.A., Krogh, B.H. (eds.) HSCC 2000. LNCS, vol.\u00a01790, pp. 296\u2013309. Springer, Heidelberg (2000)"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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: Challenges from systems biology. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 5\u201319. Springer, Heidelberg (2005)"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/978-3-540-31954-2_37","volume-title":"Hybrid Systems: Computation and Control","author":"S. Ratschan","year":"2005","unstructured":"Ratschan, S., She, Z.: Safety verification of hybrid systems by constraint propagation based abstraction refinement. In: Morari, M., Thiele, L. (eds.) HSCC 2005. LNCS, vol.\u00a03414, pp. 573\u2013589. Springer, Heidelberg (2005)"},{"key":"16_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-10778-2","volume-title":"Verification of Reactive Systems","author":"K. Schneider","year":"2004","unstructured":"Schneider, K.: Verification of Reactive Systems. Springer, Heidelberg (2004)"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/3-540-45873-5_36","volume-title":"Hybrid Systems: Computation and Control","author":"A. Tiwari","year":"2002","unstructured":"Tiwari, A., Khanna, G.: Series of abstractions for hybrid automata. In: Tomlin, C.J., Greenstreet, M.R. (eds.) HSCC 2002. LNCS, vol.\u00a02289, pp. 465\u2013478. Springer, Heidelberg (2002)"},{"key":"16_CR20","first-page":"99","volume-title":"Logic: From Foundations to Applications","author":"L. Dries van den","year":"1996","unstructured":"van den Dries, L.: O-minimal structures. In: Hodges, W. (ed.) Logic: From Foundations to Applications, pp. 99\u2013108. Clarendon Press, Oxford (1996)"},{"key":"16_CR21","series-title":"London Math. Soc. Lecture Note Ser.","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511525919","volume-title":"Tame topology and o-minimal structures","author":"L. Dries van den","year":"1998","unstructured":"van den Dries, L.: Tame topology and o-minimal structures. London Math. Soc. Lecture Note Ser., vol.\u00a0248. Cambridge University Press, Cambridge (1998)"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Wilkie, A.J.: Schanuel conjecture and the decidability of the real exponential field. In: Algebraic Model Theory, pp. 223\u2013230 (1997)","DOI":"10.1007\/978-94-015-8923-9_11"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72734-7_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:04:44Z","timestamp":1605762284000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72734-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540727323","9783540727347"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72734-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}