Next: 1 Introduction
Up: Toolkit for Conceptual Modeling
Previous: Contents
- Using TCM in several software specification methods.
- The TCM startup window.
- TCM main window.
- Mouse operations.
- Document editors, document types and document name suffixes.
- TCM File selection dialog.
- TCM text edit dialog.
- TCM find dialog.
- TCM replace dialog.
- TCM slider dialog.
- The result of check document on a DFD.
- Three forms of edges.
- Example diagram with some text labels.
- All atomic diagram edit commands.
- Generic diagram nodes and edges.
- Entity-relationship diagram nodes and edges.
- Permitted Entity-relationship connections.
- Default label positions of a binary relationship edge.
- Cardinality constraint syntax.
- Example taxonomic structure.
- Immediately checked and soft constraints on ERDs.
- Class-relationship diagram nodes and edges.
- Permitted Class-relationship connections.
- Example CR diagram, showing a relationship class.
- Example object class with attribute and action definitions.
- Example mode specialization.
- Immediately checked and soft constraints on CRDs.
- State transition diagram nodes and edges.
- Default STD separator positions.
- STD with events and actions.
- Immediately checked and soft constraints on STDs.
- Process structure diagram nodes and edges.
- Process structure operators.
- Example PSD with numbered actions.
- Immediately checked and soft constraints on PSDs.
- Recursive process graph nodes and edges.
- Example recursive process graph.
- Immediately checked and soft constraints on RPGs.
- Data flow diagram nodes and edges.
- Permitted data flow diagram connections.
- Data flow diagram in graph notation.
- Data process index syntax.
- Example splitting and merging data flows.
- Immediately checked and soft constraints on DFDs.
- Data and event flow diagram nodes and edges.
- Permitted data and event flow diagram connections.
- Immediately checked and soft constraints on DEFDs (not part of TDFD).
- System network diagram nodes and edges.
- Permitted system network diagram connections.
- Example system network diagram.
- Immediately checked and soft constraints on SNDs.
- Snap-shot of a table being edited.
- All atomic table edit commands.
- Immediately checked and soft constraints on TDTs.
- Example transaction decomposition table.
- Example transaction-use table.
- Immediately checked and soft constraints on TUTs.
- Immediately checked and soft constraints on FETs.
- Example function-entity type table partitioned into business areas.
- Textual tree nodes and edges.
- Example tree in edit mode.
- Example tree in forked tree (view) mode.
- The value types of attributes stored in a file.
- Node types and the tools in which they occur.
- Edge types and the tools in which they occur.
- Node shape types and the tools in which they occur.
- Line types and the tools in which they occur.
- Diagram file format sections seen as a CRD.
- The placement of cardinality constraints.
- The placement of role names.
- The meaning of cardinality constraints.
- The arrow representation of many-one constraints.
- The line representation of binary relationships is direction-independent.
- Different conventions for representing the same constraints.
TCM supports the conventions used in the upper two diagrams.
- Different conventions for representing the same constraints.
TCM supports the conventions used in the upper two diagrams.
- The diamond representation for relationships.
- The representation of is-a relationships.
- The CRD representation of relationships.
- The CRD convention can represent complex mathematical structures.
- Static specialization.
- The Mealy representation of state
transition diagrams.
- A process structure diagram.
- A Mealy diagram roughly equivalent
to figure C.14.
- A recursive process graph.
- A recursive process graph with labeled nodes.
- A recursive process graph with a call to another process.
- A recursive process graph with a recursive call.
- A DEFD for a robot control process.
- STD for the robot control process of figure C.20.
- An SND of the robot controller of figure C.20.
Frank Dehne,Faculty of Mathematics and Computer Science, Vrije Universiteit Amsterdam
11/17/1997