{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:32:43Z","timestamp":1743139963614,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642017018"},{"type":"electronic","value":"9783642017025"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01702-5_9","type":"book-chapter","created":{"date-parts":[[2009,4,18]],"date-time":"2009-04-18T14:01:45Z","timestamp":1240063305000},"page":"38-52","source":"Crossref","is-referenced-by-count":2,"title":["A Uniform Approach to Three-Valued Semantics for \u03bc-Calculus on Abstractions of Hybrid Automata"],"prefix":"10.1007","author":[{"given":"Kerstin","family":"Bauer","sequence":"first","affiliation":[]},{"given":"Raffaella","family":"Gentilini","sequence":"additional","affiliation":[]},{"given":"Klaus","family":"Schneider","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"9_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":"9_CR2","doi-asserted-by":"crossref","unstructured":"Alur, R., Henzinger, T.A., Ho, P.: Automatic symbolic verification of embedded systems. In: IEEE Real-Time Systems Symposium, pp. 2\u201311 (1993)","DOI":"10.1109\/REAL.1993.393520"},{"key":"9_CR3","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. Proc. of the IEEE\u00a088, 971\u2013984 (2000)","journal-title":"Proc. of the IEEE"},{"key":"9_CR4","unstructured":"Bauer, K.: Three-valued \u03bc-calculus on hybrid automata. Master\u2019s thesis, Master Thesis, University of Kaiserslautern, Department of Computer Science (2008)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/3-540-56496-9_21","volume-title":"Computer Aided Verification","author":"S. Bensalem","year":"1993","unstructured":"Bensalem, S., Bouajjani, A., Loiseaux, C., Sifakis, J.: Property preserving simulations. In: von Bochmann, G., Probst, D. (eds.) CAV 1992. LNCS, vol.\u00a0663, pp. 260\u2013273. Springer, Heidelberg (1993)"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/3-540-49163-5_3","volume-title":"Hybrid Systems V","author":"J. Davoren","year":"1999","unstructured":"Davoren, J.: On hybrid systems and the modal \u03bc-calculus. In: Antsaklis, P.J., Kohn, W., Lemmon, M.D., Nerode, A., Sastry, S.S. (eds.) HS 1997. LNCS, vol.\u00a01567, pp. 38\u201369. Springer, Heidelberg (1999)"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1109\/5.871305","volume":"88","author":"J. Davoren","year":"2000","unstructured":"Davoren, J., Nerode, A.: Logics for hybrid systems. Proc. of the IEEE\u00a088, 985\u20131010 (2000)","journal-title":"Proc. of the IEEE"},{"key":"9_CR8","first-page":"113","volume":"20","author":"M. Fitting","year":"1994","unstructured":"Fitting, M.: Kleene\u2019s three valued logics and their children. Fund. Inf.\u00a020, 113\u2013131 (1994)","journal-title":"Fund. Inf."},{"key":"9_CR9","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":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-540-72734-7_16","volume-title":"Logical Foundations of Computer Science","author":"R. Gentilini","year":"2007","unstructured":"Gentilini, R., Schneider, K., Mishra, B.: Successive abstractions of hybrid automata for monotonic CTL model checking. In: Artemov, S.N., Nerode, A. (eds.) LFCS 2007. LNCS, vol.\u00a04514, pp. 224\u2013240. Springer, Heidelberg (2007)"},{"key":"9_CR11","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.: 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":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/3-540-45351-2_21","volume-title":"Hybrid Systems: Computation and Control","author":"R. Ghosh","year":"2001","unstructured":"Ghosh, R., Tomlin, C.J.: Lateral inhibition through delta-notch signaling: A piecewise affine hybrid model. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol.\u00a02034, pp. 232\u2013245. Springer, Heidelberg (2001)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/3-540-44685-0_29","volume-title":"CONCUR 2001 - Concurrency Theory","author":"P. Godefroid","year":"2001","unstructured":"Godefroid, P., Huth, M., Jagadeesan, R.: Abstraction-based model checking using modal transition systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 426\u2013440. Springer, Heidelberg (2001)"},{"key":"9_CR14","first-page":"453","volume-title":"Proc. of 36th Ann. Symp. on Found. of Comp. Sc.","author":"M.R. Henzinger","year":"1995","unstructured":"Henzinger, M.R., Henzinger, T.A., Kopke, P.W.: Computing simulations on finite and infinite graphs. In: Proc. of 36th Ann. Symp. on Found. of Comp. Sc., p. 453. IEEE, Los Alamitos (1995)"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/3-540-60084-1_85","volume-title":"Automata, Languages and Programming","author":"T. Henzinger","year":"1995","unstructured":"Henzinger, T.: Hybrid automata with finite bisimulations. In: F\u00fcl\u00f6p, Z., Gecseg, F. (eds.) ICALP 1995. LNCS, vol.\u00a0944, pp. 324\u2013335. Springer, Heidelberg (1995)"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1109\/LICS.1996.561342","volume-title":"Proc. of the 11th IEEE Symp. on Logic in Comp. 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 Comp. Science, pp. 278\u2013292. IEEE Computer Society, Los Alamitos (1996)"},{"key":"9_CR17","first-page":"373","volume-title":"Proc. of the 27th Symp. 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 Symp. on Theory of Computing, pp. 373\u2013382. ACM, New York (1995)"},{"issue":"1","key":"9_CR18","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":"9_CR19","volume-title":"Introduction to Metamathematics","author":"S.C. Kleene","year":"1971","unstructured":"Kleene, S.C.: Introduction to Metamathematics. Wolters-Noordhoff, Groningen (1971)"},{"key":"9_CR20","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":"9_CR21","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, 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":"9_CR22","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. Miller","year":"2000","unstructured":"Miller, J.: 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":"9_CR23","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: Challenges from systems biology. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 5\u201319. Springer, Heidelberg (2005)"},{"key":"9_CR24","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1023\/A:1008626013578","volume":"11","author":"C.C.R. Alur","year":"1997","unstructured":"Alur, C.C.R., Henzinger, T.A.: Computing accumulated delays in real-time systems. Formal Methods in System Design\u00a011, 137\u2013156 (1997)","journal-title":"Formal Methods in System Design"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"9_CR26","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)"}],"container-title":["Lecture Notes in Computer Science","Hardware and Software: Verification and Testing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01702-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,9]],"date-time":"2025-02-09T02:02:58Z","timestamp":1739066578000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01702-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642017018","9783642017025"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01702-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}