{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:02:33Z","timestamp":1742382153212,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540938996"},{"type":"electronic","value":"9783540939009"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-93900-9_28","type":"book-chapter","created":{"date-parts":[[2008,12,15]],"date-time":"2008-12-15T09:35:59Z","timestamp":1229333759000},"page":"349-365","source":"Crossref","is-referenced-by-count":10,"title":["Mixed Transition Systems Revisited"],"prefix":"10.1007","author":[{"given":"Ou","family":"Wei","sequence":"first","affiliation":[]},{"given":"Arie","family":"Gurfinkel","sequence":"additional","affiliation":[]},{"given":"Marsha","family":"Chechik","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/3-540-44618-4_14","volume-title":"CONCUR 2000 - Concurrency Theory","author":"G. Bruns","year":"2000","unstructured":"Bruns, G., Godefroid, P.: Generalized Model Checking: Reasoning about Partial State Spaces. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 168\u2013182. Springer, Heidelberg (2000)"},{"issue":"4","key":"28_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/990010.990011","volume":"12","author":"M. Chechik","year":"2003","unstructured":"Chechik, M., Devereux, B., Easterbrook, S., Gurfinkel, A.: Multi-Valued Symbolic Model-Checking. ACM TOSEM\u00a012(4), 1\u201338 (2003)","journal-title":"ACM TOSEM"},{"issue":"4","key":"28_CR3","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1093\/logcom\/2.4.511","volume":"2","author":"P. Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Abstract Interpretation Frameworks. J. of Logic and Computation\u00a02(4), 511\u2013547 (1992)","journal-title":"J. of Logic and Computation"},{"issue":"19","key":"28_CR4","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/244795.244800","volume":"2","author":"D. Dams","year":"1997","unstructured":"Dams, D., Gerth, R., Grumberg, O.: Abstract Interpretation of Reactive Systems. ACM TOPLAS\u00a02(19), 253\u2013291 (1997)","journal-title":"ACM TOPLAS"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-540-30579-8_15","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"D. Dams","year":"2005","unstructured":"Dams, D., Namjoshi, K.S.: Automata as Abstractions. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol.\u00a03385, pp. 216\u2013232. Springer, Heidelberg (2005)"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"de Alfaro, L., Godefroid, P., Jagadeesan, R.: Three-Valued Abstractions of Games: Uncertainty, but with Precision. In: LICS, pp. 170\u2013179 (2004)","DOI":"10.1109\/LICS.2004.1319611"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Godefroid, P., Huth, M.: Model Checking v.s. Generalized Model Checking: Semantic Minimizations for Temporal Logics. In: LICS, pp. 158\u2013167 (2005)","DOI":"10.1109\/LICS.2005.28"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/3-540-36384-X_18","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"P. Godefroid","year":"2002","unstructured":"Godefroid, P., Jagadeesan, R.: On the Expressiveness of 3-Valued Models. In: Zuck, L.D., Attie, P.C., Cortesi, A., Mukhopadhyay, S. (eds.) VMCAI 2003. LNCS, vol.\u00a02575, pp. 206\u2013222. Springer, Heidelberg (2002)"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/11560548_8","volume-title":"Correct Hardware Design and Verification Methods","author":"A. Gurfinkel","year":"2005","unstructured":"Gurfinkel, A., Chechik, M.: How Thorough Is Thorough Enough? In: Borrione, D., Paul, W. (eds.) CHARME 2005. LNCS, vol.\u00a03725, pp. 65\u201380. Springer, Heidelberg (2005)"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/11691372_14","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Gurfinkel","year":"2006","unstructured":"Gurfinkel, A., Chechik, M.: Why Waste a Perfectly Good Abstraction? In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol.\u00a03920, pp. 212\u2013226. Springer, Heidelberg (2006)"},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/11609773_25","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A. Gurfinkel","year":"2005","unstructured":"Gurfinkel, A., Wei, O., Chechik, M.: Systematic Construction of Abstractions for Model-Checking. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol.\u00a03855, pp. 381\u2013397. Springer, Heidelberg (2005)"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/11817963_18","volume-title":"Computer Aided Verification","author":"A. Gurfinkel","year":"2006","unstructured":"Gurfinkel, A., Wei, O., Chechik, M.: Yasm: A Software Model-Checker for Verification and Refutation. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 170\u2013174. Springer, Heidelberg (2006)"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-45309-1_11","volume-title":"Programming Languages and Systems","author":"M. Huth","year":"2001","unstructured":"Huth, M., Jagadeesan, R., Schmidt, D.A.: Modal Transition Systems: A Foundation for Three-Valued Program Analysis. In: Sands, D. (ed.) ESOP 2001. LNCS, vol.\u00a02028, pp. 155\u2013169. Springer, Heidelberg (2001)"},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"Kozen, D.: Results on the Propositional \u03bc-calculus. Theoretical Computer Science\u00a027, 334\u2013354 (1983)","journal-title":"Theoretical Computer Science"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Larsen, K., Thomsen, B.: A Modal Process Logic. In: LICS, pp. 203\u2013210 (1988)","DOI":"10.1109\/LICS.1988.5119"},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/3-540-54233-7_135","volume-title":"Automata, Languages and Programming","author":"P. Larsen","year":"1991","unstructured":"Larsen, P.: The Expressive Power of Implicit Specifications. In: Leach Albert, J., Monien, B., Rodr\u00edguez-Artalejo, M. (eds.) ICALP 1991. LNCS, vol.\u00a0510, pp. 204\u2013216. Springer, Heidelberg (1991)"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Nejati, S., Gheorghiu, M., Chechik, M.: Thorough Checking Revisited. In: FMCAD, pp. 106\u2013116 (2006)","DOI":"10.1109\/FMCAD.2006.33"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Reps, T.W., Loginov, A., Sagiv, S.: Semantic Minimization of 3-Valued Propositional Formulae. In: LICS, pp. 40\u201354 (2002)","DOI":"10.1109\/LICS.2002.1029816"},{"key":"28_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/978-3-540-24730-2_40","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Shoham","year":"2004","unstructured":"Shoham, S., Grumberg, O.: Monotonic Abstraction-Refinement for CTL. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 546\u2013560. Springer, Heidelberg (2004)"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Shoham, S., Grumberg, O.: 3-Valued Abstraction: More Precision at Less Cost. In: LICS, pp. 399\u2013410 (2006)","DOI":"10.1109\/LICS.2006.5"},{"key":"28_CR21","unstructured":"Somenzi, F.: CUDD: CU Decision Diagram Package Release (2001)"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-93900-9_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T05:19:49Z","timestamp":1738819189000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-93900-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540938996","9783540939009"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-93900-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}