Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
How many traces does figure 2 have?

How many traces does figure 2 have?

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question
How many traces does figure 2 have?
Recall the "coffee with a friend" situation, involving the two (concurrent) processes depicted in Figure 1 start drink coffee 0 start (0,0) think (0, 1) Figure 1: Two concurrent processes that are happening while having coffee with a friend talk start The composition of these two processes would be as given in Figure 2 The composition is somehow the "product" of these processes, and is a complete representation of this concurrent system. Its nodes represent the possible states that the system can be in, e.g., (1, 1) represents that I already drank my coffee, while I have thought about what to say, but have not said it yet. The edges give the possible transitions between these (composite) states, and so each path from the initial state (0, 0) to the final state (1,2) represents a possible trace of this system, e.g., think→ drink coffee → talk. drink coffee start drink coffee drink coffee (0, 2) 0 think (1,2) eat cookie 0 talk talk (1, 1) 2 think Figure 2: The composition of the two concurrent processes of Figure 1 (1,0) One could imagine yet a third process happening concurrently to the first two, as depicted in Figure 3. while having coffee with a friend. Again, one cannot eat a cookie while drinking coffee, thinking or talking (or should not?), but any of these can happen in any order, with the exception that one must think before talking, as constrained by the second process depicted in Figure [1] Figure 3: Another possible (concurrent) process among those of Figure 1
Transcribed Image Text:Recall the "coffee with a friend" situation, involving the two (concurrent) processes depicted in Figure 1 start drink coffee 0 start (0,0) think (0, 1) Figure 1: Two concurrent processes that are happening while having coffee with a friend talk start The composition of these two processes would be as given in Figure 2 The composition is somehow the "product" of these processes, and is a complete representation of this concurrent system. Its nodes represent the possible states that the system can be in, e.g., (1, 1) represents that I already drank my coffee, while I have thought about what to say, but have not said it yet. The edges give the possible transitions between these (composite) states, and so each path from the initial state (0, 0) to the final state (1,2) represents a possible trace of this system, e.g., think→ drink coffee → talk. drink coffee start drink coffee drink coffee (0, 2) 0 think (1,2) eat cookie 0 talk talk (1, 1) 2 think Figure 2: The composition of the two concurrent processes of Figure 1 (1,0) One could imagine yet a third process happening concurrently to the first two, as depicted in Figure 3. while having coffee with a friend. Again, one cannot eat a cookie while drinking coffee, thinking or talking (or should not?), but any of these can happen in any order, with the exception that one must think before talking, as constrained by the second process depicted in Figure [1] Figure 3: Another possible (concurrent) process among those of Figure 1
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Longest Common Subsequence
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.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS