{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:27:04Z","timestamp":1742390824274},"reference-count":21,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s1389-1286(03)00250-0","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:54:49Z","timestamp":1052783689000},"page":"405-417","source":"Crossref","is-referenced-by-count":7,"title":["Generating test sequences from a set of MSCs"],"prefix":"10.1016","volume":"42","author":[{"given":"Nam Hee","family":"Lee","sequence":"first","affiliation":[]},{"given":"Sung Deok","family":"Cha","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1389-1286(03)00250-0_BIB1","unstructured":"ITU-T Recommendation Z.120, Message Sequence Chart (MSC), 2000"},{"key":"10.1016\/S1389-1286(03)00250-0_BIB2","unstructured":"ITU-T Recommendation Z.120, Annex B, Formal Semantics of Message Sequence Charts, 1998"},{"key":"10.1016\/S1389-1286(03)00250-0_BIB3","unstructured":"J. Grabowski, D. Hogrefe, R. Nahm, Test case generation with test purpose specification by MSCs, in: 6th SDL Forum, 1993, pp. 253\u2013266"},{"key":"10.1016\/S1389-1286(03)00250-0_BIB4","series-title":"IWTCS\u201998","first-page":"227","article-title":"Autolink\u2013\u2013putting SDL-based test generation into practice","author":"Schmitt","year":"1998"},{"issue":"3\u20134","key":"10.1016\/S1389-1286(03)00250-0_BIB5","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/S0140-3664(00)00229-2","article-title":"Rapid generation of functional tests using MSCs, SDL and TTCN","volume":"24","author":"Probert","year":"2001","journal-title":"Computer Communications"},{"key":"10.1016\/S1389-1286(03)00250-0_BIB6","unstructured":"ITU-T Recommendation Z.100, Specification and Description Language (SDL), 1999"},{"key":"10.1016\/S1389-1286(03)00250-0_BIB7","unstructured":"J. Grabowski, SDL and MSC based test case generation\u2013\u2013an overall view of the SAMSTAG method, Technical report, University of Berne, IAM-94-0005, 1994"},{"key":"10.1016\/S1389-1286(03)00250-0_BIB8","doi-asserted-by":"crossref","unstructured":"I.S. Chung, H.S. Kim, H.S. Bae, B.S. Lee, Testing of concurrent programs based on message sequence charts, in: International Symposium on Parallel and Distributed Software Engineering (PDSE\u201999), 1999","DOI":"10.1109\/PDSE.1999.779740"},{"key":"10.1016\/S1389-1286(03)00250-0_BIB9","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0167-6423(87)90035-9","article-title":"Statecharts: a visual formalism for complex systems","volume":"8","author":"Harel","year":"1987","journal-title":"Sciences of Computer Programming"},{"key":"10.1016\/S1389-1286(03)00250-0_BIB10","doi-asserted-by":"crossref","unstructured":"R. Alur, M. Yannakakis, Model checking of message sequence charts, in: Proceedings of the Tenth International Conference on Concurrency Theory, 1999, pp. 114\u2013129","DOI":"10.1007\/3-540-48320-9_10"},{"key":"10.1016\/S1389-1286(03)00250-0_BIB11","doi-asserted-by":"crossref","unstructured":"N.H. Lee, T.H. Kim, S.D. Cha, Construction of global finite state machine for testing task interactions written in message sequence charts, in: The Fourteenth International Conference on Software Engineering and Knowledge Engineering (SEKE\u201902), Ischia, Italy, 2002","DOI":"10.1145\/568760.568825"},{"issue":"5","key":"10.1016\/S1389-1286(03)00250-0_BIB12","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/BF01211629","article-title":"Interpreting message flow graphs","volume":"7","author":"Ladkin","year":"1995","journal-title":"Formal Aspects of Computing"},{"key":"10.1016\/S1389-1286(03)00250-0_BIB13","doi-asserted-by":"crossref","unstructured":"J. Klose, H. Wittke, An automata based interpretation of live sequence charts, in: TACAS2001, Lecture Notes in Computer Science, Vol. 2031, Springer, Berlin, 2001, pp. 512\u2013527","DOI":"10.1007\/3-540-45319-9_35"},{"issue":"2","key":"10.1016\/S1389-1286(03)00250-0_BIB14","first-page":"249","article-title":"Construction of global state transition graph for verifying specification written in message sequence charts for telecommunications software","volume":"E84-D","author":"Kim","year":"2001","journal-title":"IEICE Transactions on Information and Systems"},{"issue":"2","key":"10.1016\/S1389-1286(03)00250-0_BIB15","first-page":"70","article-title":"An analyzer for message sequence charts","volume":"17","author":"Alur","year":"1996","journal-title":"Software Concept and Tools"},{"issue":"8","key":"10.1016\/S1389-1286(03)00250-0_BIB16","doi-asserted-by":"crossref","first-page":"1090","DOI":"10.1109\/5.533956","article-title":"Principles and methods of testing finite state machines\u2013\u2013a survey","volume":"84","author":"Lee","year":"1996","journal-title":"Proceedings of the IEEE"},{"key":"10.1016\/S1389-1286(03)00250-0_BIB17","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1109\/32.265636","article-title":"Test selection based on communication nondeterministic finite-state machines using a generalized Wp-method","volume":"20","author":"Luo","year":"1994","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"4","key":"10.1016\/S1389-1286(03)00250-0_BIB18","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0169-7552(88)90064-5","article-title":"A protocol testing procedure","volume":"15","author":"Sabnani","year":"1988","journal-title":"Computer Networks and ISDN Systems"},{"key":"10.1016\/S1389-1286(03)00250-0_BIB19","unstructured":"S. Naito, M. Tsunoyama, Fault detection for sequential machines by transition-tours, in: FTCS (Fault Tolerant Computing Systems), 1981, pp. 238\u2013243"},{"key":"10.1016\/S1389-1286(03)00250-0_BIB20","unstructured":"ATSC T3\/S13 Doc. 010, Data Broadcast Specification, Technical report, ATSC, 1999"},{"key":"10.1016\/S1389-1286(03)00250-0_BIB21","unstructured":"ATSC Doc. A\/65, Program and System Information Protocol for Terrestrial Broadcast and Cable, Technical report, ATSC, 1997"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128603002500?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128603002500?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T19:52:20Z","timestamp":1553197940000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128603002500"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S1389128603002500"],"URL":"https:\/\/doi.org\/10.1016\/s1389-1286(03)00250-0","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}