004.4:004.7
. .

. . . .
: , , - , , .
Abstract. The article suggests a comprehensive methodology for designing devices and systems of complex distributed discrete processes logic control with parallel execution of operations. In the course of design the author puts an emphasis on the formal description of processes and their properties based on the concept of process coordination through space-structured memory. The article provides recommendations for distributed control systems implementation in hardware and software.
Key words: logical control, discrete processes, asynchronous predicative-functional networks, formal models, distributed computer systems.

- () () . , , - () (). , , . , , , . . . [1-3] ( ),
. . [4-6] ( ), [7, 8]. ( ) , - [9-11]. -
(), [12, 13].
. , -, [1-3]. , . [14], .
( ), , . .
1. -

, . , . , , , . ()(), - , - . . .
, . . . , .
, , . , -
, , . , - . , , , .
, , . , . , , - .
2.
, ( ), . - . , , ^ 2, 1 3. , , , , - , .
1. 1: , , 2 , 3 , ! 2 . » , , . :
^(^(, 1) & (2(2), 2) & (?(3), 0)]
({1(1) ^ 1- 3(3) ^ 1} V
^ ; ^ - » »; - ; - -
( ) [12, 13].
2. 2: f1 , f2 - , f3 , f1 , f2 , f3 . :
2: [fge(fi(ai), 1) & fge(f2(a2), 2) & feq^fo), 0)]({f;(a3) ^ fplus(fs(a3), 1),
f1(a1) ^ fminus(f1 (a1), 1), f2(a2) ^ 0} V RE),
fplus - .
3. 3: fi , f2 - , f3 - , f1 , f2 , . - :
3: [fge(f1(a0, 2) & fge(f2(a2), 4) & f^fs^), 5)]({(f,(a3) ^ fplus(fs(a3),
fplus(f1(a1), f2(a2))); (f1(a1) ^ fmlnus(f1(a1), 1), f2(a2) ^ 0} V RE),
fie - ».
, , . , , , , , , [12, 13]. c1, c2 c3 a1, a2 a3 , - . . c1, c2 c3 , .
3. -
- », FIFO (First In - First Out). M1 - :
m^ [p1(a0 & -^foXKtpKaO) ^ false, p2(a2) ^ true} v RE);
m2: [p2(a2) & -p3(a3)]({p2(a2)) ^ false, p3fe) ^ true} v RE);
mi: [pi(ai) & pi+1 (ai+1)]({pi(ai)) ^ false, p^a^) ^ true} v RE);
mn_1: [p n_1(a n-1) & -pn(an)]({p n-1(an-1)) ^ false, pn(an) ^ true} v RE),
p1, p2, ..., pn n ( pn , », ), , , , . p1, p2, ..., pn a1, a2, ..., a » . , , . , pi ai. , p, {a1, a2, ., an}. M2, FIFO, :
mV [p(a^ & p(a2)]({p(a1)) ^ false, p(a2) ^ true} v RE);
m^: [p(a2) & -p(a3)]({p(a2)) ^ false, p(a3) ^ true} v RE);
m'i: [p(ai) & p(ai+1)]({p(ai)) ^ false, p(ai+0 ^ true} v RE);
m'n_1: [p(an_1) & -p(an)]({p(an_1)) ^ false, p(an) ^ true} v RE).
a1, a2, ..., an . .
4.
INT ZxZ, Z - . -, . , INT(zi, zj ^ true ( zi zj), - INT(zi, zj) ^ false. INT . ISINT ZxZ, ISINT(zi, zj) ^ true ISINT(zi, zj) ^ false. , , , ISINT . ISINT(zi, zj),
, , z_j zi.
5.
- . P - , R - , RR RU -
RR: PxR ^ {true, false}, RU: RxP ^ {true, false},
RR(pi, rj) , pi rj, RU(rj, pi) , rj pi.
:
PA: P ^ {true, false}, RB: R ^ {true, false},
.
PA(pi) pi, RB(ri) , ri - .
, p1 r1 r2. Mr :
Mr: [PA(p1) & -RB(rO & -RB(r2) & RR(p1, r1) & RR(pb r2)]
({RB(r1) ^ true, RB(r2) ^ true, RU(r1, p1) ^ true, RU(r2, p1) ^ true,
RR(p1, r1) ^ false, RR(p1, r2) ^ false} v RE).
6.
. , , ; , , . , . , .
() N () :
N = (P, R, A, M, I0),
P - , () ; R - -
() ; - (), ; - () , ; 10 = 1(^) - , 1:0 > 0. - [](^2) [^^^), , - () . ; .
, , , , . , , () . : () , . - () N1, , :
- :
1: [( & (4)](((1)^1, ^-, ^^, ^-^^); 2: [(2) & ()]({(2)^1, (3)^1, ^^, ^^^^); 3: [(3)]({(3)^1, ^^^15);
- :
1: [(1) & (4)]({(1)^1, (2)^1, ()^1, ^^^^); 2: [(2) & ()]({(2)^1, ^^, ^^, ^^^^^); 3: [(3)]({(3)^1, ^^^^);
- :
1: [(1) & (3)]({(1)^1, (2)^, ^^^, ^-^^); 2: [(2) & -1 (1)&()]({(2)^1, (3)^,
^-, ^^^15);
3: [(3)]({(3)^1, -^15);
- :
[pD(dl) & (3)]({(1)^1, ^-, 0)^1, ^-^^); 2: [) & - (1) & ^)]({)^1, ^-, ^-, ^^^15);
3: [)]({)^1, ^-^^);
- E:
El: ^( & ^^^^, pE(e2)^tme, ^^, pY(ye)^tue}vE);
E2: [pE(e2) & - & ^^^, pE(e)^tue, ^-, ^^^^15);
E: ^(^^^^, pE(el)^tue}vE);
- , :
[(1) & -'^^, -^^);
2: [(2) & -^^^, ^^^;
: [(1) & ^&^^, ^^,
()^, ^-^^;
4: [(5)]({(-;, -, ()-, ^^^^15).
, , , , pE - , ; pY - , ; , . . . () .
, . , ( ), : , , , , E. - () '1, , :
- :
\: [( & ^^^^, ^-, ^^^, pY(ya)^tue}vE); '2: [ & ^^^^, ()^, ^-, ^^^^15);
': ^(^^^, ^-^15);
- :
\: [-(1) & () & ^^^, ^-, ^ pY(yb)^tue}vE);
'2: [(2) & ^^^, ()-, ^-, ^^^^);
': [()]({()^^, -^15);
- :
'1: [-(1) & -() & (1) & ^^^, (2)^,
()^8, ()^1});
[(2) & -1 () & ()]({(2)^8, (0)^1, ()^, ^^^15);
': [()]({()^8, ()^});
- :
[() & (1) & (1) & () & ()]({()^18,
(^2)^ , ()^8, ()^1});
'2: [(^2) & () & (2) & ()]({(<2)^8, pD(d)^tue, ()^, ^^^^15);
': [pD(d)]({pD(d)^fa1se, pD(dl)^tue}vE);
- :
': [() & () & () & D(dl) & () & ()] ({()^, pE(e2)^tue, pR()^fa1se, pY(ye)^tue}vE);
'2: [(2) & R(l) & (2) & D(d2) & ()]({(2)^^,
()^ tue, ()-, ^^^^5);
': ^(^^^, pE(el)^tue}vE);
- , R:
- [pR(l) & pR(2)]({pR(l)^fa1se, pR(2)^tue}vE);
[R(2) & pR()]({pR(2)^fa1se, pR()^tue}vE);
R': [pR(l) & pR(2) & pR()]({pR(l)^fa1se, pR(2)^fa1se, R()^fa1se, pR(4)^tue}vE);
- ^(5)](^()^, pR(2)^tue, pR()^tue, pR(5)^fa1se}vE).
- .
- [15] . , 1(, ) (, ), ( ); , .
- ():
= (, , , , , , , 1),
F - () , () P () ; B - () ; - () ; I0 = I(to) - , t0>0. N. Q . - , -, .
. 2, , , . 3 - . , , , , . , -.
- [15], IMP(x, ) POT(x, ) . [16].
Ni/o :
N i/o = (P, px, py, R, A, M, I0),
pxe P - ; pYe P - .
:
Qi/o = (P, px, py, F, fx, fy, B, C, R, A, M, I0),
pxe P, pYe P - ; fxe F, fYe F - .
.
7. »
- N1 N'1 , , .
. 1 , N1. . 1, 19 A1, A2, A3, B1, B2, B3, C1, C2, C3, D1, D2, D3, E1, E2, E3, R1, R2, R3 R4 ( -
N0 , , , , , , , PE .
)
)
)
. 1.
»; - . . 1,. , , , , , E ,
. , , , . (. 1,) , A, B, C, D, E R pA, pB, pC, pD, pE pR , .

, . .

1. Gurevich, Y. On Kolmogorov machines and related issues. The logic in computers science column / Y. Gurevich // Bulletin of Europian Assoc. for Theor. Comp. Science. -1998. - 35. - . 71-82.
2. Gurevich, Y. Evolving algebras - a tutorial introduction / Y. Gurevich // Bulletin of the EATS. - 1991. - V. 43. - . 264-284.
3. Dexter, S. Gurevich abstract state machines and Shonhage storage modification machines / S. Dexter, P. Doyle, Y. Gurevich // Journal of Universal Comp. Science. -1997. - V. 3, 4. - . 279-303.
4. , . . . . / . . , . . , . . . - : , 1978. - 320 .
5. , . . / . . , . . , . . . - : , 1980. - 252 .
6. , . . / . . , . . . - . : , 1988. - 296 .
7. : 3- . . 3. : / . . . , . . . - . : , 1990. - 368 .
8. / . . , . . - . : , 1989. - 220 .
9. , . . / . . // , , : ix - . - : , 2009. - . 57-60.
10. , . . - - / . . // , , : Ix - . - : , 2009. -. 60-65.
11. , . . - / . . //
: -
. - . 9. - : - . . . ., 2009. -
. 155-160.
12. , . . ( ) / . . // . . . - 2007. - 3. - . 13-22.
13. , . . ( ) / . . // . . . - 2007. - 4. - . 37-50.
14. , . . / . . . - . : , 1984. - 160 .
15. , . . 61499 / . . , . . // . . . -2008. - 4. - . 16-26.
16. , . . / . . , . . // . . - 2009. - . 4. - . 54-63.

,
E-mail: vt@alice.pnzgu.ru
Zinkina Nadezhda Sergeevna Postgraduate student,
Penza State University
004.4:004.7 , . .
/ . . // . . . - 2011. - 1 (17). - . 5-47.