Lyee Structure The Institute of Computer Based Software Methodology - PowerPoint PPT Presentation

Lyee Structure The Institute of Computer Based Software Methodology and Technology Top

Tense Control Function ( Φ ) Pre Processing Initial Processing (Lyee domains) Is the next Φ p specified? Activated Φ p → Next Φ p Current Φ p → Previous Φ p, Next Φ p → Current Φ p, Clear next Φ p. Activate current Φ p. End? End Post processing Is next Φ -domain empty? To next Φ ( 2) Tense Control Function ( Φ )

����������������������� ��������������� Pallet Function ( Φ 4 ) Initial processing (System evvironment) Initial processing (Work domain etc.) State transition (current) → State transition, Status control action Initialize State transition (current). call Signification vector Look call Output vector call Structural vector call Routing vector The execution-right Is there any state transition? is returned to Φ ( 3) Pallet Function ( Φ 4)

����������������������� ��������������� Pallet Function ( Φ 2 ) Initial processing (System evvironment) Initial processing (Work domain etc.) State transition (current) → State transition, Status control action Initialize State transition (current). call Signification vector Look call Iutput vector call Routing vector The execution-right Is there any state transition? is returned to Φ ( 4) Pallet Function ( Φ 2)

��������������� ����������������������� Pallet Function ( Φ 3 ) Initial processing (System environment) Initial processing (Work domain etc.) State transition (current) → State transition, Status control action Initialize State transition (current). call Signification vector Rr call Routing vector (Recursive link) Rd Look call Routing vector (Duplex link) Rm Rc call Routing vector (Multiplex link) call Routing vector (Continuous link) The execution-right Is there any state transition? is returned to Φ ( 5) Pallet Function ( Φ 3)

�� ��� ��� �� ��� �� Signification Vectors ( Signification vector / L4 ) <Predicate structure> L4,j Signification vector The 1 st rule W02 : Probabilistic W03 : Normalization W04 : Representative The 2 nd rule Is the 4th domain empty and is a self condition equal The 3 rd rule The 5 th rule to a value in the 4th domain of W03 of the same noun? The 4 th rule The 6 th rule The 7 th rule Arithmetic calculus or value duplicated → The 2nd domain. Is the 2nd domain Is there any state transition empty? of the Pallet? Yes Yes No No The 2nd domain → The 4th domain, Falsehood flag Re-execution flag The 4th domain → Boundary domain, → The 6th domain. → The 7th domain. State transition (current) to be set as value. ( 6) Signification vector(L4)

�� ��� ��� �� ��� �� Signification Vectors ( Signification vector / L2) <Predicate structure> L2, i Signification vector The 1 st rule W02 : Probabilistic W03 : Normalization W04 : Representative The 2 nd rule The 3 rd rule The 5 th rule Is the 4th domain empty? The 4 th rule The 6 th rule The 7 th rule Logical definition → The 2nd domain. (Inprovement of the attribute) Is there any state transition Is the 2nd domain of the Pallet? empty? Yes Yes No No The 2nd domain → The 4th domain, Falsehood flag Re-execution flag The 4th domain → Boundary domain, → The 6th domain. → The 7th domain. State transition (current) to be set as value. ( 7) Signification vector(L2)

�� ��� �� ��� �� ��� Signification Vectors ( Signification vector / L3 ) <Predicate structure> L3,j Signification vector The 1 st rule W02 : Probabilistic W03 : Normalization W04 : Representative The 2 nd rule The 3 rd rule The 5 th rule Is the 4th domain empty? The 4 th rule The 6 th rule The 7 th rule Necessary condition of the materialization of (L4,j) → The 2nd domain. Is the 2nd domain Is there any state transition empty? of the Pallet? Yes Yes No No Falsehood flag Re-execution flag The 2nd domain → The 4th domain, → The 6th domain. → The 7th domain. State transition (current) to be set as value. ( 8) Signification vector(L3)

�� ��� �� ��� �� ��� Action Vectors ( Input action vector / I2 ) <Predicate structure> I2,r? Input vector The 1 st rule W02 : Probabilistic W03 : Normalization W04 : Representative The 2 nd rule The 3 rd rule The 5 th rule (Not used) The 4 th rule The 6 th rule The 7 th rule Execute an input command such as READ. Is the 2nd domain (Not used) empty? Normal flag → The 4th domain. Falsehood flag Re-execution flag → The 6th domain. → The 7th domain. Processing corresponding ( 9) to system environment. Input vector(I2)

�� ��� ��� �� ��� �� Action Vectors ( Output action vector / O4 ) <Predicate structure> O4,r? Output vector The 1 st rule W02 : Probabilistic W03 : Normalization W04 : Representative The 2 nd rule Is there any atate transition in the synchronous range, or is one of the nouns of Key information empty? The 3 rd rule The 5 th rule Yes The 4 th rule The 6 th rule The 7 th rule No Execute an output command such as WRITE. Is the result of executing the output (Not used) command valid? Normal flag → The 4th domain, Falsehood flag Re-execution flag Initialize output memory domain. → The 6th domain. → The 7th domain. Processing corresponding ( 10) to system environment. Output vector(O4)

�� ��� �� ��� ��� �� Action Vectors ( Structural vector / S4 ) <Predicate structure> S4,r? Structural vector The 1 st rule W02 : Probabilistic W03 : Normalization W04 : Representative The 2 nd rule Is the output successful? The 3 rd rule The 5 th rule (The normal flag is on) The 4 th rule The 6 th rule The 7 th rule Initialize corresponding domains. (Not used) (Not used) (Not used) (Not used) (Not used) ( 11) Structural vector(S4)

��� ��� �� �� ��� �� Action Vectors ( Routing vector / R4 ) <Predicate structure> R4 Routing vector The 1 st rule W02 : Probabilistic W03 : Normalization W04 : Representative The 2 nd rule Is there any state transition of The 3 rd rule The 5 th rule the W04 to which the R4 belongs? Yes The 4 th rule The 6 th rule The 7 th rule No (Not used) (Not used) (Not used) W02 of the same SF (Not used) (Not used) → Next Φ p. ( 12) Routing vector(R4)

��� ��� �� �� ��� �� Action Vectors ( Routing vector / R2 ) <Predicate structure> R2 Routing vector The 1 st rule W02 : Probabilistic W03 : Normalization W04 : Representative The 2 nd rule Is there any state transition of The 3 rd rule The 5 th rule the W02 to which the R2 belongs? Yes The 4 th rule The 6 th rule The 7 th rule No (Not used) (Not used) (Not used) W03 of the same SF (Not used) (Not used) → Next ? p. ( 13) Routing vector(R2)

�� ��� �� ��� ��� �� Action Vectors ( Routing vector / R3r ) <Predicate structure> R3r Routing vector (Recursive link) The 1 st rule W02 : Probabilistic W03 : Normalization W04 : Representative The 2 nd rule Is there any state transition of the Pallet, or dose the state show the result of the duplex link, The 3 rd rule The 5 th rule or is the state in a synchronous destruction? The 4 th rule The 6 th rule The 7 th rule (Not used) (Not used) (Not used) W04 of the same SF (Not used) (Not used) → Next Φ p. ( 14) Routing vector(R3r)

�� �� ��� �� ��� ��� Action Vectors ( Routing vector / R3d ) <Predicate structure> R3d Routing vector (Duplex link) The 1 st rule W02 : Probabilistic W03 : Normalization W04 : Representative The 2 nd rule Is the SF in abeyance The 3 rd rule The 5 th rule and is duplex link specified? The 4 th rule The 6 th rule The 7 th rule (Not used) (Not used) (Not used) W03 of the returned SF (Not used) (Not used) → Next Φ p. ( 15) Routing vector(R3d)

�� �� ��� �� ��� ��� Action Vectors ( Routing vector / R3m ) <Predicate structure> R3m Routing vector (Multiplex link) The 1 st rule W02 : Probabilistic W03 : Normalization W04 : Representative The 2 nd rule Is the SF in abeyance The 3 rd rule The 5 th rule and is multiplex link specified? The 4 th rule The 6 th rule The 7 th rule (Not used) (Not used) (Not used) W04 of the forehand SF (Not used) (Not used) → Next Φ p. ( 16) Routing vector(R3m)

��� �� ��� �� ��� �� Action Vectors ( Routing vector / R3c ) <Predicate structure> R3c Routing vector (Continuous link) The 1 st rule W02 : Probabilistic W03 : Normalization W04 : Representative The 2 nd rule The 3 rd rule The 5 th rule is continuous link specified? The 4 th rule The 6 th rule The 7 th rule (Not used) (Not used) (Not used) W04 of the continuous SF (Not used) (Not used) → Next Φ p. ( 17) Routing vect or(R3c)

Rm Rr Rc.a Rd Rc.c There is no state change then we go to the other PRD.