{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:22:17Z","timestamp":1725567737896},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540232520"},{"type":"electronic","value":"9783540302322"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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":[[2004]]},"DOI":"10.1007\/978-3-540-30232-2_11","type":"book-chapter","created":{"date-parts":[[2010,10,24]],"date-time":"2010-10-24T15:56:19Z","timestamp":1287935779000},"page":"167-184","source":"Crossref","is-referenced-by-count":2,"title":["Connectivity Testing Through Model-Checking"],"prefix":"10.1007","author":[{"given":"Jens Chr.","family":"Godskesen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brian","family":"Nielsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arne","family":"Skou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"11_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":"11_CR2","doi-asserted-by":"crossref","unstructured":"Ammann, P., Black, P.E., Majurski, W.: Using model checking to generate tests from specifications. In: ICFEM, p. 46 (1998)","DOI":"10.6028\/NIST.IR.6166"},{"key":"11_CR3","unstructured":"Ammann, P., Ding, W., Xu, D.: Using a model checker to test safety properties"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-45319-9_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G. Behrmann","year":"2001","unstructured":"Behrmann, G., Fehnker, A., Hune, T., Larsen, K.G., Pettersson, P., Romijn, J.: Efficient Guiding Towards Cost-Optimality in UPPAAL. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol.\u00a02031, pp. 174\u2013188. Springer, Heidelberg (2001)"},{"key":"#cr-split#-11_CR5.1","unstructured":"Callahan, J., Schneider, F., Easterbrook, S.: Automated software testing using modelchecking. In: 1996 SPIN Workshop (August 1996);"},{"key":"#cr-split#-11_CR5.2","unstructured":"Also WVU Report NASAIVV-96-022"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0035401","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Engels","year":"1997","unstructured":"Engels, A., Feijs, L., Mauw, S.: Test generation for intelligent networks using model checking. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol.\u00a01217, Springer, Heidelberg (1997)"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Gargantini, A., Heitmeyer, C.L.: Using model checking to generate tests from requirements specifications. In: ESEC \/ SIGSOFT FSE, pp. 146\u2013162 (1999)","DOI":"10.1007\/3-540-48166-4_10"},{"key":"11_CR8","unstructured":"Godskesen, J.C.: Complexity issues in connectivity testing. In: Brinksma, E., Tretmans, J. (eds.) Proceedings of the Workshop on Formal Approaches to Testing of Software, FATES 2001, Aalborg, Denmark, August 25 (2001)"},{"key":"11_CR9","unstructured":"Hessel, A., Larsen, K.G., Nielsen, B., Pettersson, P., Skou, A.: Time-Optimal Test Cases for Real-Time Systems. In: 3rd Intl. Workshop on Formal Approaches to Testing of Software (FATES 2003), Montr\u00e9al, Qu\u00e9bec, Canada (October 2003)"},{"key":"11_CR10","unstructured":"Hong, H., Lee, I., Sokolsky, O., Cha, S.: Automatic test generation from statecharts using model checking. In: Brinksma, E., Tretmans, J. (eds.) Workshop on Formal Approaches to Testing of Software, FATES 2001, Aalborg, Denmark, August 25 (2001)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/3-540-46002-0_23","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"H.S. Hong","year":"2002","unstructured":"Hong, H.S., Lee, I., Sokolsky, O., Ural, H.: A Temporal Logic Based Theory of Test Coverage and Generation. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol.\u00a02280, pp. 327\u2013341. Springer, Heidelberg (2002)"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/3-540-44585-4_47","volume-title":"Computer Aided Verification","author":"K.G. Larsen","year":"2001","unstructured":"Larsen, K.G., Behrmann, G., Brinksma, E., Fehnker, A., Hune, T., Pettersson, P., Romijn, J.: As cheap as possible: Efficient cost-optimal reachability for priced timed automat. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 493\u2013505. Springer, Heidelberg (2001)"},{"issue":"1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/s100090050010","volume":"1","author":"K.G. Larsen","year":"1997","unstructured":"Larsen, K.G., Pettersson, P., Yi, W.: UppAal in a Nutshell. International Journal on Software Tools for Technology Transfer\u00a01(1), 134\u2013152 (1997)","journal-title":"International Journal on Software Tools for Technology Transfer"},{"key":"11_CR14","volume-title":"Concurrency: State Models and Java Programs","author":"Magee","year":"2002","unstructured":"Magee, Kramer: Concurrency: State Models and Java Programs. Wiley, Chichester (2002)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-540-24617-6_4","volume-title":"Formal Approaches to Software Testing","author":"M.P.E. Heimdahl","year":"2004","unstructured":"Heimdahl, M.P.E., Rayadurgam, S., Visser, W., Devaraj, G., Gao, J.: Auto-generating Test Sequences Using Model Checkers: A Case Study. In: Petrenko, A., Ulrich, A. (eds.) FATES 2003. LNCS, vol.\u00a02931, pp. 42\u201359. Springer, Heidelberg (2004)"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Springintveld, J.G., Vaandrager, F.W., D\u2019Argenio, P.R.: Testing timed automata. Theoretical Computer Science\u00a0254(1-2) (March 2001)","DOI":"10.1016\/S0304-3975(99)00134-6"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Networked and Distributed Systems \u2013 FORTE 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30232-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T20:33:22Z","timestamp":1553200402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30232-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232520","9783540302322"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30232-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}