From Support

Back to Model Library

See also: How to read .MOD pages

Contents 1 Description 2 State Variables 3 Vertices 4 Initialization Conditions 5 Event Relationship Graph 6 English Translation 7 Comments

Description

A_2CAN.MOD is an example of animation. Eight nodes schedule each other unconditionally, while the ninth node generates a random number, R, and based off that random number schedules one of three node. Each node has an image of a toucan in a different position next to a computer, so when the simulation runs the visible image switches, creating the illusion that the toucan is moving. This produces the animation of a Toucan tapping a computer with its beak.

State Variables

State Variables in A_2CAN.MOD

Variable Name	Variable Description	Size	Type
R	Random number between 0 and 1	1	Real

Vertices

Vertices in A_2CAN.MOD

Vertex Name	Vertex Description	State Changes
1	Used for animation	None
2	Used for animation	None
3	Used for animation	None
4	Used for animation	None
5	Used for animation	None
6	Used for animation	None
7	Used for animation	None
8	Executes the motion of the toucan	R=RND
9	Used for animation	None

Initialization Conditions

This model has no initialization conditions.

Event Relationship Graph

There is no event relationship graph available for this model. SIGMA displays an animation of a toucan instead, as it is a model to illustrate animation.

English Translation

An English translation is a verbal description of a model, automatically generated by SIGMA.

The SIGMA Model, A_2CAN.MOD, is a discrete event simulation. 

I. STATE VARIABLE DEFINITIONS.

For this simulation, the following state variables are defined:

R:   (real valued)

II. EVENT DEFINITIONS.

Simulation state changes are represented by event vertices (nodes or balls) in a SIGMA graph.  
Event vertex parameters, if any, are given in parentheses. Logical and dynamic relationships 
between pairs of events are represented in a SIGMA graph by edges (arrows) between event vertices.  
Unless otherwise stated, vertex execution priorities, to break time ties, are equal to 5.

1. The 1() event:
   After every occurrence of the 1 event:
   Unconditionally, schedule the 2() event to occur without delay.

2. The 2() event:
   After every occurrence of the 2 event:
   Unconditionally, schedule the 3() event to occur without delay.

3. The 3() event:
   After every occurrence of the 3 event:
   Unconditionally, schedule the 4() event to occur without delay.

4. The 4() event:
   After every occurrence of the 4 event:
   Unconditionally, schedule the 5() event to occur without delay.

5. The 5() event:
   After every occurrence of the 5 event:
   Unconditionally, schedule the 6() event to occur without delay.

6. The 6() event:
   After every occurrence of the 6 event:
   Unconditionally, schedule the 7() event to occur without delay.

7. The 7() event:
   After every occurrence of the 7 event:
   Unconditionally, schedule the 9() event to occur without delay.

8. The 8() event:
   This event causes the following state change(s):
   R=RND
   After every occurrence of the 8 event:
   If R<.2, then schedule the 1() event to occur without delay.
   If R>=.2 and R<.6, then schedule the 4() event to occur without delay.
   If R>=.6, then schedule the 7() event to occur without delay.

9. The 9() event:
   After every occurrence of the 9 event:
   Unconditionally, schedule the 8() event to occur without delay.

Comments

Back to Model Library