![]() Boolean algebra adds a few more: DeMorgan, Absorption, Tautology, and Contradiction. You may remember the names of these laws from an old math class: Associative, Distributive, Communicative, Identity. ![]() This document explains how to apply several simple laws taken from boolean algebra to ladder logic. If you use the simpler forms your rungs will be easier to understand and change (which helps you write software that works the way you intend) and your programs will run faster and use less memory too. Each of these patterns can be written in a shorter and simpler form that does the same thing. ![]() You can write better, simpler ladder logic by learning to recognize several common patterns within your rungs.
0 Comments
Leave a Reply. |