{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T05:53:29Z","timestamp":1698213209350},"reference-count":8,"publisher":"Wiley","issue":"6","license":[{"start":{"date-parts":[[2007,3,21]],"date-time":"2007-03-21T00:00:00Z","timestamp":1174435200000},"content-version":"vor","delay-in-days":4827,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems &amp;amp; Computers in Japan"],"published-print":{"date-parts":[[1994,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Various methods of generating dataflow diagrams use an algebraic transformation system for a given input\u2010output relationship. These methods require mutual transformations between the input\u2010output relationship and algebraic expressions, and also a consistency check between the generated dataflow diagram and input\u2010output relationship. This paper proposes a deterministic algorithm that uniquely generates a unique dataflow diagram with a minimal number of processes from a given input\u2010output relationship.<\/jats:p>","DOI":"10.1002\/scj.4690250602","type":"journal-article","created":{"date-parts":[[2007,7,8]],"date-time":"2007-07-08T02:50:15Z","timestamp":1183863015000},"page":"12-22","source":"Crossref","is-referenced-by-count":0,"title":["An algorithm for generating dataflow diagrams"],"prefix":"10.1002","volume":"25","author":[{"given":"Shuichiro","family":"Yamamoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenji","family":"Ohta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2007,3,21]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Structured Analysis and System Specification","author":"DeMarco T.","year":"1978"},{"key":"e_1_2_1_3_2","volume-title":"Structured System Analysis: Tools and Techniques","author":"Gane C.","year":"1979"},{"key":"e_1_2_1_4_2","volume-title":"Modern Structured Analysis","author":"Yourdon E.","year":"1989"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/32.4636"},{"key":"e_1_2_1_6_2","unstructured":"K.MatsumotoandS.Hon\u2010iden.On stepwise software construction and its verification. SIG\u2010FAI\u20109002 (1990)."},{"key":"e_1_2_1_7_2","first-page":"71","article-title":"A Process Decomposition Algebra for Stepwise Refinement of Data Flow Diagrams","volume":"91","author":"Suzuki H.","year":"1991","journal-title":"IPSJ, SIG Note"},{"key":"e_1_2_1_8_2","volume-title":"A Professional's Guide to System Analysis","author":"Modell M.","year":"1988"},{"issue":"11","key":"e_1_2_1_9_2","first-page":"1239","volume":"38","author":"Isoda S.","year":"1989","journal-title":"The SoftDA Software Development Support System. NTT R&D"}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690250602","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690250602","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T16:39:19Z","timestamp":1698165559000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690250602"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":8,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["10.1002\/scj.4690250602"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690250602","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"value":"0882-1666","type":"print"},{"value":"1520-684X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}