Nerdlinger
Stainless
- Joined
- Aug 10, 2013
- Location
- Chicago, IL
Hello! Please see the attached exercise attempting to show a technique for describing a finite state machine with two states (on and off) controlled by two switches (S1 and S2), using that graphical depiction to generate a boolean expression for the conditions resulting in those two states, and finally converting/translating that boolean expression to a ladder diagram.
At first glance it looks like I did it right, but something is missing in the final translation because in this example if we are already in the "OFF" state and attempt to transition to the "ON" state by turning input S1 "true" (see rung #4) the "OFF" input also on rung #4 will become "false" because of the NC S1 input on rung #1 before the "ON" output has a chance to latch via rung #4.
That's a lot of jargon but in short, I am hoping someone out there knows specifically how to translate the boolean expressions to ladder language. In the end I suppose it should look like the classic start/stop circuit you see on the first page of every ladder example. Thank you!
At first glance it looks like I did it right, but something is missing in the final translation because in this example if we are already in the "OFF" state and attempt to transition to the "ON" state by turning input S1 "true" (see rung #4) the "OFF" input also on rung #4 will become "false" because of the NC S1 input on rung #1 before the "ON" output has a chance to latch via rung #4.
That's a lot of jargon but in short, I am hoping someone out there knows specifically how to translate the boolean expressions to ladder language. In the end I suppose it should look like the classic start/stop circuit you see on the first page of every ladder example. Thank you!