Документ взят из кэша поисковой машины. Адрес оригинального документа : http://www.mce.biophys.msu.ru/archive/doc32048/eng.pdf Дата изменения: Mon Oct 1 22:03:15 2012 Дата индексирования: Mon Oct 1 22:03:15 2012 Кодировка:

CONVERSION OF IDEF0 MODELS INTO UML-DIAGRAMS: THE FORMALIZED STATEMENT OF THE PROBLEM Khubaev G.N., Shirobokova S.N.1, Titarenko E.V.1, Tkachenko Y.V.
1

Rostov's State Economic University "RINKH", Russia, 344002, Rostov-on-Don, st. B. Sadovaya, 69, tel.:8(863)-237-02-71, E-mail: gnh@donpac.ru; 1 South-Russian State Technical University (Novocherkassk Polytechnic Institute), Russia, 346428, Rostov region, Novocherkassk, st.Prosvyasheniya 132, tel.(fax): 8(863 52) 5-52-40, E-mail: Shirobokova_SN@mail.ru, little-sun-L@yandex.ru, tamias@narod.ru Putted forward the conceptual position about possibility of creation and applied usability of the computer-aided converter of IDEF0-diagrams into UML-diagrams, and offered it's general algorithm. Model of IDEF0 standard can be presented as: BP IDEF 0 = < Q, L, DC , DDm > , where Q ­ number of diagrams in the model; L ­ number of decomposition levels; DC ­ context diagram; DD m , m = 2, Q ­ the detailed diagrams. Converting conv A A is possible to present, as: DDm dm , where d m ­ UML activity diagram (described in [1]). Context diagram of the model can be presented as: DC = < b, qar , AR DC > , where b ­ block of the general business-process function; AR DC = {arkDC } , k = 1, qar ­ set of arrows, which are connected with the block b . Set of detailed diagrams can be represent as: D D D where DDm = < namem , d m , qbm , Bm D , qarm , ARm D , qmechm , MECH m D , POZ m ,WAY m, LOOPm , LOBRm > , m = 2, Q , DD m name m ­ name of the diagram; d m ­ level of decomposition; Bm = {bt } , t = 1, qb m ­ set of D D m m D blocks; AR m D = {arkm } , k = 1, qarm ­ set of arrows; MECH m D = {mechh }, mechh ARm D , h = 1, qmechm ­ set of mechanism arrows; POZ m ­ matrix of interconnection among blocks and arrows; WAYm ­ matrix of possible workflows; LOOPm ­ matrix of looped workflows; LOBR m ­ array of returnarrows. Every block is presented as: btn = < nametn , st tn > , n = 1, Q , where nametn ­ name of the block st tn ­ link to the diagram, which presents this block details. Arrow is presented as n n n n n n n n n arkn = < name k , sc k , scn k , scf kn , scd k , sk k , skn k , skf kn , skd k > , n = 1, Q , where name k ­ name of the arrow; sc k ­ type of arrow (external, internal); scn kn ­ number of left block (for internal); scf kn ­ arrow leaving function; scd kn ­ number, one after another, of arrow leaving block scn kn ; sk kn ­ arrow enter type; skn kn ­ number of block in which arrow enters (for internal); skf kn ­ arrow enter function (input, mechanism, control); skd kn ­ number, one after another, of arrow entering block skn kn . Literature 1. .., .., .. // . - . , 4, 2008. .73-79.