With this exercise, we shall develop a solution to the following riddle.   Two adults, their three children, and their dog are on a walk when they come upon a river. They have a boat, but it can only hold a maximum of one adult with either one child or the dog; or three chidren; or two children and the dog. Anyone (other than the dog) can row the boat; but it would be too much work for one child to row across by themself. How can they all get across the river? You are required to solve this riddle by modelling it using a labelled transition system (LTS).   1. What are the states of your LTS consist of? Make sure you consider all the aspects of the riddle. Justify your notion of state.   2. What are the actions of your LTS? List all the actions. Justify your choice of actions.   3. Drawing out the entire LTS may be a time consuming task as there could be very many states and transitions. However, drawing out only part of the LTS is doable. Draw part of the LTS, anywhere between 7 and 12 states, including the starting state. Label the states so that it is clear what the states represent, and explain your labelling.   4. Solve the riddle. Provide a sequence of transitions (listed or drawn) that solves the riddle.

Operations Research : Applications and Algorithms
4th Edition
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Wayne L. Winston
Chapter23: Simulation With The Excel Add-in @risk
Section: Chapter Questions
Problem 8RP
icon
Related questions
Question

With this exercise, we shall develop a solution to the following riddle.

 

Two adults, their three children, and their dog are on a walk when they come upon a river. They have a boat, but it can only hold a maximum of one adult with either one child or the dog; or three chidren; or two children and the dog. Anyone (other than the dog) can row the boat; but it would be too much work for one child to row across by themself. How can they all get across the river? You are required to solve this riddle by modelling it using a labelled transition system (LTS).

 

1. What are the states of your LTS consist of? Make sure you consider all the aspects of the riddle. Justify your notion of state.

 

2. What are the actions of your LTS? List all the actions. Justify your choice of actions.

 

3. Drawing out the entire LTS may be a time consuming task as there could be very many states and transitions. However, drawing out only part of the LTS is doable. Draw part of the LTS, anywhere between 7 and 12 states, including the starting state. Label the states so that it is clear what the states represent, and explain your labelling.

 

4. Solve the riddle. Provide a sequence of transitions (listed or drawn) that solves the riddle.

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Maximum Flow
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.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Operations Research : Applications and Algorithms
Operations Research : Applications and Algorithms
Computer Science
ISBN:
9780534380588
Author:
Wayne L. Winston
Publisher:
Brooks Cole