Concurrent Programming
FSP Process Analysis & Design Form
1. FSP Process Attributes
| Attribute | Value |
| Name | |
| Description | |
| Alphabet | |
| Number of States | |
| Deadlocks (yes/no) | |
| Deadlock Trace(s) (if applicable) |
2. FSP Process Code
| FSP Process: |
3. Actions Description
A description of what each of the FSP process’ actions represents, i.e. is modelling. In addition, indicate if the action is intended to be synchronised (shared) with another process or asynchronous (not shared). (Add rows as necessary.)
| Actions | Represents | Synchronous or Asynchronous |
4. FSM/LTS Diagrams of FSP Process
Note that if there are too many states, more than 64, then the LTSA tool will not be able to draw the diagram. In this case draw small diagrams of the most important parts of the complete diagram.
5. LTS States
A description of what each of the FSP process’ states represents, i.e. is modelling. If there are a large number of states then you can group similar states together &/or only include the most important ones. For example, identify any states related to mutual exclusion (ME) & the associated critical section (CS), e.g. waiting to enter the CS state, in the CS state(s), left the CS state. (Add rows as necessary.)
| State | Represents |
6. Trace Tree for FSP Process
The trace tree for the process. Use the conventions given in the lecture notes and add explanatory notes if necessary.