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.

Slides:

Advertisements

Similar presentations

Language and Automata Theory

Advertisements

1 Fault Diagnosis for Timed Automata Stavros Tripakis VERIMAG.

C O N T E X T - F R E E LANGUAGES ( use a grammar to describe a language) 1.

MBD in real-world system… Self-Configuring Systems Meir Kalech Partially based on slides of Brian Williams.

Linear Programming Pre-Calc Section 3.4 Running a profitable business requires a careful balancing of resources (for example, peoples’ time, materials,

Diagnosis of Discrete Event Systems Meir Kalech Partly based on slides of Gautam Biswass.

Ex. 11 (pp.409) Given the lattice structure shown in Figure 6.33 and the transactions given in Table 6.24, label each node with the following letter(s):

PDAs => CFGs Sipser 2.2 (pages ). Last time…

PDAs => CFGs Sipser 2.2 (pages ). Last time…

start 0, 4, 8 1, 5, 9 2, 6 3, 7 2 0,4,8 2, 6 3, 7 1, 5, 9 to state 2 to state 3 to state 1 to state 0 to state 1 to state 3 to state 0 to state.

1 The scanning process Goal: automate the process Idea: –Start with an RE –Build a DFA How? –We can build a non-deterministic finite automaton (Thompson's.

56 Rumination on the Formal Definition of DPDA In the definition of DPDA, there are some parts that do not agree with our intuition. Let M = (Q, , ,

I.1 ii.2 iii.3 iv.4 1+1=. i.1 ii.2 iii.3 iv.4 1+1=

Aho-Corasick String Matching An Efficient String Matching.

79 Regular Expression Regular expressions over an alphabet  are defined recursively as follows. (1) Ø, which denotes the empty set, is a regular expression.

I.1 ii.2 iii.3 iv.4 1+1=. i.1 ii.2 iii.3 iv.4 1+1=

Reducing Cache Misses 5.1 Introduction 5.2 The ABCs of Caches 5.3 Reducing Cache Misses 5.4 Reducing Cache Miss Penalty 5.5 Reducing Hit Time 5.6 Main.

CURRENT TRENDS IN DETERMINISTIC SCHEDULING 1- Scheduling Theory 2- Search Algorithms 3- Scheduling Practice 1- Scheduling Theory 2- Search Algorithms 3-

Chapter 5 Linear Inequalities and Linear Programming Section 2 Systems of Linear Inequalities in Two Variables.

1 Sequential Circuits Registers and Counters. 2 Master Slave Flip Flops.

“Recognizing Integers” September, th Grade Math.

Introduction to Stochastic Models GSLM 54100

1 1 Slide © 2016 Cengage Learning. All Rights Reserved. A population is the set of all the elements of interest. A population is the set of all the elements.

Modeling with ordinary Petri Nets Events: Actions that take place in the system The occurrence of these events is controlled by the state of the system.

1 Unit 1: Automata Theory and Formal Languages Readings 1, 2.2, 2.3.

1 Chapter 2 Finite Automata (part b) Windmills in Holland.

A Theory of Interactive Computation Jan van Leeuwen, Jiri Widermann Presented by Choi, Chang-Beom KAIST.

Population distribution VS Sampling distribution

Networks of Queues Plan for today (lecture 6): Last time / Questions? Product form preserving blocking Interpretation traffic equations Kelly / Whittle.

Digital Logic Design Lecture # 9 University of Tehran.

Column Sequences An Investigation Column Sequences Look carefully at the columns shown below and the way in which the numbers are being put into each.

CS 367: Model-Based Reasoning Lecture 5 (01/29/2002) Gautam Biswas.

Kleene’s Theorem Group No. 3 Presented To Mam Amina Presented By Roll No Roll No Roll No Roll No Group No. 3 Presented To Mam.

CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur

Flows and Networks Plan for today (lecture 6): Last time / Questions? Kelly / Whittle network Optimal design of a Kelly / Whittle network: optimisation.

S TOCHASTIC M ODELS L ECTURE 3 P ART II C ONTINUOUS -T IME M ARKOV P ROCESSES Nan Chen MSc Program in Financial Engineering The Chinese University of Hong.

1Barnett/Ziegler/Byleen Finite Mathematics 12e Learning Objectives for Section 5.2  The student will be able to solve systems of linear inequalities graphically.

Manufacturing Plant maintenance Materials management Quality management.

Outline MSI Parts as a Decoder Multiplexer Three State Buffer MSI Parts as a Multiplexer Realization of Switching Functions Using Multiplexers.

CONCURRENT SIMULATION: A TUTORIAL Christos G. Cassandras Dept. of Manufacturing Engineering Boston University Boston, MA Scope of.

Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1 Chapter 1 Regular Languages Some slides are in courtesy.

UNIT - I Formal Language and Regular Expressions: Languages Definition regular expressions Regular sets identity rules. Finite Automata: DFA NFA NFA with.

using Deterministic Finite Automata & Nondeterministic Finite Automata

Chapter 5 Finite Automata Finite State Automata n Capable of recognizing numerous symbol patterns, the class of regular languages n Suitable for.

CS 367: Model-Based Reasoning Lecture 7 (02/05/2002) Gautam Biswas.

1 8.4 Extensions to the Basic TM Extended TM’s to be studied: Multitape Turing machine Nondeterministic Turing machine The above extensions make no increase.

Lecture 09: Theory of Automata:2014 Asif NawazUIIT, PMAS-Arid Agriclture University Rawalpindi. Kleene’s Theorem and NFA.

Turing Machine Model Are there computations that no “reasonable” computing machine can perform? –the machine should not store the answer to all possible.

COMP 3438 – Part II - Lecture 3 Lexical Analysis II Par III: Finite Automata Dr. Zili Shao Department of Computing The Hong Kong Polytechnic Univ. 1.

Simplex Method for BLENDING OF AGGREGATES The contract specifications of a building project require that the course aggregate grading for concrete mixing.

Reflections in Plane Mirrors

HEAT SINKS Kurt is the answer for your heat sink needs.

Significant Digits and Isotopic Abundance

What is the difference between accuracy and precision?

Kleene’s Theorem and NFA

Chapter 5 Linear Inequalities and Linear Programming

Pushdown Automata.

Pushdown Automata.

Language and Automata Theory

OTHER MODELS OF TURING MACHINES

Turing Machines Acceptors; Enumerators

Computation of Minimal Siphons for a Class of Generalized Petri Nets

High-Level Abstraction of Concurrent Finite Automata

Flows and Networks Plan for today (lecture 6):

CIM Review Manufacturing Processes

2) For each of the finite state machines above, use the sets derived in part 1) to produce the following: i. a set of sequences that.

Solving Equations 3x+7 –7 13 –7 =.

Recap lecture 37 New format for FAs, input TAPE, START, ACCEPT , REJECT, READ states Examples of New Format of FAs, PUSHDOWN STACK , PUSH and POP states,

Combinations Practical Applications from

Presentation transcript:

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? M1M1 M2M2 readyat1 loadat1 giveto2 loadat2 giveto2 giveout loadat2 loadat1 AGV

2. Build the observer of the nondeterministic automaton shown in the figure below. a, b  b a b b a a 

3. Build the diagnoser of unobservable event event e for the nondeterministic automaton shown in figure below. (All the events are observable but e.) t t e a b g a e bg b g d d

4. A simple manufacturing process involves two machines, M 1 and M 2, and a Buffer B in between. There is an infinite supply of parts to M 1. When a part is processed at M 1, it is placed in B, which has a capacity of one part only. The part is subsequently processed by M 2. Let us suppose that we build the uncontrolled model of M i, 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) M 1 can only begin processing if the buffer is empty; (ii) M 2 can only begin processing if the buffer is full; (iii) M 1 cannot begin processing if M 2 is down; (iv) If both machines are down, then M 2 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 (M 1  M 2 ). (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 M 1 and M 2 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 ). Build the diagnosers for the complete system model depicted in Fig (page 120) for the two faults STUCK_CLOSED and STUCK_OPEN. Are these faults diagnosable?