How many states does the composition of (figure 2.) have? Recall the "coffee with a friend" situation, involving the two (concurrent) processes depicted in Figure 1startdrink coffee0start (0,0)think(0, 1)Figure 1: Two concurrent processes that are happening while having coffee with a friendtalkstartThe composition of these two processes would be as given in Figure 2 The composition is somehowthe "product" of these processes, and is a complete representation of this concurrent system. Its nodesrepresent the possible states that the system can be in, e.g., (1, 1) represents that I already drank mycoffee, while I have thought about what to say, but have not said it yet. The edges give the possibletransitions between these (composite) states, and so each path from the initial state (0, 0) to the finalstate (1,2) represents a possible trace of this system, e.g., think→ drink coffee → talk.drink coffeestartdrink coffeedrink coffee(0, 2)0think(1,2)eat cookie0talktalk(1, 1)2thinkFigure 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 beforetalking, as constrained by the second process depicted in Figure [1]Figure 3: Another possible (concurrent) process among those of Figure 1

According to the information given:- We have to follow the instruction in order to perform the task.

Answered: How many states does the composition of…

Engineering

Computer Science

How many states does the composition of (figure 2.) have?

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

Similar questions

Draw this scenario on a piece of paper and answer what is required on the next items, upload an image of your graph here. A system has three processes (P1, P2, P3) and three reusable resources (R1, R2, R3). There is one instance of R1, two instances of R2 and three instances of R3. P1 holds an R1 and an R3 and is requesting an R2. P2 holds an R3 and is requesting an R1 and an R2. P3 holds two R2 and an R3 and is requesting an R1. (rating in this item will be manually encoded by the instructor upon checking)
Generate a BLP lattice–structured system where the objects and subjects are appropriately levelledto give access consistent with the access control matrix below. You need to describe the process bywhich you obtain your lattice. R and W correspond, respectively, to read and append. You are touse only the mandatory BLP rules, and a default allow in place of the discretionary rule. Be sure toadd a level as necssary to ensure this is a lattice.
In this problem, we wish to build a repository of functions that a developer can assemble to build a complex program. There can exist several versions of a function, each with its metadata. Function metadata includes the developer's full name and email address, the language it is implemented in and a set of keywords related to the functionality fulfilled by the function. The versions of a function can be represented as a directed acyclic graph. To manage the repository, we use a remote invocation based GRPC that allows a client to interact with a server and execute the following operations: 1. add_new_fn: to add either a brand new function or a new version to an existing function; 2. add fns: to add multiple functions streamed by the client (note that multiple versions of a function are not allowed); 3. delete_fn: to delete a function (this might require reordering the versions of the function); 4. show_fn: to view a specific version of a function; 5. show all fns: to view all versions…
2. Generate a BLP lattice structured system where the objects and subjects are appropriately levelle to give access consistent with the access control matrix below. You need to describe the process b which you obtain your lattice. R and W correspond, respectively, to read and append. You are t use only the mandatory BLP rules, and a default allow in place of the discretionary rule. Be sure t add a level as necssary to ensure this is a lattice. 0₁ 0₂ R S₁ R 03 04 R R W S₂ R S3 R RW RW S₁ R S5 R S6 R R R 1 R 05 06 Ꭱ ] ᎡᎳ W W W R 3. For the following collection of statements, describe the sets of actions, objects, and subjects; an draw an access control matrix to represent the scenario. W W Alice can climb trees and eat apples. Bob can climb fences, eat apples, and wave flags. Trees can hurt apples. Carol can jump waves and wave flags.
2. Generate a BLP lattice structured system where the objects and subjects are appropriately levelled to give access consistent with the access control matrix below. You need to describe the process by which you obtain your lattice. R and W correspond, respectively, to read and append. You are to use only the mandatory BLP rules, and a default allow in place of the discretionary rule. Be sure to add a level as necssary to ensure this is a lattice. 0₁ S₁ R S2 R S3 R RW RW S4 R S5 R S6 R 02 R 03 04 05 06 R R RW R WW R R R W W W W R
Given the following UML diagram: Student - studentID: String + getStudentID(): String + toString(): String Person - lastName: String - firstName: String - dateOfBirth: Date - address: Address + getName(): String + getDOB(): Date + getAddress(): Address + toString(): String Professor - employeeID: String +getEmployelD(): String +toString(): String Write an implementation for the class Professor. DO NOT include or implement any constructor for this class. There are no abstract methods/classes in this example. toString method will return any simple String that contains firstName and employeelD only; no less, no more!! Assume firstName was defined as protected in class Person. You are not allowed to add implementation for any class or methods other than what is listed in the question statement.
QUESTION 4 A decision tree is read from left to right, with the conditions along the various branches and the actions at the far left. True False QUESTION 5 A is logically impossible in a data flow diagram (DFD) because a process must act on input, shown by an incoming data flow, and produce output, represented by an outgoing data flow. a. black hole b. gray matter C. server farm d. spontaneous combustion QUESTION 6 A(n) shows the object classes and relationships involved in a use case. a. modeling diagram b. class diagram c. association diagram d. use case diagram
1.Attached is a sample data frame of tweets data extracted between 2016-2022. I want a python code to show the distribution of tweets per year over that time period. 2. I want a python code of a force directed graph of a user like CABI_Plantwise, where i can see the interactions with that account
Elaborate the concept of friend function and friend classes by considering the academic and non-academic activities at BAHRIA University as a case study.
Write on paper and submit a picture. Remember arrow directions are read when the point at a subject and write when they point at the object. 1. Alice and Bob are two users. Exam.docx and Solution.dox are two files with the given access rights. {Exam.docx, (Bob, ), (Alice, )} {Solution.docx, (Bob, ), (Alice, ) Based on this specification, draw an Information flow graph.
Select the correct statements about sequence diagrams. A. Replicated messages are shown using a "loop box." B. Sequence diagrams cannot show optional messages involved in an interactions. C. A cross on the life line on an object indicates that the object is deleted. D. Objects and actors involved in the interaction are shown in the vertical axis. E. Time moves forward down the vertical axis.
Draw a Use Case Diagram for a voting machine, on which voters can see a list of Q-3: candidates and select one to vote for. The machine should check that each voter is eligible to vote. The electoral registrar will also want to print a summary of the total votes for each candidate, and (separately) a list of the voters who have voted, and a list of those who haven't. In case of a dispute, the machine should also list a complete record of who voted for whom, but only a judge can use this function.