!

Link To Us




 
kylpytynnyrin
 
översättningstjänster
 
markkinointi

FFXI Haven - #1.


 

 

 


The first technique that will be described is state equations. These equations contain three main parts, as shown below in Figure 12.19. To describe them simply -a state will be on if it is already on, or if it has been turned on by a transition from another state, but it will be turned off if there was a transition to another state. An equation is required for each state in the state diagram.

plc states -12.17

Informally,

State X = (State X + just arrived from another state) and has not left for another state

Formally,

nm

??

??

STATEi = STATEi + ? (TjiSTATEj)?(,STATEi)

,Tik

??

??

j =1 k =1

where, STATEi = A variable that will reflect if state i is on

n = the number of transitions to state i

m = the number of transitions out of state i

= The logical condition of a transition from state j to i

Tji

,

= The logical condition of a transition out of state i to k

Tik

,

Figure 12.19 State Equations

The state equation method can be applied to the traffic light example in Figure

12.8. The first step in the process is to define variable names (or PLC memory locations) to keep track of which states are on or off. Next, the state diagram is examined, one state at a time. The first equation if for ST1, or state 1 -green NS.

BACK | NEXT

Easy Access To All Pages

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126







sivut



 

 

 

 

Automation

 

Part I

Part II

Part III

Part IV

Part V

 

Foods Overview


Hunting

 

Symbols

 

Part I

Part II

Part III

Part IV

 

 

 
Copyright @ FFXI Haven, 2004-2005.