State-transition diagrams (also called deterministic finite automata) are widely used to represent the behavior of systems. States are usually represented as small circles and (possible) transitions between states are represented by directed edges.

Speaking in terms of graph properties, State-transition diagrams are directed graphs.

We suggest to represent State-transition diagrams with upward drawings, i.e., drawings in which the eges tend to flow, as much as possible, in a common direction. Also, for State-transition diagrams we suggest to represent edges with smoothed lines.

The following figure shows an example of a State-transition diagram constructed with GDT.

GAPI tutorial on upward drawings and BLAG tutorial on upward drawings provide a comprehensive guide on how to use GDT to construct these widely used drawings.

 

Another possibility is to represent State-transition diagrams with polyline drawings, i.e., drawings. GAPI tutorial on polyline drawings and BLAG tutorial on plyline drawings provide a comprehensive guide on how to use GDT to construct these widely used drawings.


Last update : July 31, 2002
Website design by INTEGRA Sistemi, www.IntegraSistemi.it