Fritz_frederix
Member
Hello,
I've only red your privat message today, sorry for that. I also see that Paul has helped you out. There is still one thing that I would like to mention.
I think your program is written in a way I normaly use. I think it's a step program, in one PB or FB your initional program is written.
Something like this:
If condition X is true then set step 1 (FY x1), If step 1 is "1" and the next conditions are true then reset step 1 (FY x1) and set step 2 (FY x2) and so on.
After this you've got one (or several) FB were you handle your outputs.
I'll try to explain in a small program.
FB 50 (in ladder)
I0.0 I0.1 F 0.0
I---II---II----------------(S)---I Step 1
F0.0 I0.2 F 0.1
I---II---II----------------(S)---I Step 2
I
I F 0.0
I----(R)---I
F0.1 I0.3 F 0.2
I---II---II----------------(S)---I Step 2
I
I F 0.1
I----(R)---I
In AWL
: A I 0.0
: A I 0.1
: S F 0.0
: ***
: A F 0.0
: A I 0.2
: S F 0.1
: R F 0.0
: ***
: A F 0.1
: A I 0.2
: S F 0.2
: R F 0.1
: ***
And now in the output FB (let's say FB51)
FB51
: L KF +1
: L FY 0
: >< F
: JC dummy1
: = Q 0.0
dummy1 : ***
Now you see that output Q 0.0 is "1" only in step 1, This is a good way of programming step programs because your outputs are handled in ONLY ONE FB. If your programs stop you only need to look in your FY to see what was the last active step. So you can find quickly which condition is missing.
I hope this has helped you in understanding a little bit of S5 FB's.
Rudi
I've only red your privat message today, sorry for that. I also see that Paul has helped you out. There is still one thing that I would like to mention.
I think your program is written in a way I normaly use. I think it's a step program, in one PB or FB your initional program is written.
Something like this:
If condition X is true then set step 1 (FY x1), If step 1 is "1" and the next conditions are true then reset step 1 (FY x1) and set step 2 (FY x2) and so on.
After this you've got one (or several) FB were you handle your outputs.
I'll try to explain in a small program.
FB 50 (in ladder)
I0.0 I0.1 F 0.0
I---II---II----------------(S)---I Step 1
F0.0 I0.2 F 0.1
I---II---II----------------(S)---I Step 2
I
I F 0.0
I----(R)---I
F0.1 I0.3 F 0.2
I---II---II----------------(S)---I Step 2
I
I F 0.1
I----(R)---I
In AWL
: A I 0.0
: A I 0.1
: S F 0.0
: ***
: A F 0.0
: A I 0.2
: S F 0.1
: R F 0.0
: ***
: A F 0.1
: A I 0.2
: S F 0.2
: R F 0.1
: ***
And now in the output FB (let's say FB51)
FB51
: L KF +1
: L FY 0
: >< F
: JC dummy1
: = Q 0.0
dummy1 : ***
Now you see that output Q 0.0 is "1" only in step 1, This is a good way of programming step programs because your outputs are handled in ONLY ONE FB. If your programs stop you only need to look in your FY to see what was the last active step. So you can find quickly which condition is missing.
I hope this has helped you in understanding a little bit of S5 FB's.
Rudi