--%>
Assignment Help - homework help

Problem on Model Checking

Part (a). Draw a state diagram for a car with the following state variables: D indicating whether the car is in drive; B indicating the brake pedal is depressed; G indicating the gas pedal is depressed; and M indicating whether the car is moving. (For example, the state DB¬G¬M says that the car is in drive, the brake pedal is down, the gas pedal is not down, and the car is not moving). Your state diagram should obey the following properties:

The start state is ¬D¬B¬G¬M.

  • To put the car in drive, the brake pedal must be down.
  • To push the gas pedal, the car must be in drive.
  • It is not possible to push both the gas and the brake at the same time.
  • Once the gas is down, the car will eventually move.
  • Once the car is moving, it is possible to stop the car by depressing the brake.

Part (b). For each of properties 1-4 listed in Part (a), write an LTL formula specifying the property, and make an informal argument why the property holds for your diagram.

Part (c). Is it possible to specify property 5 using an LTL formula? Justify your answer.

   Related Questions in Basic Statistics

  • Q : Derived quantities in Queuing system

    Derived quantities in Queuing system: • λ = A / T, Arrival rate • X = C / T, Throughput or completion rate • ρ =U= B / T, Utilization &bu

    		•
  • Q : Program Evaluation and Review

    Program Evaluation and Review Technique (PERT) A) Developed by US Navy and a consulting firm in 1958 for the Polaris submarine project. B) Technique as for CPM method, but acti

    		•
  • Q : Model Checking Approach Model Checking

    Model Checking Approach: • Specify program model and exhaustively evaluate that model against a speci?cation        –Check that properties hold   

  • Q : Homework help on Human memory & SPSS

    Effect of Scopolamine on Human Memory: A Completely Randomized Three Treamtent Design (N = 28) Scopolamine is a sedative used to induce sle

    		•
  • Q : Assumptions in Queuing system

    Assumptions in Queuing system: • Flow balance implies that the number of arrivals in an observation period is equal to the

    		•
  • Q : State Littles Law Little’s Law : • L =

    Little’s Law: • L = λR = XR • Lq = λW = XW • Steady state system • Little’s Law holds as long as customers are not destroyed or&nbs

    		•
  • Q : Problem on Model Checking Part (a).

    Part (a). Draw a state diagram for a car with the following state variables: D indicating whether the car is in drive; B indicating the brake pedal is depressed; G indicating the gas pedal is depressed; and M indicating whether the car is moving. (For example, the sta

    		•
  • Q : FIN512 Entrepreneurial Finance Chapter

      Chapter 6: Discussion Question: #4 p. 223  It is usually easier to forecast sales for a seasoned firm contrast to an early-stage venture because an early-stage venture has limited access to bank credit lines, sho

    		•
  • Q : Probability how can i calculate

    how can i calculate cumulative probabilities of survival

    		•
  • Q : Networks of queues Networks of queues •

    Networks of queues • Typically, the flow of customers/request through a system may involve a number of different processing nodes.– IP packets through a computer network– Orders through a manufactur

    		•