{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T15:29:00Z","timestamp":1694618940056},"reference-count":12,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2000,12,1]],"date-time":"2000-12-01T00:00:00Z","timestamp":975628800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[2000,12]]},"abstract":"<jats:title>Abstract.<\/jats:title>\n          <jats:p>\n            Some conditions relating to the automata involved in the W-testing method are discussed. It is also shown how to use the method for\n            <jats:italic>reduced automata<\/jats:italic>\n            instead of minimal automata. New design test conditions (\n            <jats:italic>weak output distinguishable<\/jats:italic>\n            ,\n            <jats:italic>strong test-complete and output delimited type<\/jats:italic>\n            ) are considered for the\n            <jats:italic>generalised stream X-machines<\/jats:italic>\n            (stream X-machines with basic functions replaced by relations and having as output strings of symbols rather than single symbols). It is proved that testing methods similar to those already developed for ordinary deterministic stream X-machines may be applied for generalised stream X-machines with output delimited types. A particular case of generalised stream X-machine with output delimited type is the X-machine with\n            <jats:italic>output delimiter<\/jats:italic>\n            , which produces outputs having a distinct right end character.\n          <\/jats:p>","DOI":"10.1007\/s001650070006","type":"journal-article","created":{"date-parts":[[2002,10,6]],"date-time":"2002-10-06T15:18:47Z","timestamp":1033917527000},"page":"473-484","source":"Crossref","is-referenced-by-count":6,"title":["Generalised Stream X-Machines with Output Delimited Type"],"prefix":"10.1145","volume":"12","author":[{"given":"Tudor","family":"B\u0103l\u0103nescu","sequence":"first","affiliation":[{"name":"Faculty of Sciences, Pite\u015fti University, Romania, , , , , , RO"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"p_1","volume-title":"Informatica","author":"Blnescu T.","year":"1999"},{"issue":"3","key":"p_2","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1109\/TSE.1978.231496","article-title":"Testing software design modeled by finite-state machines","volume":"4","author":"Cho","year":"1978","journal-title":"IEEE Transactions on Software Engineering"},{"key":"p_3","volume-title":"Automata, Languages and Machines","author":"Eil","year":"1974"},{"key":"p_4","volume-title":"F., Amalou, M. and Ghedamsi","author":"Fujiwara S.","year":"1990"},{"key":"p_5","volume-title":"Departement d\u2019informatique et de recherche operationnelle","author":"Fu","year":"1991"},{"key":"p_6","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1049\/sej.1988.0009","article-title":"X-machines as a basis for dynamic system specification","volume":"3","author":"Hol","year":"1988","journal-title":"Software Engineering Journal"},{"key":"p_7","volume-title":"Correct Systems: Building a Business Process Solution","author":"Ho","year":"1998"},{"key":"p_8","first-page":"130","article-title":"On testing generalized stream X-machines. In G. Pun, editor","author":"Holcombe M.","year":"2000","journal-title":"Recent Topics in Mathematical and Computational Linguistics. Editura Academiei Romane"},{"key":"p_9","volume-title":"Formal Languages and their Relation to Automata","author":"Ho","year":"1969"},{"key":"p_10","first-page":"359","article-title":"Another look at computability","volume":"20","author":"Ip","year":"1996","journal-title":"Informatica"},{"key":"p_11","first-page":"159","article-title":"An Integration Testing Method That is Proved to Find all Faults","volume":"69","author":"Ip","year":"1997","journal-title":"International Journal of Computer Mathematics"},{"key":"p_12","volume-title":"Generating test sequences from non-deterministic X-machines. Unpublished manuscript","author":"Ip","year":"1999"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s001650070006.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s001650070006\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/s001650070006","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T15:34:44Z","timestamp":1641483284000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/s001650070006"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,12]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2000,12]]}},"alternative-id":["10.1007\/s001650070006"],"URL":"https:\/\/doi.org\/10.1007\/s001650070006","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,12]]}}}