![]() |
![]() |
![]() |
|
| Annex 2 | |||
| 2.6 The Complex Method SDL |
SDL - Specification and Description Language
Contents
|
|
|---|
1 Brief Description
The methodical components of SDL are:
Blocks, processes, and channels can be optionally decomposed into subitems of the same type. For a clear representation of the logical dependences created in this connection, the graphical syntax of SDL includes block or respectively process tree diagrams.
For the exact functional specification, blocks are finally decomposed into processes. These processes define the dynamic characteristics of the information processing of the parent block.
They are a language for the specification of the interaction between blocks as a whole.
They are a language for the specification of the interaction between the states and the input signals of a process.
Based on its formal, correct syntax and semantics, SDL specifications can be applied for automatic consistency checks. In this connection, user errors are discovered at an early stage.
The conception of the SDL syntax considered best possible mapping of SDL specifications onto higher programming languages (CHILL, C) and networks.
They specify type and relative sequence of the signals that must be exchanged between processes.
Message Sequence Charts are Time Sequence Diagrams specially designed for the cooperation with SDL.
2 Tabular Comparison
3 Specification of the Allocation
| Method | Corresponding Component in SDL | Explanation |
|---|---|---|
|
DFM Data Flow Modeling | BID Block Interaction Diagram /SDL, 1985a/, Z.100, chap. 2.4 | In the static semantic, data flows and channels or respectively DFM processes and SDL blocks are very similar, with the exception of the data itself. In SDL these data are type-bound signals right from the beginning. In the dynamic semantic, DFM processes, SDL blocks, and SDL processes are very different from each other. With regard to DFM it is assumed (in a simplified way) that a process automatically generates output data, i. e. if all input data are available. SDL blocks, however, have no dynamic behavior; this is exclusively found in the SDL processes contained in the block. |
|
FCTD Functional Decomposition | HD Hierarchical Decomposition, /SDL, 1985a/, Z.102, chap. 2.1 BP Decomposition of Blocks into Processes, /SDL, 1985a/, Z.100, chap. 2.2 | The basic characteristics of the FCTD correspond to those in the SDL to a great extent. It must be noted that new blocks are generated in connection with the refinement of channels. Furthermore, process tree diagrams must be adjusted to the corresponding block tree diagrams by taking into consideration certain consistency rules. |
|
CFM Control Flow Modeling | (with limitations since only STM processes) PD Process Diagram /SDL, 1985a/, Z.100, chap. 2.2 |
SDL contains no directly corresponding methodical component to CFM. However, the functionality of CFM is contained in SDL in a distributed way. Based on two reasons, a direct correspondence is not possible: SDL does not separate control and data information but signals which might basically contain both. Also, SDL does not differentiate between (data processing) processes (PSPECs) and control information processing (CSPECs); it only contains a basic process type that is always a sequential automaton, processing all of the information. Furthermore, SDL does not contain a store (that can be overwritten) according to CFM and DFM. The methodically advantageous separation of the processing of control and data information (as in DFM and CFM) can be reconstructed in SDL, if required. In this connection, all SDL (control of a decomposition level) processes are combined in one SDL block, and the only task of the SDL block is to control the activity of the remaining processes in the other blocks. |
|
PIM Process Interaction Modeling |
PD Process Diagram /SDL, 1985a/, Z.100, chap. 2.2 Time Sequence Diagrams /SDL, 1991/, chap.9.1.3, 9.4.1 Message Sequence Chart (MSC), /SDL, 1992/, Z.120 | Though the time sequence diagrams listed in /SDL, 1991/ are no integral part of the SDL standard, they are a particularly appropriate technique for the cooperation with SDL. /SDL, 1992/ contains a version of this technique upgraded into a method that is applicable for the integration with SDL. Time Sequence Diagrams and the simpler forms of Message Sequence Charts largely correspond to PIM. |
|
SIMU Simulation Models |
PD Process Diagram /SDL, 1985a/, Z.100, chap. 2.2 Time Sequence Diagrams /SDL, 1991/, chap.9.1.3, 9.4.1 Message Sequence Chart (MSC), /SDL, 1992/, Z.120 | The exactly defined dynamic semantic of SDL permits the access to the SDL design of an automatic interpretation. Thus-when working with SDL-it is not necessary to construct a separate simulation model within the scope of SIMU but the available SDL design can be utilized by means of corresponding tools. The generation of the required scenario data can be supported by means of Time Sequence Diagrams or Message Sequence Charts. |
|
STAT Static Analysis | GS Validity Concept /SDL, 1985a/, Z.100, chap. 2.1, 3 /SDL, 1985a/, Z.101, chap. 2, 4 | SDL specifications are formal structures that have to meet the syntax and semantics defined in /SDL, 1985a/, Z.101, chap. 2 and 4. Therefore they are open for a tool-supported consistency check in which connection user errors in the sense of STAT are detected at an early stage. It must be stressed that the assessability also refers to the dynamic semantics (s. /SDL, 1985a/, Z.100, chap. 2.1, "Specification Error"). |
|
SBM System Behavior Models | PD Process Diagram /SDL, 1985a/, Z.100, chap. 2.2 | The SDL concepts generally aim at uniquely specifying the dynamic behavior of an event-oriented real-time system with concurrent processes. Since SDL specifications are also formal, SDL meets the SBM requirements completely. In connection with the SDL application, special attention must be paid to the characteristics of the automaton model and the communication concept (e. g. signal input queue, possible zero transitions when utilizing signals). |
|
T Test | MAP Mapping /SDL, 1985b/, Annex D, chap. D.8.1 | The dynamic semantics of SDL makes it possible to execute an available SDL design by means of the corresponding tools. Those tools usually contain a test frame (i. e. the interpreter for the execution) as well as test recording features. The generation of the required test cases can be supported by means of Time Sequence Diagrams or Message Sequence Charts. The high degree of detail and the comprehensibility of SDL specifications based on the Type and Visibility concepts support the definition of test cases rich in content. Furthermore, MAP supports the automatic generation of source code from an SDL design and the corresponding test while eliminating transformation errors due to human failure. |
|
STM State Transition Modeling | PD Process Diagram /SDL, 1985a/, Z.100, chap. 2.2 | The basic concept of the upgraded sequential automaton utilized for the process diagram in SDL is identical to model STM. The structural peculiarities of the SDL processes consist in local data, additional branching, and the fact that only one waiting queue exists for all input signals of a process (no separate waiting queue for individual process states). |
4 Literature
![]() |
![]() |
GDPA Online
Last Updated 01.Jan.2002
Updated by Webmaster
Last Revised 01.Jan.2002
Revised by Webmaster
![]() |