Previous Next Functional Tool Requirements Homepage  
System Development Submodel  
SSD08 - Supporting Modeling of Function Dynamics  

  LSE08 - Modellierung der Funktionsdynamik unterstützen

Contents  
  • 1 Allocation to V-Model and Methods Allocation
  • 2 Brief Characteristics
  • 3 Requirements
  •       3.1 Requirements for Interfaces
  •       3.2 Requirements for the Methods Support
  •       3.3 Requirements for Functions
  •       3.4 Other Requirements
  • 1 Allocation to V-Model and Methods Allocation

    V-Model

    SD1.5 - User-Level System Structure

  • User Requirements.Description of the Functionality
  • SD3.3 - Definition of Requirements for the Functionality

  • Technical Requirements.Overall Function of Element
  • Method

    FNET - Function Net Modeling
    SBM - System Behavior Models

    2 Brief Characteristics

    This service unit defines the requirements for tools applied for the modeling of dynamic aspects of various functions in an application. The timing of functions is described in sequences in order to observe the behavior of applications that are not working sequentially.

    3 Requirements

    3.1 Requirements for Interfaces

    SSD08.I.1 Granularity The exchange of control parameters with SWFM01 - Workflow Management is possible for individual closed function packages of the tool by means of a disclosed, documented interface.
    SSD08.I.2 Input interface to SSD05 - Supporting Function Structure Functions from functional structures entered with SSD05 are transferred without further transformation from the object management in order to be automatically integrated into sequence models.
    The functions defined in SSD05 correspond to the functions applied in the sequence models.
    SSD08.I.3 Output interface to SQA14 - Generation of Test Cases It is possible to transmit sequence models without further transformation via the object management to SQA14 in order to generate test cases.

    3.2 Requirements for the Methods Support

    SSD08.M.1 FNET - Function Net Modeling
    SSD08.M.1.1 Symbols
    SSD08.M.1.1.1 Functions Symbols are available for the representation of functions.
    SSD08.M.1.1.2 Conditions Symbols are available for the representation of conditions.
    SSD08.M.1.1.3 Trigger Symbols are available for the representation of triggers.
    SSD08.M.1.1.4 Distributor Symbols are available for the representation of distributors.
    SSD08.M.1.1.5 Flow-chart arrows Symbols are available for the representation of flow-chart arrows.
    SSD08.M.1.1.6 Tokens Symbols are available for the representation of tokens.
    SSD08.M.1.2 Description of conditions
    SSD08.M.1.2.1 Data conditions It is possible to mark conditions as data conditions.
    SSD08.M.1.2.2 Time conditions It is possible to mark conditions as time conditions.
    SSD08.M.1.2.3 State conditions It is possible to mark conditions as state conditions.
    State conditions may be data conditions but they may also describe state changes in an information system.
    SSD08.M.1.3 Logical expressions for triggers It is possible to describe triggers by logical expressions.
    SSD08.M.1.4 Logical expressions for distributors It is possible to describe distributors by logical expressions.
    SSD08.M.1.5 Trigger for functions It is guaranteed that each function has been allocated exactly one trigger.
    SSD08.M.1.6 Distributor of functions It is guaranteed that each function has been allocated at least one distributor.
    SSD08.M.1.7 Sequence begin It is guaranteed that each sequence always begins with a data or time condition.
    SSD08.M.1.8 Sequence end It is guaranteed that each sequence always ends with a data condition.
    SSD08.M.2 SBM - System Behavior Models
    SSD08.M.2.1 Petri Nets
    SSD08.M.2.1.1 Symbols
    SSD08.M.2.1.1.1 Symbols for instances A symbol is available for the representation of instances (events, transitions).
    SSD08.M.2.1.1.2 Symbols for channels Symbols are available for the representation of channels (conditions, places, predicates).
    SSD08.M.2.1.1.3 Symbols for edges Symbols are available for the representation of edges between instances and channels.
    SSD08.M.2.1.1.4 Symbols for tokens Symbols are available for the representation of tokens.
    SSD08.M.2.1.2 Capacities It is possible to allocate capacities to channels.
    The capacity determines the maximum number of tokens that can be accepted by a channel at one time.
    SSD08.M.2.1.3 Weighting It is possible to allocate weights to edges.
    The weight refers to the number of tokens that can be taken from or fed into a channel at one state transition.
    SSD08.M.2.1.4 Initial assignment It is possible to specify an initial assignment for channels.
    SSD08.M.2.1.5 Switching rules It is possible to specify semantic definitions for the switching of an instance.
    The switching rules either result from the type of the net in question (condition/event net, place/transition net) or they are defined in the form of a description in a programming language (predicate/transition net).
    SSD08.M.2.1.6 Time conditions It is possible to add time conditions to instances.
    SSD08.M.2.1.7 Hierarchical nets
    SSD08.M.2.1.7.1 Refinement In a hierarchy, it is possible to refine nets in a top-down manner.
    SSD08.M.2.1.7.2 Summary In a hierarchy, it is possible to summarize nets in a bottom-up way.
    SSD08.M.2.1.8 Fusion It is possible to utilize a component existing only once in a net (channel, instance) in multiple graphical instantiations.
    SSD08.M.2.2 State charts
    SSD08.M.2.2.1 Symbols
    SSD08.M.2.2.1.1 Symbols for states A symbol is available for the representation of states.
    SSD08.M.2.2.1.2 Symbols for events A symbol is available for the representation of transitions.
    SSD08.M.2.2.2 Events It is possible to allocate events to transitions.
    SSD08.M.2.2.3 Attributes It is possible to describe events by means of attributes.
    SSD08.M.2.2.4 Event classes It is possible to define event classes.
    SSD08.M.2.2.5 Conditions It is possible to allocate conditions (logical expressions) to transitions.
    Transitions are controlled by conditions. A state transition can only take place if-apart from the event taking place-all conditions are met as well.
    SSD08.M.2.2.6 Actions It is possible to allocate actions to transitions.
    Actions are linked to events. An action represents an operation the length of which is not significant as compared to the time basis of the state chart (example: display of a menu when pressing a mouse button).
    SSD08.M.2.2.7 Activities It is possible to allocate activities to states.
    Actions are operations the execution of which requires time. An activity begins with the occurrence of a state and terminates either normally by an event taking place causing a state change.
    SSD08.M.2.2.8 Linking state charts It is possible to link state charts via shared events.
    SSD08.M.2.2.9 Hierarchical state charts
    SSD08.M.2.2.9.1 Refinement In a hierarchy, it is possible to refine state chart states in a top-down manner.
    SSD08.M.2.2.9.2 Summary In a hierarchy, it is possible to summarize state charts in a bottom-up manner.
    SSD08.M.2.3 Specification and Description Language (SDL)
    SSD08.M.2.3.1 Symbols
    SSD08.M.2.3.1.1 Symbols for block interaction diagrams Symbols are available for environment, block, process, signal list, channel, signal path, create.
    SSD08.M.2.3.1.2 Symbols for process diagrams Symbols are available for start, state, next state, input, output, task, create request, flow line, decision, save, definition, procedure and macro calls, input and output connector, comment, text extension.
    SSD08.M.2.3.2 Notations
    SSD08.M.2.3.2.1 Textual notations In connection with the graphic symbols, the possibility exists for semantically meaningful textual notations at syntactically legal positions.
    SSD08.M.2.3.2.2 Notations for further SDL entities Textual notations exist for signal enumeration, signal definition, formal parameters, valid input signal set, variable definition, view definition, viewing expression in a textual SDL syntax.
    SSD08.M.2.3.2.3 Names and identifiers Textual notations exist for names and identifiers (= name and qualifier) in a textual SDL syntax for the unique identification of all SDL entities where this is semantically required.
    SSD08.M.2.3.3 Rules
    SSD08.M.2.3.3.1 Static rules It is not possible to link entities contrary to the static link rules of SDL.
    SSD08.M.2.3.3.2 Dynamic rules When executing a given system description, the dynamic semantic of the signal processing is observed (signal storage in the process input waiting queue, save mechanism, zero transitions).
    SSD08.M.2.3.4 Structuring characteristics
    SSD08.M.2.3.4.1 Hierarchical refinement It is possible to hierarchically refine blocks and processes to any depth.
    SSD08.M.2.3.4.2 Block tree diagrams It is possible to decompose an individual block into subblocks and to use them together to generate a block tree diagram. It is also possible to represent the entire decomposition of a System into blocks and subblocks as a block tree diagram showing an arbitrary depth and beginning with the block "System".
    SSD08.M.2.3.4.3 Process tree diagram It is possible to decompose an individual process into subprocesses and to use them together to generate a process tree diagram. It is also possible to represent the entire decomposition of a System as a process tree diagram showing an arbitrary depth.
    SSD08.M.2.3.4.4 Process block allocation It is possible to allocate processes or subprocesses uniquely to individual blocks or subblocks by means of symbols.

    3.3 Requirements for Functions

    none

    3.4 Other Requirements

    SSD08.O.1 Upward compatibility It must be possible to process objects generated with an older release of the tool with the later release of that tool, without loss of information and functionality.
    SSD08.O.2 Procedural command language The tool has a procedural command language that can be applied by the user to generate and run macros or procedures.
    SSD08.O.3 Complexity There is no limitation of the complexity caused by the tool itself.

    Previous Next GDPA Online Last Updated 01.Jan.2002 Updated by Webmaster Last Revised 01.Jan.2002 Revised by Webmaster