Term
| Complex systems are structured as sets of simpler activities, each represented as a _____ process |
|
Definition
|
|
Term
| Processes can overlap or be concurrent, so as to reflect the concurrency inherent in the _____ world, or to _____ time-consuming tasks, or to manage _____ |
|
Definition
| physical, offload, communications |
|
|
Term
| Designing concurrent software can be _____ and error prone |
|
Definition
|
|
Term
| Concept of a process as a _____ of actions. Model processes as _____ _____ _____. Program processes as _____ in Java |
|
Definition
| sequence, finite state machines, threads |
|
|
Term
| Processes- _____ of sequential execution |
|
Definition
|
|
Term
| The execution of a sequential program |
|
Definition
|
|
Term
| A process is modeled as a finite state machine which transits from _____ to _____ by executing a sequence of _____ actions |
|
Definition
|
|
Term
| on->off->on->off->on->off is a sequence of actions or _____ |
|
Definition
|
|
Term
Write the FSP for the following LTS:
[image] |
|
Definition
| ONESHOT = (once -> STOP). |
|
|
Term
Draw the LTS for the following FSP:
ONESHOT = (once -> STOP). |
|
Definition
|
|
Term
Write the FSP for the following LTS:
[image] |
|
Definition
| SWITCH = (on -> off -> SWITCH). |
|
|
Term
Draw the LTS for the following FSP:
SWITCH = (on -> off -> SWITCH). |
|
Definition
|
|
Term
Write the FSP for the following LTS:
[image] |
|
Definition
| TRAFFICLIGHT = (green -> orange -> red -> TRAFFICLIGHT). |
|
|
Term
Draw the LTS for the following FSP:
TRAFFICLIGHT = (green -> orange -> red -> TRAFFICLIGHT). |
|
Definition
|
|
Term
Write the FSP for the following LTS:
[image] |
|
Definition
| DRINKS = (red -> coffee -> DRINKS | blue -> tea -> DRINKS). |
|
|
Term
Draw the LTS for the following FSP:
DRINKS = (red -> coffee -> DRINKS | blue -> tea -> DRINKS). |
|
Definition
|
|
Term
Write the FSP for the following LTS:
[image] |
|
Definition
COIN = (toss -> HEADS | toss -> TAILS),
HEADS = (heads -> COIN),
TAILS = (tails -> COIN). |
|
|
Term
Draw the LTS for the following FSP:
COIN = (toss -> HEADS | toss -> TAILS),
HEADS = (heads -> COIN),
TAILS = (tails -> COIN). |
|
Definition
|
|
Term
Write the FSP for the following LTS:
[image] |
|
Definition
| CHAN = (in -> CHAN | in -> out -> CHAN). |
|
|
