Activities Manual For Programmable Logic Controllers
Activities Manual For Programmable Logic Controllers
5th Edition
ISBN: 9781259682476
Author: Frank Petruzella
Publisher: Mcgraw-hill Higher Education (us)
bartleby

Concept explainers

Question
Book Icon
Chapter 9, Problem 1RQ
Program Plan Intro

a.

Master Control Reset (MCR) instructions:

  • The MCR instruction is used to clear all set outputs within the fenced zone.
  • In other words, it turns off all the non-retentive outputs in the fenced zone.
  • Non-retentive outputs cannot retain their memory when they are de-energized.
  • The MCR instruction within the zone are still scanned, but the scan time is reduced due to the false state of non-retentive outputs.

Expert Solution
Check Mark

Explanation of Solution

Programming procedure:

  • In order to control a program section, two MCR output instructions are programmed.
  • The fenced zone which needs to be controlled begins with one MCR instruction and the other MCR instruction at the end.
  • An MCR rung with conditional inputs is placed at the beginning of the program section to be controlled.
  • An MCR rung with no conditional inputs is placed at the end of the program section to be controlled.
  • If the first MCR instruction becomes true, then all the outputs present in between the two MCR instructions will act according to the logic.
  • If the MCR instruction becomes false, then all the non-retentive outputs will be de-energized and all the retentive outputs will retain their previous state.

Explanation of Solution

b.

False-to-true transition:

  • When the MCR instruction makes a false-to-true transition, all rung outputs within the program section will be controlled by their respective input conditions.
  • Initially, when the MCR instruction in the rung is false, all the rungs within the zone are made inactive and de-energizes all non-retentive outputs.
  • Hence, all retentive devices such as latches will remain in their previous state.

Explanation of Solution

c.

True-to-false transition:

  • When the MCR instruction makes a true-to-false transition, all non-retentive outputs within the program section will be de-energized.
  • At the same time, all the retentive outputs within the fenced zone will remain in their previous state.
  • Initially, when the MCR instruction in the rung is true, all the rungs within the zone are scanned and the outputs are energized and updated based on their logic.
  • When the MCR instruction undergoes a transition from true-to-false, the scan ignores the input and de-energizes all the non-retentive outputs.
  • Hence, all the retentive devices like latches, timers will remain in their previous state.

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
1. Create a Person.java file. Implement the public Person and Student classes in Person.java, including all the variables and methods in the UMLS. Person -name: String -street: String -city: String +Person(String name, String, street, String, city) +getName(): String +setName(String name): void +getStreet(): String +setStreet(String street): void +getCity(): String +setCity(String City): void +toString(): String Student -Id: int +Person(String name, String, street, String, city, int Id) +getId(): int +setId(int Id): void +toString(): String 2. Create a StudentTest.java file. Implement a public StudentTest class with a main method. In the main method, create one student object and print the object using System.out.println(). Your printing result must follow the example output: name: Mike, street: Morris Ave, city: Union, Id: 1000 Hint: You need to modify the toString methods in the Student class and Person class!
1) Apply the Paint Blue algorithm discussed in class to the following Finite Automata. a a a b b a COIS-3050H-R-W01-2025WI-COMB Formal Languages & Automata a b Show the status of the Finite Automata at the conclusion of the Paint Blue Algorithm (mark the visited states with an X and only include edges that have not been followed). 2) Use the pumping lemma to prove the following language is nonregular: L= {ab} = {abbb, aabbbbbb, aaabbbbbbbbb, ...}
3) Find CFGs that for these regular languages over the alphabet Σ= {a, b}. Draw a Finite Automata e CFG. 1 COIS-3050H-R-W01-2025WI-COMB Formal anguages & Automata Is that contain the substring aba. (b) The language of all words that have an odd number letters and contains the string bb. (c) The language of all words that begin with the substring ba and contains an odd number of letters. 4) Convert the following FA into a PDA. a a S± b a a Ν Ꮓ
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Text book image
COMPREHENSIVE MICROSOFT OFFICE 365 EXCE
Computer Science
ISBN:9780357392676
Author:FREUND, Steven
Publisher:CENGAGE L
Text book image
Principles of Information Systems (MindTap Course...
Computer Science
ISBN:9781285867168
Author:Ralph Stair, George Reynolds
Publisher:Cengage Learning
Text book image
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Text book image
MIS
Computer Science
ISBN:9781337681919
Author:BIDGOLI
Publisher:Cengage