Main

News

Modeling

   NFR Framework

   i* Framework

   KAOS

   Problem Frames

   UML

   BPMN

Reasoning

   Qualitative

   Quantitative

Extensions

Implementation

   Architecture

   Meta-model

Download and Installation

User Guide

   Starting RE-Tools

   Creating a Diagram

   Creating a Node

   Creating a Link

   Viewing Example Models

   Viewing Example Profile

   Exporting a Diagram

   Reasoning

       Label Propagation

       Alternatives Selection

   StarUML v1 User Guide

   StarUML v1 Dev Guide

   StarUML v1 Documents

Q&A

License

Publications and Adoption

Acknowledgements

© 2008-2016 Sam Supakkul

Label Propagation

1. Open the example models file. See here for the instructions. Click + symbol to expand the NFR Framework model folder, the Example 2 folder. Double-click PIG1 diagram to display the diagram.
2. Right click the leaf node (“Encryption[ID/Password” in this example) to display the pull-down menu. Click Tagged Values to display the Tagged Value Editor.
3. Click the pull-down menu for the Label attribute. Click Satisficed label. A check mark will be displayed on the leaf node to represent the value.
4. Based on the Label Propagation Procedure, the parent node is evaluated to be Denied when a child node of a Break(--) contribution is Satisficed. The Denied achievement label is depicted by a cross mark.
5. In turn, based on the Open World Assumption, the parent node’s achievement label is Unknown (no label icon).

However, for most problem modeling situations and computing systems, Closed World Assumption is more suitable.

To switch the Label Propagation Procedure to use Closed World Assumption, follow the instructions below.

1. Click Tools Menu.

2. Click Options. The Options dialog will be displayed.

1. Click RE-Tools.

2. Click Label Evaluation
3. Click the pull-down menu for World Assumption. Click ClosedWorld.
4. Click OK. The labels of all model elements in the current diagram will be re-evaluated bottom-up as shown below.

1. The parent node is now evaluated to be Denied based on the Closed World Assumption,

2. When a parent of an AND-decomposition has at least one child Denied, the parent is considered Denied.
3. Again, using the Closed World Assumption, when a child of a Make(++) contribution is Denied, the parent is considered Denied.
4. When the child of a Break(--) contribution is Denied, the parent is considered Satisficed.