{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:40:09Z","timestamp":1740102009713,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,5,21]],"date-time":"2010-05-21T00:00:00Z","timestamp":1274400000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Softw Tools Technol Transfer"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s10009-010-0161-y","type":"journal-article","created":{"date-parts":[[2010,5,20]],"date-time":"2010-05-20T18:46:59Z","timestamp":1274381219000},"page":"273-287","source":"Crossref","is-referenced-by-count":1,"title":["A uniform approach to three-valued semantics for\u00a0\u03bc-calculus on abstractions of hybrid automata"],"prefix":"10.1007","volume":"13","author":[{"given":"K.","family":"Bauer","sequence":"first","affiliation":[]},{"given":"R.","family":"Gentilini","sequence":"additional","affiliation":[]},{"given":"K.","family":"Schneider","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,5,21]]},"reference":[{"issue":"2","key":"161_CR1","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1023\/A:1008626013578","volume":"11","author":"R. Alur","year":"1997","unstructured":"Alur R., Courcoubetis C., Henzinger T.: Computing accumulated delays in real-time systems. Formal Methods Syst. Design 11(2), 137\u2013155 (1997)","journal-title":"Formal Methods Syst. Design"},{"issue":"2","key":"161_CR2","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur R., Dill D.: A theory of timed automata. Theoret. Comp. Sci. 126(2), 183\u2013235 (1994)","journal-title":"Theoret. Comp. Sci."},{"issue":"3","key":"161_CR3","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1109\/32.489079","volume":"22","author":"R. Alur","year":"1996","unstructured":"Alur R., Henzinger T., Ho P.-H.: Automatic symbolic verification of embedded systems. IEEE Trans. Softw. Eng. 22(3), 181\u2013201 (1996)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"7","key":"161_CR4","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1109\/5.871304","volume":"88","author":"R. Alur","year":"2000","unstructured":"Alur R., Henzinger T., Lafferriere G., Pappas G.: Discrete abstractions of hybrid systems. Proc. IEEE 88(7), 971\u2013984 (2000)","journal-title":"Proc. IEEE"},{"key":"161_CR5","volume-title":"Three-valued\u00a0\u03bc-calculus on hybrid automata. Master\u2019s thesis, Department of Computer Science","author":"K. Bauer","year":"2007","unstructured":"Bauer K.: Three-valued\u00a0\u03bc-calculus on hybrid automata. Master\u2019s thesis, Department of Computer Science. University of Kaiserslautern, Germany (2007)"},{"key":"161_CR6","doi-asserted-by":"crossref","unstructured":"Bauer, K., Gentilini, R., Schneider, K. A uniform approach to three-valued semantics for\u00a0\u03bc-calculus on abstractions of hybrid automata. In: Chockler, H., Hu, A. (eds). International Haifa verification conference (HVC). LNCS, vol. 5394, pp. 38\u201352. Springer, Haifa (2009)","DOI":"10.1007\/978-3-642-01702-5_9"},{"key":"161_CR7","first-page":"41","volume-title":"Hybrid systems: computation and control (HSCC)","author":"K. Bauer","year":"2010","unstructured":"Bauer K., Schneider K.: From synchronous programs to symbolic representations of hybrid systems. In: Johansson, K., Yi, W. (eds) Hybrid systems: computation and control (HSCC), pp. 41\u201350. ACM, Stockholm (2010)"},{"key":"161_CR8","doi-asserted-by":"crossref","unstructured":"Bensalem, S., Bouajjani, A., Loiseaux, C., Sifakis, J.: Property preserving simulations. In: von Bochmann, G., Probst, D. (eds) Computer aided verification (CAV). LNCS, vol. 663, pp. 260\u2013273. Springer, Montreal (1993)","DOI":"10.1007\/3-540-56496-9_21"},{"key":"161_CR9","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/3-540-48683-6_25","volume-title":"Computer Aided Verification (CAV), LNCS, vol. 1633","author":"G. Bruns","year":"1999","unstructured":"Bruns G., Godefroid P.: Model checking partial state spaces with 3-valued temporal logics. In: Halbwachs, N., Peled, D. (eds) Computer Aided Verification (CAV), LNCS, vol. 1633, pp. 274\u2013287. Springer, Trento (1999)"},{"key":"161_CR10","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/3-540-49163-5_3","volume-title":"Hybrid Systems V. LNCS, vol. 1567","author":"J. Davoren","year":"1999","unstructured":"Davoren J.: On hybrid systems and the modal\u00a0\u03bc-calculus. In: Panos, J., Kohn, W., Lemmon, M., Nerode, A., Sastry, S. (eds) Hybrid Systems V. LNCS, vol. 1567, pp. 38\u201369. Springer, Berlin (1999)"},{"issue":"7","key":"161_CR11","doi-asserted-by":"crossref","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. IEEE 88(7), 985\u20131010 (2000)","journal-title":"Proc. IEEE"},{"issue":"1\u20133","key":"161_CR12","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. Fundamenta Informaticae 20(1\u20133), 113\u2013131 (1994)","journal-title":"Fundamenta Informaticae"},{"key":"161_CR13","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/3-540-45500-0_17","volume-title":"Theoretical aspects of computer software (TACS). LNCS, vol. 2215","author":"M. Fr\u00e4nzle","year":"2001","unstructured":"Fr\u00e4nzle, M.: What will be eventually true of polynomial hybrid automata? In: Kobayashi, N., Pierce, B. (eds.) Theoretical aspects of computer software (TACS). LNCS, vol. 2215, pp. 340\u2013359. Springer, Sendai (2001)"},{"key":"161_CR14","first-page":"224","volume-title":"International Symposium on Logical Foundations of Computer Science (LFCS). LNCS, vol. 4514","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., Nerode, A. (eds) International Symposium on Logical Foundations of Computer Science (LFCS). LNCS, vol. 4514, pp. 224\u2013240. Springer, New York (2007)"},{"key":"161_CR15","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/3-540-36580-X_19","volume-title":"Hybrid systems: computation and control (HSCC). LNCS, vol. 2623","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) Hybrid systems: computation and control (HSCC). LNCS, vol. 2623, pp. 233\u2013248. Springer, Prague (2003)"},{"key":"161_CR16","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/3-540-45351-2_21","volume-title":"Hybrid systems: computation and control (HSCC), LNCS, vol. 2034","author":"R. Ghosh","year":"2001","unstructured":"Ghosh R., Tomlin C.: Lateral inhibition through Delta-Notch signaling: a piecewise affine hybrid model. In: Di Benedetto, M., Sangiovanni-Vincentelli, A. (eds) Hybrid systems: computation and control (HSCC), LNCS, vol. 2034, pp. 232\u2013246. Springer, Rome (2001)"},{"key":"161_CR17","first-page":"426","volume-title":"Conference on Concurrency Theory (CONCUR). LNCS, vol. 2154","author":"P. Godefroid","year":"2001","unstructured":"Godefroid P., Huth M., Jagadeesan R.: Abstraction-based model checking using modal transition systems. In: Larsen, K., Nielsen, M. (eds) Conference on Concurrency Theory (CONCUR). LNCS, vol. 2154, pp. 426\u2013440. Springer, Aalborg (2001)"},{"key":"161_CR18","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/978-3-540-30579-8_16","volume-title":"Verification, Model Checking, and Abstract Interpretation (VMCAI). LNCS, vol. 3385","author":"O. Grumberg","year":"2005","unstructured":"Grumberg O., Lange M., Leucker M., Shoham S.: Don\u2019t know in the\u00a0\u03bc-calculus. In: Cousot, R. (eds) Verification, Model Checking, and Abstract Interpretation (VMCAI). LNCS, vol. 3385, pp. 233\u2013249. Springer, Paris (2005)"},{"key":"161_CR19","first-page":"453","volume-title":"Annual symposium on foundations of computer science (FOCS)","author":"M. Henzinger","year":"1995","unstructured":"Henzinger M., Henzinger T., Kopke P.: Computing simulations on finite and infinite graphs. In: Seberry, J., Pieprzyk, J. (eds) Annual symposium on foundations of computer science (FOCS), pp. 453. IEEE Computer Society, New Brunswick (1995)"},{"key":"161_CR20","first-page":"278","volume-title":"The theory of hybrid automata. In: Symposium on Logic in Computer Science (LICS)","author":"T. Henzinger","year":"1996","unstructured":"Henzinger T.: The theory of hybrid automata. In: Symposium on Logic in Computer Science (LICS), pp. 278\u2013292. IEEE Computer Society, New Brunswick (1996)"},{"issue":"1","key":"161_CR21","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1006\/jcss.1998.1581","volume":"57","author":"T. Henzinger","year":"1998","unstructured":"Henzinger T., Kopke P., Puri A., Varaiya P.: What\u2019s decidable about hybrid automata?. J. Comp. Syst. Sci. 57(1), 94\u2013124 (1998)","journal-title":"J. Comp. Syst. Sci."},{"issue":"1","key":"161_CR22","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"P. Kannellakis","year":"1990","unstructured":"Kannellakis P., Smolka S.: CCS expressions, finite state processes, and three problems of equivalence. Inform. Comput. 86(1), 43\u201368 (1990)","journal-title":"Inform. Comput."},{"key":"161_CR23","volume-title":"Introduction to Metamathematics","author":"S. Kleene","year":"1952","unstructured":"Kleene S.: Introduction to Metamathematics. North Holland, Amsterdam (1952)"},{"issue":"1","key":"161_CR24","doi-asserted-by":"crossref","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. Math. Control Signals Syst. 13(1), 1\u201321 (2000)","journal-title":"Math. Control Signals Syst."},{"key":"161_CR25","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/3-540-48983-5_15","volume-title":"Hybrid Systems: Computation and Control (HSCC). LNCS, vol. 1569","author":"G. Lafferriere","year":"1999","unstructured":"Lafferriere G., Pappas G., Yovine S.: A new class of decidable hybrid systems. In: Vaandrager, F., van Schuppen, J. (eds) Hybrid Systems: Computation and Control (HSCC). LNCS, vol. 1569, pp. 137\u2013151. Springer, Berg en Dal (1999)"},{"key":"161_CR26","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1007\/3-540-46430-1_26","volume-title":"Hybrid Systems: Computation and Control (HSCC). LNCS, vol. 1790","author":"J. Miller","year":"2000","unstructured":"Miller J.: Decidability and complexity results for timed automata and semi-linear hybrid automata. In: Lynch, N., Krogh, B. (eds) Hybrid Systems: Computation and Control (HSCC). LNCS, vol. 1790, pp. 296\u2013309. Springer, Pittsburgh (2000)"},{"key":"161_CR27","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/11513988_3","volume-title":"Computer Aided Verification (CAV). LNCS, vol. 3576","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. (eds) Computer Aided Verification (CAV). LNCS, vol. 3576, pp. 5\u201319. Springer, Edinburgh (2005)"},{"key":"161_CR28","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/978-3-540-31954-2_37","volume-title":"Hybrid Systems: Computation and Control (HSCC). LNCS, vol. 3414","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) Hybrid Systems: Computation and Control (HSCC). LNCS, vol. 3414, pp. 573\u2013589. Springer, Zurich (2005)"},{"key":"161_CR29","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1007\/978-3-540-24730-2_40","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems (TACAS). LNCS, vol. 2988","author":"S. Shoham","year":"2004","unstructured":"Shoham S., Grumberg O.: Monotonic abstraction-refinement for CTL. In: Jensen, K., Podelski, A. (eds) Tools and Algorithms for the Construction and Analysis of Systems (TACAS). LNCS, vol. 2988, pp. 546\u2013560. Springer, Barcelona (2004)"},{"key":"161_CR30","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/11562948_27","volume-title":"Automated Technology for Verification and Analysis (ATVA). LNCS, vol. 3707","author":"S. Shoham","year":"2005","unstructured":"Shoham S., Grumberg O.: Multi-valued model checking games. In: Peled, D., Tsay, Y.-K. (eds) Automated Technology for Verification and Analysis (ATVA). LNCS, vol. 3707, pp. 354\u2013369. Springer, Taipei (2005)"},{"key":"161_CR31","doi-asserted-by":"crossref","unstructured":"Shoham S., Grumberg O.: 3-valued abstraction: more precision at less cost. In: Symposium on Logic in Computer Science (LICS), pp. 399\u2013410. IEEE Computer Society, Seattle (2006)","DOI":"10.1109\/LICS.2006.5"},{"key":"161_CR32","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/3-540-45873-5_36","volume-title":"Hybrid Systems: Computation and Control (HSCC). LNCS, vol. 2289","author":"A. Tiwari","year":"2002","unstructured":"Tiwari A., Khanna G.: Series of abstractions for hybrid automata. In: Tomlin, C., Greenstreet, M. (eds) Hybrid Systems: Computation and Control (HSCC). LNCS, vol. 2289, pp. 465\u2013478. Springer, Stanford (2002)"}],"container-title":["International Journal on Software Tools for Technology Transfer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10009-010-0161-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10009-010-0161-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10009-010-0161-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:10:54Z","timestamp":1740100254000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10009-010-0161-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,21]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["161"],"URL":"https:\/\/doi.org\/10.1007\/s10009-010-0161-y","relation":{},"ISSN":["1433-2779","1433-2787"],"issn-type":[{"type":"print","value":"1433-2779"},{"type":"electronic","value":"1433-2787"}],"subject":[],"published":{"date-parts":[[2010,5,21]]}}}