Next:
1. Introduction
Up:
Toolkit for Conceptual Modeling
Previous:
Contents
List of Figures
1.1 Using TCM in several software specification methods.
1.2 The TCM startup window.
2.1 TCM main window.
2.2 Mouse operations.
2.3 Document editors, document types and document name suffixes.
2.4 TCM File selection dialog.
2.5 TCM text edit dialog.
2.6 TCM find dialog.
2.7 TCM replace dialog.
2.8 TCM slider dialog.
2.9 TCM line style chooser dialog.
2.10 TCM line width dialog.
2.11 TCM font chooser dialog.
2.12 TCM text alignment dialog.
2.13 TCM color chooser dialog.
2.14 The result of check document on a DFD.
3.1 Three forms of edges.
3.2 An edge connects another edge.
3.3 Example diagram with some text labels.
3.4 TCM Node Alignment Dialog.
3.5 TCM line ends dialog.
3.6 All atomic diagram edit commands.
3.7 Possible node shape types to convert to.
3.8 Generic diagram nodes and edges.
4.1 Entity-relationship diagram nodes and edges.
4.2 Permitted Entity-relationship connections.
4.3 Default label positions of a binary relationship edge.
4.4 Cardinality constraint syntax.
4.5 Example taxonomic structure.
4.6 Immediately checked and soft constraints on ERDs.
4.7 Entity-relationship diagram nodes and edges.
4.8 Permitted Entity-relationship connections.
4.9 ESD Cardinality constraint syntax.
4.10 ESD Example taxonomic structure.
4.11 Immediately checked and soft constraints on ERDs.
4.12 Class-relationship diagram nodes and edges.
4.13 Permitted Class-relationship connections.
4.14 Example CR diagram, showing a relationship class.
4.15 Example class with attribute and operation definitions.
4.16 Example mode specialization.
4.17 Immediately checked and soft constraints on CRDs.
4.18 Static structure diagram nodes and edges.
4.19 Permitted Static structure connections.
4.20 Example of a n-ary association.
4.21 Example Object notations.
4.22 Example taxonomic notations.
4.23 Immediately checked and soft constraints on SSDs.
5.1 State transition diagram nodes and edges.
5.2 Default STD separator positions.
5.3 STD with events and actions.
5.4 Immediately checked and soft constraints on STDs.
5.5 Activity diagram nodes and edges.
5.6 Example decision and merge.
5.7 ATD with action states, synchronization bars and a decision.
5.8 Immediately checked and soft constraints on ATDs.
5.9 Process structure diagram nodes and edges.
5.10 Process structure operators.
5.11 Example PSD with numbered actions.
5.12 Immediately checked and soft constraints on PSDs.
5.13 Recursive process graph nodes and edges.
5.14 Example recursive process graph.
5.15 Immediately checked and soft constraints on RPGs.
5.16 Collaboration diagram nodes and edges.
5.17 Default interaction.
5.18 Immediately checked and soft constraints on CBDs.
5.19 Statechart diagram nodes and edges.
5.20 SCD with an
and-
state and
and
line.
6.1 Data flow diagram nodes and edges.
6.2 Permitted data flow diagram connections.
6.3 Data flow diagram in graph notation.
6.4 Data process index syntax.
6.5 Example splitting and merging data flows.
6.6 Immediately checked and soft constraints on DFDs.
6.7 Data and event flow diagram nodes and edges.
6.8 Permitted data and event flow diagram connections.
6.9 Immediately checked and soft constraints on EFDs (not part of TDFD).
6.10 System network diagram nodes and edges.
6.11 Permitted system network diagram connections.
6.12 Example system network diagram.
6.13 Immediately checked and soft constraints on SNDs.
6.14 Use case diagram nodes and edges.
6.15 Permitted Use case diagram connections.
6.16 Immediately checked and soft constraints on UCDs.
6.17 Component diagram nodes and edges.
6.18 Deployment diagram nodes and edges.
7.1 Snap-shot of a table being edited.
7.2 Add Row dialog window.
7.3 All atomic table edit commands.
7.4 Line style dialog.
7.5 Line width dialog.
7.6 Immediately checked and soft constraints on TDTs.
7.7 Example transaction decomposition table.
7.8 Example transaction-use table.
7.9 Immediately checked and soft constraints on TUTs.
7.10 Immediately checked and soft constraints on FETs.
7.11 Example function-entity type table partitioned into business areas.
8.1 Textual tree nodes and edges.
8.2 Example tree in edit mode.
8.3 Example tree in forked tree (view) mode.
A.1 The placement of Cardinality constraints.
A.2 The placement of role names.
A.3 The meaning of cardinality properties.
A.4 The line representation of binary relationships is direction-independent.
A.5 Reading direction of a relationship name.
A.6 Different conventions for representing the same constraints. TESD supports the convention used in the top diagram.
A.7 Different conventions for representing the same constraints. TESD supports the convention used in the top diagram.
A.8 The diamond representation for relationships.
A.9 A ternary relationship with a cardinality property.
A.10 Representation of attributes.
A.11 Representation of associative entities (line representation).
A.12 Representation of associative entities (diamond representation).
A.13 The representation of is-a relationships.
A.14 A DEFD for a robot control process.
A.15 STD for the robot control process of figure
A.14
.
A.16 The Mealy representation of state transition diagrams.
A.17 State transition diagrams.
A.18 Stereotypes and properties.
A.19 Representation of objects.
A.20 An activity diagram.
A.21 Example of a statechart.
A.22 Collaboration diagram messages.
A.23 The placement of cardinality constraints.
A.24 The placement of role names.
A.25 The meaning of cardinality constraints.
A.26 The arrow representation of many-one constraints.
A.27 The line representation of binary relationships is direction-independent.
A.28 Different conventions supported by the classic TERD editor for representing the same constraints.
A.29 Different conventions supported by the classic TERD editor for representing the same constraints.
A.30 The diamond representation for relationships.
A.31 The representation of is-a relationships.
A.32 The CRD representation of relationships.
A.33 The CRD convention can represent complex mathematical structures.
A.34 Static specialization.
A.35 A process structure diagram.
A.36 A Mealy diagram roughly equivalent to figure
A.35
.
A.37 An SND of the robot controller of figure
A.14
.
A.38 A recursive process graph.
A.39 A recursive process graph with labeled nodes.
A.40 A recursive process graph with a call to another process.
A.41 A recursive process graph with a recursive call.
C.1 The value types of attributes stored in a file.
C.2 Node types and the tools in which they occur.
C.3 Edge types and the tools in which they occur.
C.4 Node shape types and the tools in which they occur.
C.5 Line types and the tools in which they occur.
C.6 Diagram file format in the form of a class-diagram.
Henk van de Zandschulp
2003-01-20