Zicomi Systems Logo
contact us  |  your privacy
Company
Services
Products
Support
Resources
  OMG Standards
OMG Logo
  Have You Heard?
UML Diagrams
Zicomi Systems publishes some UML example diagrams online from the world famous UML dictionary.
more...
Version 2.5 Released
Zicomi Systems is delighted to announce that version 2.5 of Zicomi Mentor is released. With support for UML 2.0 and all thirteen UML diagrams
more...
Zicomi Systems' Director
speaks about the UML at Objects by Design - an informative interview
more...
Partner Programme
Zicom Systems is delighted to announce a new world wide partner programme, become a partner today.
more...
OMG Member
Zicom Systems is made a member of the OMG!
UML Element Description
Activity Final Node
Activity Final Node    
An activity final node is a type of final node that stops an activity. When a token arrives at an activity final node all flows in the enclosing activity are stopped and the activity is terminated. The token arriving at the activity final node is itself destroyed. Any tokens that are offered on the incoming edges of the activity are accepted and object nodes declared as outputs are offered to the output edges of the enclosing activity.
Actor
Actor    
An actor represents a set of roles that a user plays with an entity (system, subsystem or a class). Actors can be human or other systems, subsystems or classes that represent things outside of the entity. The actor "communicates" with the entity by sending a series of messages backwards and forwards.
Actor Instance
Actor Instance    
An actor instance is a specific instance of an actor using the entity being modeled, which is most typically a system but could be a subsystem or a class. It has unique identity as well as attribute values, which determine its state at any point in time. An actor instance communicates with one or more instances of use cases sending message instances.
Assembly Connector
Assembly Connector    
An assembly connector is a kind of connector that is specialized for use in component modeling. It is used to connect the provided interface or port of one component to the required interface or port of another component.
Boundary
Boundary    
A boundary is a stereotyped class that is located on the periphery of the entity being modeled. Most commonly the entity is an entire system but can also be a subsystem. The boundary class communicates with actors, who exist outside the system and control, entity and other boundary classes inside the system.
Control
Control    
A control is a stereotyped class whose responsibility is to manage other classes and their interactions. It communicates with boundary classes positioned on the entity periphery, other control classes and entity classes.
Deep History
Deep History    
A deep history is a kind of pseudostate that acts as a marker or placeholder. It represents the most recent active substate of the containing composite state, and the substates of that substate. It is not a state itself but a diagrammatic representation or marker for the "condition" of the composite state down to any level, at the time it was last exited.
Entity
Entity    
An entity is a stereotyped class, that has the responsibility of providing services to a number of entity classes and thus in turn to boundary classes.
Entry Connection Point Reference
Entry Connection Point Reference    
An entry connection point reference represents the entry point to a submachine state. It provides a target for a transition to a submachine state and is the only way that a submachine state can be referenced. A submachine state may have any number of entry connection point references and these represent entry point pseudostates defined in the submachine state.
Entry Point
Entry Point    
An entry point is a pseudostate that marks the point of entry to the region in a state machine in which it is enclosed. It has a single outgoing transition to a vertex in the same region. An entry point can only be defined for the top most regions of a state machine and not for regions owned by other regions. Each topmost region of a state machine can contain one (and only one) entry point.
Exit Connection Point Reference
Exit Connection Point Reference    
An exit connection point reference represents the exit point to a submachine state. It provides a source for a transition leaving a submachine state and is the only way that a submachine state can be referenced. A submachine state may have any number of exit connection point references and these represent exit point pseudostates defined in the submachine state.
Exit Point
Exit Point    
An exit point is a pseudostate that marks the point of exit from the region in a state machine in which it is enclosed. It may have one or more incoming transitions from vertices in the same region. An exit point can only be defined for the top most regions of a state machine and not for regions owned by other regions. Each topmost region of a state machine can contain any number of exit points.
Final State
Final State    
A final state represents the last or "final" state of the enclosing composite state. There may be more than one final state at any level signifying that the composite state can end in different ways or conditions. When a final state is reached and there are no other enclosing states it means that the entire state machine has completed its transitions and no more transitions can occur.
Flow Final Node
Flow Final Node    
A flow final is a type of final node that consumes the incoming token. When a token arrives at a flow final the token is consumed. No other part of the enclosing activity is affected. Since there are no outgoing flows from a flow final node the effect is simply to remove tokens from the activity.
Found Message
Found Message    
A found message is a kind of message where the receiver (event occurrence) is known but the sender (event occurrence) is not known. It is assumed that the sender exists but is outside the scope of the model.
Initial
Initial    
An initial is a kind of pseudostate that represents the starting point in a region of a state machine. It has a single outgoing transition to the default state of the enclosing region, and has no incoming transitions. There can be one (and only one) initial state in any given region of a state machine. It is not itself a state but acts as a marker.
Initial Node
Initial Node    
An initial node is a type of control node which initiates flow in an invoked activity. It has no incoming flows and one or more outgoing flows. The outgoing flows may be guarded with conditions that determine if they will accept tokens. When an activity is invoked tokens are offered to all outgoing flows. There may be zero or more initial nodes in any activity. While other control nodes cannot detain tokens an initial node can retain a token if the guard on an outgoing flow prevents a token from being accepted when the activity starts.
Interface (Provided)
Interface (Provided)    
An interface (provided) specifies a set of abstract operations. The operations are the external view of the classifier and do not reveal to the client the way that the operations are implemented by the classifier. An interface is conceptually an abstract classifier without attributes. A classifier is said to "implement an interface" if it provides the implementation of all or some of the operations declared by the interface. This relationship is shown by a realization drawn from the classifier with the arrow pointing to the interface. An interface cannot have instances.
Interface (Required)
Interface (Required)    
A required interface is a type of classifier that specifies services that another classifier needs (requires) to carry out its work. A required interface is an external view of the classifier and does not indicate how the classifier will actually perform its work, just an aspect of what it requires to do so. A required interface is an expression of a contract that the classifier has with other parts of the system.
Junction
Junction    
A junction is a kind of pseudostate that is used to merge and (or) split one or more transitions between states creating complex paths. They can take one or more incoming transitions and have one or more outgoing transitions. The do not create concurrent transitions but their result is the firing of a single outgoing transition. The outgoing transitions are typically guarded and these conditions are evaluated statically.
Lost Message
Lost Message    
A lost message is a kind of message where the sender (event occurrence) is known but the receiver (event occurrence) is not known. It is assumed that the reason it does not have a receiver (reception) is because it never reached its destination.
Package Contents
Package Contents    
Package Contents can be indicated using the anchor symbol. This denotes that the packages that are attached to the non-anchor end of the relationship are contained within the anchor package. This is an alternative notation to packages being graphically contained or placed inside other packages.
Port typed by Provided Interface
Port typed by Provided Interface    
A port typed by provided interface is both a connectable element and a structural feature of an encapsulated classifier. The provided interface specifies the services that the classifier offers through this port. Requests that arrive at the port are handled either directly by the classifier or by one or more of its parts.
Port typed by Required Interface
Port typed by Required Interface    
A port typed by required interface is both a connectable element and a structural feature of an encapsulated classifier. The required interface specifies the services that the classifier uses (requires) through the port. Requests that arrive at the port are provided by the classifier that realizes the interface specified by the port.
Shallow History
Shallow History    
A shallow history is a kind of pseudostate that acts as marker or placeholder in a composite state. It represents the state or condition of the modeled element at the time it was last exited. It is not a state itself but a diagrammatic representation or marker for the "condition" of the composite state down to a single level, at the time it was last exited.
Unified Modeling Language and UML are either registered

trademarks or trademarks of Object Management Group, Inc. in the

United States and/or other countries.