Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
What does this note means about label transition machine.Hope to have explaination about the notation part and example 2.1 part

What does this note means about label transition machine.Hope to have explaination about the notation part and example 2.1 part

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

What does this note means about label transition machine.Hope to have explaination about the notation part and example 2.1 part

esp-coffee ask-esp ask-am 92 93 coin 91 94 am-coffee Fig. 2.1 A simple model for a coffee-vending machine Notation: In the following, given an LTS (Q,A, →), a transition (q,l, q') € → is denoted by qq'. Moreover, we also use the abbreviations below: qif and only if q. qa qif and only if Aq'. qd, q→ if and only if 3.q, q→ if and only if tq. Example 2.1. A simple coffee-vending machine which can input one coin, allows for the selection of espresso (action ask-esp) or American coffee (action ask-am), and then delivers the chosen beverage — may be modeled by the LTS (rooted in 9₁) depicted in Figure 2.1, with the obvious graphical convention. Formally, the set Q of states is {91,92, 93, 94}, the set A of labels is {coin, ask-esp, ask-am, esp-coffee, am-coffee} and the transition relation is the set {(91, coin, q2), (q2, ask-esp, 93), (92, ask-am, 94), (93, esp-coffee, q1), (94, am-coffee, q1)}.
Transcribed Image Text:esp-coffee ask-esp ask-am 92 93 coin 91 94 am-coffee Fig. 2.1 A simple model for a coffee-vending machine Notation: In the following, given an LTS (Q,A, →), a transition (q,l, q') € → is denoted by qq'. Moreover, we also use the abbreviations below: qif and only if q. qa qif and only if Aq'. qd, q→ if and only if 3.q, q→ if and only if tq. Example 2.1. A simple coffee-vending machine which can input one coin, allows for the selection of espresso (action ask-esp) or American coffee (action ask-am), and then delivers the chosen beverage — may be modeled by the LTS (rooted in 9₁) depicted in Figure 2.1, with the obvious graphical convention. Formally, the set Q of states is {91,92, 93, 94}, the set A of labels is {coin, ask-esp, ask-am, esp-coffee, am-coffee} and the transition relation is the set {(91, coin, q2), (q2, ask-esp, 93), (92, ask-am, 94), (93, esp-coffee, q1), (94, am-coffee, q1)}.
Expert Solution
steps

Step by step

Solved in 3 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS