Search icon CANCEL
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
PLCs for Beginners

You're reading from   PLCs for Beginners An introductory guide to building robust PLC programs with structured text

Arrow left icon
Product type Paperback
Published in May 2024
Publisher Packt
ISBN-13 9781803230931
Length 380 pages
Edition 1st Edition
Tools
Arrow right icon
Author (1):
Arrow left icon
M. T. White M. T. White
Author Profile Icon M. T. White
M. T. White
Arrow right icon
View More author details
Toc

Table of Contents (25) Chapters Close

Preface 1. Part 1: Basics of Computer Science for PLC Programmers FREE CHAPTER
2. Chapter 1: Computer Science Versus Automation Programming 3. Chapter 2: PLC Components – Integrating PLCs with Other Modules 4. Chapter 3: The Basics of Programming 5. Chapter 4: Unleashing Computer Memory 6. Chapter 5: Designing Programs – Unleashing Pseudocode and Flowcharts 7. Chapter 6: Boolean Algebra 8. Part 2: Introduction to Structured Text Programming
9. Chapter 7: Unlocking the Power of ST 10. Chapter 8: Exploring Variables and Tags 11. Chapter 9: Performing Calculations in Structured Text 12. Chapter 10: Unleashing Built-In Function Blocks 13. Chapter 11: Unlocking the Power of Flow Control 14. Chapter 12: Unlocking Advanced Control Statements 15. Chapter 13: Implementing Tight Loops 16. Part 3: Algorithms, AI, Security, and More
17. Chapter 14: Sorting with Loops 18. Chapter 15: Secure PLC Programming – Stopping Cyberthreats 19. Chapter 16: Troubleshooting PLCs – Fixing Issues 20. Chapter 17: Leveraging Artificial Intelligence (AI) 21. Chapter 18: The Final Project – Programming a Simulated Robot 22. Assessments 23. Index 24. Other Books You May Enjoy

Boolean expressions

Often, whether a control statement evaluates to true and a machine properly turns on will be dictated by a number of conditions, such as a series of variables being true or a series of switches being on. Boolean expressions are essentially specialized math equations that will determine whether an output will be on or off based on the state of the inputs.

The whole “math” concept may frighten a lot of people; however, the math behind Boolean expressions is not scary at all and is little more than adding or multiplying 1s and 0s. In a mathematical sense, each of the Boolean operators we explored previously will boil down to addition, multiplication, or simply flipping a value from 0 to 1, or vice versa. This, for the most part, means, that if you can multiply by 1 or 0 and add by 1 or 0, you have a solid foundation for Boolean calculations.

Exploring NOT

To start off with Boolean expressions, let’s explore the NOT operator in more depth...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime