{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:48:03Z","timestamp":1754488083905,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405245"},{"type":"electronic","value":"9783540450696"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45069-6_40","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T21:11:46Z","timestamp":1277241106000},"page":"433-445","source":"Crossref","is-referenced-by-count":29,"title":["To Store or Not to Store"],"prefix":"10.1007","author":[{"given":"Gerd","family":"Behrmann","sequence":"first","affiliation":[]},{"given":"Kim G.","family":"Larsen","sequence":"additional","affiliation":[]},{"given":"Radek","family":"Pel\u00e1nek","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"40_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.: Automata for Modelling Real-Time Systems. Theoretical Computer Science\u00a0126(2), 183\u2013236 (1994)","journal-title":"Theoretical Computer Science"},{"key":"40_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/3-540-36577-X_18","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G. Behrmann","year":"2003","unstructured":"Behrmann, G., Bouyer, P., Fleury, E., Larsen, K.G.: Static guard analysis in timed automata verification. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol.\u00a02619, pp. 254\u2013270. Springer, Heidelberg (2003)"},{"key":"40_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/3-540-48683-6_30","volume-title":"Computer Aided Verification","author":"G. Behrmann","year":"1999","unstructured":"Behrmann, G., Larsen, K.G., Pearson, J., Weise, C., Yi, W.: Efficient Timed Reachability Analysis Using Clock Difference Diagrams. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol.\u00a01633, pp. 341\u2013353. Springer, Heidelberg (1999)"},{"key":"40_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BFb0055643","volume-title":"CONCUR \u201998 Concurrency Theory","author":"J. Bengtsson","year":"1998","unstructured":"Bengtsson, J., Jonsson, B., Lilius, J., Yi, W.: Partial order reductions for timed systems. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 485\u2013500. Springer, Heidelberg (1998)"},{"key":"40_CR5","unstructured":"Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic Model Checking: 1020 states and beyond. In: Proc. of IEEE Symp. on Logic in Computer Science (1990)"},{"issue":"3","key":"40_CR6","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF01384077","volume":"7","author":"P. Godefroid","year":"1995","unstructured":"Godefroid, P., Holzmann, G.J., Pirottin, D.: State-space caching revisited. Formal Methods in System Design\u00a07(3), 227\u2013241 (1995)","journal-title":"Formal Methods in System Design"},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"Godefroid, P., Wolper, P.: A Partial Approach to Model Checking. In: Proc. Of IEEE Symp. on Logic in Computer Science, pp. 406\u2013415 (1991)","DOI":"10.1109\/LICS.1991.151664"},{"key":"40_CR8","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Redcibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"40_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BFb0054182","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R. Kurshan","year":"1998","unstructured":"Kurshan, R., Levin, V., Minea, M., Peled, D., Yenig\u00fcn, H.: Static partial order reduction. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol.\u00a01384, pp. 345\u2013357. Springer, Heidelberg (1998)"},{"key":"40_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR \u201995 Concurrency Theory","author":"F. Laroussinie","year":"1995","unstructured":"Laroussinie, F., Larsen, K.G.: Compositional Model Checking of Real Time Systems. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962. Springer, Heidelberg (1995)"},{"key":"40_CR11","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/REAL.1997.641265","volume-title":"Proc. of the 18th IEEE Real-Time Systems Symposium","author":"F. Larsson","year":"1997","unstructured":"Larsson, F., Larsen, K.G., Pettersson, P., Yi, W.: Efficient Verification of Real- Time Systems: Compact Data Structures and State-Space Reduction. In: Proc. of the 18th IEEE Real-Time Systems Symposium, pp. 14\u201324. IEEE Computer Society Press, Los Alamitos (1997)"},{"key":"40_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BFb0054173","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J. Lind-Nielsen","year":"1998","unstructured":"Lind-Nielsen, J., Reif Andersen, H., Behrmann, G., Hulgaard, H., Kristoffersen, K., Larsen, K.G.: Verification of Large State\/Event Systems Using Compositionality and Dependency Analysis. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol.\u00a01384, pp. 201\u2013216. Springer, Heidelberg (1998)"},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"Valmari, A.: A Stubborn Attack on State Explosion. Theoretical Computer Science\u00a03 (1990)","DOI":"10.1090\/dimacs\/003\/04"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45069-6_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T04:59:53Z","timestamp":1740200393000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45069-6_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405245","9783540450696"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45069-6_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}