Chapter 4
Download
1 / 45

Chapter 4 - PowerPoint PPT Presentation


  • 91 Views
  • Uploaded on

Chapter 4. SDL – Structure and Behavior. Contents. SDL – CCITT Specification and Description Language Nested blocks Process Innermost block with processes Process behavior Substructure Services SDL symbol summary. 4.1: SDL (Specification and Description Language). Purpose and scope

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' Chapter 4' - jade-estes


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
Chapter 4

Chapter 4

SDL – Structure and Behavior

SEG2101 Chapter 4


Contents
Contents

  • SDL – CCITT Specification and Description Language

  • Nested blocks

  • Process

  • Innermost block with processes

  • Process behavior

  • Substructure

  • Services

  • SDL symbol summary

SEG2101 Chapter 4


4 1 sdl specification and description language
4.1: SDL (Specification and Description Language)

  • Purpose and scope

  • Basic ideas of SDL

http://www.telelogic.com/products/tau/languages/sdl.cfm

SEG2101 Chapter 4


Purposes of sdl
Purposes of SDL

  • To specify precisely the functional properties of a system to be constructed;

  • To describe precisely the functional properties of a system as it has been constructed.

SEG2101 Chapter 4


Scope of sdl
Scope of SDL

  • Can be used in different phases of the system life cycle.

  • May be applied over a range of abstraction levels

  • Starting from very user-oriented, moving towards the very concrete and design dependent.

  • Not intended as an implementation language and should not be used to bind the realization.

  • Defined as a language and not a methodology.

SEG2101 Chapter 4


Basic ideas of sdl

SDL models independent behaviors as concurrent processes.

A precise and unambiguous definition of mutual dependency is the prime concern.

All dependencies are modeled explicitly as signals interchange between the processes and their environments.

The theoretical foundation is the theory of finite state machine.

An SDL system and its environment are conceived of as a structure of blocks connected by channels.

Basic Ideas of SDL

SEG2101 Chapter 4


Basic ideas of sdl ii

Blocks and channels may be decomposed into blocks and channels recursively until basic components, processes, are reached.

Basic Ideas of SDL (II)

SEG2101 Chapter 4


SEG2101 Chapter 4 channels recursively until basic components, processes, are reached.


Basic ideas of sdl iii
Basic Ideas of SDL (III) channels recursively until basic components, processes, are reached.

  • Signalroutes are the connectors between processes.

  • Processes in the system and the environment communicate with each other by sending signals through the signalroute and channels.

  • There is one and only one signal input queue associated with each process.

SEG2101 Chapter 4


Basic ideas of sdl iv
Basic Ideas of SDL (IV) channels recursively until basic components, processes, are reached.

Each process consists of the input port and

an extended finite state machine.

SEG2101 Chapter 4


4 2 nested blocks
4.2: Nested Blocks channels recursively until basic components, processes, are reached.

  • SDL conceives a system as a structure of blocks connected by channels and such blocks may again be partitioned into blocks on lower levels.

  • SDL systems contain concurrent processes.

  • Draw diagram to explain

SEG2101 Chapter 4


System level
System Level channels recursively until basic components, processes, are reached.

The first issue is to decide where to draw the system boundary.

SEG2101 Chapter 4


Block
Block channels recursively until basic components, processes, are reached.

Blocks are system components and are connected by channel.

SEG2101 Chapter 4


Channel
Channel channels recursively until basic components, processes, are reached.

  • Channels convey signals and there may be delay on transfer of a signal.

  • Channels connected to frame symbol represents connections to environment.

  • Channels may also be specified to have no delay and the symbol is then equivalent to the signal route symbol, I.e. the arrow heads are at the end.

SEG2101 Chapter 4


System
System channels recursively until basic components, processes, are reached.

System is represented by a frame symbol

which represents the boundary of the system.

SEG2101 Chapter 4


Block type definition
Block Type Definition channels recursively until basic components, processes, are reached.

  • Block type symbol indicates that there is a block type definition.

  • Both block reference and block type reference are graphical shorthands for diagrams.

  • The reference defines the scope of the name.

SEG2101 Chapter 4


Block set
Block Set channels recursively until basic components, processes, are reached.

  • All the block instances within a block set typically have the same relationship with its surroundings.

  • Block set is not a reference. It designates a set of block instances.

  • A channel connected to a block set will actually represent a set of channel instances.

e, C: gate

SEG2101 Chapter 4


Signal declaration
Signal Declaration channels recursively until basic components, processes, are reached.

  • It is necessary to declare all signals so that they are visible to the processes which handle them.

  • A note is an explanatory text embraced by /* … */.

  • The surrounding frame containing the textual declaration is called a text symbol.

  • There is no limit to the numbers of text symbol in a diagram.

SEG2101 Chapter 4


Signallist

A channels recursively until basic components, processes, are reached.signallist is a list of signals which has been given a name.

If a signallist contains other signallists, the signallist names will appear in parentheses. (Fig.4.2)

The signals of a channel are denoted by a list of signals (and signallist) in brackets.

Signallist

SEG2101 Chapter 4


Block nesting
Block Nesting channels recursively until basic components, processes, are reached.

  • A singular block may be seen as a block instance where block instance specification and block type definition is combined.

  • Singular block instances may be specified with reference to a block type omitting cardinality of block set specification.

  • Block types may contain a connectivity graph of block instances connected by channels.

  • At leaves there are blocks which contain processes.

  • Block type may not contain both blocks and processes at the same time.

SEG2101 Chapter 4


Sketch of localstation
Sketch of LocalStation channels recursively until basic components, processes, are reached.

SEG2101 Chapter 4


Block type localstation
Block Type LocalStation channels recursively until basic components, processes, are reached.

SEG2101 Chapter 4


Correspondence between formal description and informal description
Correspondence channels recursively until basic components, processes, are reached.between formal description and informal description

SEG2101 Chapter 4


Gate channels recursively until basic components, processes, are reached.

  • Gates are used to indicate which channels of the block types are supposed to connect to which channel connecting an instance of type.

  • e and C

  • Gate names are defined by the type and visible wherever the type name is visible.

  • Gate symbols have arrows at ends and signal lists are associated with arrows.

  • Signallists will ensure the instances of the block type are connected correctly to their surroundings.

SEG2101 Chapter 4


4 3 what is a process
4.3: What is a Process? channels recursively until basic components, processes, are reached.

  • In SDL a process is an actor object executing his own actions and having his own local (data) attributes.

  • Processes have discrete behavior.

  • Processes interact by means of signals.

  • Signals are discrete stimuli which are actively screened and processes by the receiver.

SEG2101 Chapter 4


Process
Process channels recursively until basic components, processes, are reached.

  • SDL processes are described as FSMs.

  • Process is closely related to behavior.

  • System and block definitions concentrated on static relationships.

  • Process descriptions concentrate on what is changing.

  • The structure of process is what is stable when the process behaves.

SEG2101 Chapter 4


Behavior of fsm
Behavior of FSM channels recursively until basic components, processes, are reached.

SEG2101 Chapter 4


Description of fsm by a process diagram
Description of FSM by a Process Diagram channels recursively until basic components, processes, are reached.

SEG2101 Chapter 4


Form of process diagram
Form of Process Diagram channels recursively until basic components, processes, are reached.

  • In general, each state transition has the following form.

  • In a state transition a process sits in its current state until an expected input event is received.

SEG2101 Chapter 4


4 4 innermost block with processes
4.4: Innermost Block with Processes channels recursively until basic components, processes, are reached.

  • The leaves of the block structure will contain processes.

SEG2101 Chapter 4


Sketch of panel
Sketch of Panel channels recursively until basic components, processes, are reached.

SEG2101 Chapter 4


Block panel
Block Panel channels recursively until basic components, processes, are reached.

SEG2101 Chapter 4


Process and signalroute
Process and SignalRoute channels recursively until basic components, processes, are reached.

Process symbols are connected by signalroutes.

SEG2101 Chapter 4


SEG2101 Chapter 4 channels recursively until basic components, processes, are reached.


Block lscontrol
Block LSControl channels recursively until basic components, processes, are reached.

SEG2101 Chapter 4


4 5 process behavior
4.5: Process Behavior channels recursively until basic components, processes, are reached.

  • The SDL way of describing a finite state machine (FSM).

  • Dynamic

SEG2101 Chapter 4


Process lscontrol i
Process LSControl (I) channels recursively until basic components, processes, are reached.

SEG2101 Chapter 4


Process lscontrol ii
Process LSControl (II) channels recursively until basic components, processes, are reached.

SEG2101 Chapter 4


Symbols of sdl process diagrams
Symbols of SDL Process Diagrams channels recursively until basic components, processes, are reached.

  • A frame surrounding the process diagram page separates a process from its environment.

SEG2101 Chapter 4


Start and state symbol
Start and State Symbol channels recursively until basic components, processes, are reached.

There is only one start symbol for a process.

*

-

SEG2101 Chapter 4


Input and output symbol
Input and Output Symbol channels recursively until basic components, processes, are reached.

SEG2101 Chapter 4


Output destination
Output Destination channels recursively until basic components, processes, are reached.

SEG2101 Chapter 4


Comment and asterisk input
Comment and Asterisk Input channels recursively until basic components, processes, are reached.

* means any other input than listed.

SEG2101 Chapter 4


4 8 sdl symbol summary
4.8: SDL Symbol Summary channels recursively until basic components, processes, are reached.

SEG2101 Chapter 4


Sdl symbol summary ii
SDL Symbol Summary (II) channels recursively until basic components, processes, are reached.

SEG2101 Chapter 4