1 / 5

M 1

1. A work cell consists of two machines M 1 and M 2 and an automated guided vehicle AGV. The automaton models of these three components are shown in the figure below. The complete system is G = M 1  M 2  AGV. (a) Find G . (b) Is G blocking or non-blocking?. readyat1. giveto2.

nolcha
Download Presentation

M 1

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 1. A work cell consists of two machines M1 and M2 and an automated guided vehicle AGV. The automaton models of these three components are shown in the figure below. The complete system is G = M1 M2 AGV. (a) Find G. (b) Is G blocking or non-blocking? readyat1 giveto2 M1 M2 0 1 0 1 loadat1 loadat2 AGV giveto2 loadat2 1 0 2 loadat1 giveout

  2. 2. Build the observer of the nondeterministic automaton shown in the figure below. a, b a  b 4 1 2 0 a b  b a 3 5

  3. 3. Build the diagnoser of unobservable event event e for the nondeterministic automaton shown in figure below. (All the events are observable but e.) 3 4 g 5 b a d 2 e t b g 1 t 10 6 8 9 a e g b 7 11 12 d

  4. 4. A simple manufacturing process involves two machines, M1 and M2, and a Buffer B in between. There is an infinite supply of parts to M1. When a part is processed at M1, it is placed inB, which has a capacity of one part only. The part is subsequently processed by M2. Let us suppose that we build the uncontrolled model of Mi,i = 1, 2, as follows. Each machine has three states: Idle (the initial state), Processing, and Down. Each machine has four transitions: event START from Idle to Processing, event END from Processing to Idle, event BREAKDOWN from Processing to Down, and event REPAIR from Down to Idle. The behavior of the system need to be restricted to satisfy the following rules: (i) M1 can only begin processing if the buffer is empty; (ii) M2 can only begin processing if the buffer is full; (iii) M1 cannot begin processing if M2 is down; (iv) If both machines are down, then M2 gets repaired first. Answer the following questions. (a) Construct an automaton that represents the admissible behavior, as captured by (i) to (iv) above. This automaton should generate a sublanguage of L(M1  M2). (b) Suppose that the events START and REPAIR of each machine can be controlled (that is, enabled or disenabled) by a controller. For each state of your automaton in (a) above, identify which feasible events in M1 and M2 the controller should disable.

  5. Consider the pump-valve-controller system discussed in Example 2.24 in the handout (Ch. 2, Cassandras and Lafortune, pp. 118-119). Build the diagnosers for the complete system model depicted in Fig. 2.29 (page 120) for the two faults STUCK_CLOSED and STUCK_OPEN. Are these faults diagnosable?

More Related