SDL-2000 Foil no 1 1999-10-25 Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson SDL-2000 = SDL-96 + UML + - New ITU-T SG10 recommendations, due.

Slides:



Advertisements
Similar presentations
Numbers Treasure Hunt Following each question, click on the answer. If correct, the next page will load with a graphic first – these can be used to check.
Advertisements

1
Chapter 7 System Models.
Chapter 7 Constructors and Other Tools. Copyright © 2006 Pearson Addison-Wesley. All rights reserved. 7-2 Learning Objectives Constructors Definitions.
Copyright © 2003 Pearson Education, Inc. Slide 1 Computer Systems Organization & Architecture Chapters 8-12 John D. Carpinelli.
Copyright © 2003 Pearson Education, Inc. Slide 1.
Chapter 1 The Study of Body Function Image PowerPoint
Processes and Operating Systems
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 1 Embedded Computing.
Copyright © 2011, Elsevier Inc. All rights reserved. Chapter 6 Author: Julia Richards and R. Scott Hawley.
Author: Julia Richards and R. Scott Hawley
1 Copyright © 2013 Elsevier Inc. All rights reserved. Appendix 01.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 3 CPUs.
Properties Use, share, or modify this drill on mathematic properties. There is too much material for a single class, so you’ll have to select for your.
UNITED NATIONS Shipment Details Report – January 2006.
RXQ Customer Enrollment Using a Registration Agent (RA) Process Flow Diagram (Move-In) Customer Supplier Customer authorizes Enrollment ( )
David Burdett May 11, 2004 Package Binding for WS CDL.
Writing Pseudocode And Making a Flow Chart A Number Guessing Game
1 RA I Sub-Regional Training Seminar on CLIMAT&CLIMAT TEMP Reporting Casablanca, Morocco, 20 – 22 December 2005 Status of observing programmes in RA I.
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Properties of Real Numbers CommutativeAssociativeDistributive Identity + × Inverse + ×
Exit a Customer Chapter 8. Exit a Customer 8-2 Objectives Perform exit summary process consisting of the following steps: Review service records Close.
Create an Application Title 1A - Adult Chapter 3.
FACTORING ax2 + bx + c Think “unfoil” Work down, Show all steps.
Conceptual / semantic modelling
REVIEW: Arthropod ID. 1. Name the subphylum. 2. Name the subphylum. 3. Name the order.
Week 2 The Object-Oriented Approach to Requirements
Turing Machines.
PP Test Review Sections 6-1 to 6-6
EU market situation for eggs and poultry Management Committee 20 October 2011.
Bright Futures Guidelines Priorities and Screening Tables
Chapter 3 Basic Logic Gates 1.
Chapter 4 Gates and Circuits.
CS 6143 COMPUTER ARCHITECTURE II SPRING 2014 ACM Principles and Practice of Parallel Programming, PPoPP, 2006 Panel Presentations Parallel Processing is.
Exarte Bezoek aan de Mediacampus Bachelor in de grafische en digitale media April 2014.
VOORBLAD.
Name Convolutional codes Tomashevich Victor. Name- 2 - Introduction Convolutional codes map information to code bits sequentially by convolving a sequence.
Copyright © 2012, Elsevier Inc. All rights Reserved. 1 Chapter 7 Modeling Structure with Blocks.
1 RA III - Regional Training Seminar on CLIMAT&CLIMAT TEMP Reporting Buenos Aires, Argentina, 25 – 27 October 2006 Status of observing programmes in RA.
Factor P 16 8(8-5ab) 4(d² + 4) 3rs(2r – s) 15cd(1 + 2cd) 8(4a² + 3b²)
Basel-ICU-Journal Challenge18/20/ Basel-ICU-Journal Challenge8/20/2014.
1..
StateChart Diagrams State Machines Overview Change summary –core constructs –notation Examples Backward compatibility User benefits Issues.
CONTROL VISION Set-up. Step 1 Step 2 Step 3 Step 5 Step 4.
© 2012 National Heart Foundation of Australia. Slide 2.
Adding Up In Chunks.
Page 1 of 43 To the ETS – Bidding Query by Map Online Training Course Welcome This training module provides the procedures for using Query by Map for a.
آزمایشگاه مهندسی نرم افزار
Model and Relationships 6 M 1 M M M M M M M M M M M M M M M M
25 seconds left…...
Chapter 2 Entity-Relationship Data Modeling: Tools and Techniques
Chapter 10: The Traditional Approach to Design
Analyzing Genes and Genomes
Systems Analysis and Design in a Changing World, Fifth Edition
©Brooks/Cole, 2001 Chapter 12 Derived Types-- Enumerated, Structure and Union.
Essential Cell Biology
Intracellular Compartments and Transport
PSSA Preparation.
Essential Cell Biology
Immunobiology: The Immune System in Health & Disease Sixth Edition
Energy Generation in Mitochondria and Chlorplasts
Modeling Main issues: What do we want to build How do we write this down.
1 Decidability continued…. 2 Theorem: For a recursively enumerable language it is undecidable to determine whether is finite Proof: We will reduce the.
SDL as an Object Oriented Language Lecture 6 Huma Ayub Software Engineering Department 1.
FDT Foil no 1 Overall Methodology – from Engineering RT Systems through TIMe; to RAM. Covering the full development cycle Supporting the whole company.
SDS Foil no 1 SDL – Inheritance. SDS Foil no 2 Controller behaviour to Central Validation Idle Code (cid,PIN) Code(cid, PIN) via U Validation virtual.
Presentation transcript:

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson SDL-2000 = SDL-96 + UML + - New ITU-T SG10 recommendations, due November 1999: SDL-2000 (Z.100) SDL combined with UML (SDL UML Profile - Z.109) MSC-2000 (Z.120) New ITU-T SG10 recommendations, due November 1999: SDL-2000 (Z.100) SDL combined with UML (SDL UML Profile - Z.109) MSC-2000 (Z.120) UML: Class diagrams State Machines Collaborations Sequence diagrams Deployment... SDL UML profile: stereotypes,... SDL 2000: Type references Composite states Actors... MSC 2000:

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson Using the UML SDL Profile... with stereotyped classes... and associations, in this case specialisation with stereotyped classes... and associations, in this case specialisation «block» AccessPoint «block» LoggingAccessPoint «block» BlockingAccessPoint

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson... or with the graphical alternative to stereotypes AccessPoint LoggingAccessPoint BlockingAccessPoint

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson... part of the SDL model has been specified package AccessPointLib «block» AccessPoint LoggingAccessPoint « block» BlockingAccessPoint AccessPoint As alternative to

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson Including the type diagrams block type LoggingAccessPoint inherits AccessPoint block type BlockingAccessPoint inherits AccessPoint block type AccessPoint

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson «signal» ReleaseCard, Cid, Digit, OK, NOK, ERR cur_panel :PId cid : int PIN : int OpenDoor() « process » AccessPoint::Controller « process » Door « process » Panel « block » AccessPoint Associations, attributes and operations can be specified on types... Note that the part (object) structure is not specified by this!

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson This is the part structure e signal opened,closed; signal open, close; C d unlock, lock isOpen, isClosed open, close (validity) code (outp) (inp) opened, closed code (validity) block type AccessPoint c: Controller d: Door p: Panel a type composed from a structure of instances

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson How to make this into an SDL diagram?

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson Use dependencies between packages and systems AccessPointLib SignalLib AccessControl «system»

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson system type AccessControl CentralUnit ap(100): AccessPoi nt ce d The corresponding package reference associated with each diagram in SDL [(inp)] [(outp)] [(validity)][Code] unlock, lock isOpen, isClosed use AccessPointLib bp(10): Blocking AccessPoi nt ce d [(inp)] [(outp)] [(validity)][Code] unlock, lock isOpen, isClosed lp(20): Logging AccessPoi nt ce d [(inp)] [(outp)] [(validity)][Code] unlock, lock isOpen, isClosed

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson Composite states States with states and transitions, separate state diagrams, entry/exit points state overview diagrams state types and subtypes virtual states parameterized state types Combining State-orientation of Statecharts Transition-orientation of today’s SDL States with states and transitions, separate state diagrams, entry/exit points state overview diagrams state types and subtypes virtual states parameterized state types Combining State-orientation of Statecharts Transition-orientation of today’s SDL

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson OutOfServiceReleaseCard VerifyTransaction ReadAmount VerifyCard EnterAmount SelectAmount acceptCard(account) Amount (amount) otherAmount ok abort outOfService abort rejectTransaction UML 1.x State chart

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson process type ATM dcl account Account, amount Integer; ReadAmount via reenter display ('Limit exceeded') Reject Transaction VerifyCard acceptCard (account) transaction (account,amount) Verify Transaction ejectCard ReleaseCard outOfService OutOfService aborted ReadAmount SDL Composite States by means of state references

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson and Separate State Diagrams with entry/exit points scalability encapsulation aborted reenter state ReadAmount dcl nbr Integer; Display ('Select amount') SelectAmount amount(amount) otherAmount Display ('Enter amount') EnterAmount digit(nbr) amount := amount * 10 + nbr - ok * abort reenter amount := 0 aborted

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson Combines with existing mechanisms outOfService ReadAmount, anotherState, yetAnotherState outOfService * (ReadAmount) outOfService * State list All states All states, except

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson state ReadPIN * help display (helpMessage) - Internal transitions using existing mechanisms of SDL: * state - nextstate

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson process type ATM aborted VerifyCard ReadAmount VerifyTransactionReleaseCard State Overview Diagrams notAccepted Including only states, exits from states next states - details of transitions in separate diagrams Not a special kind of diagram, just a way to use composite states!

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson state ReadAmount * ok abort aborted state VerifyCard * notAccepted notOkok Detailed Transitions in State Diagrams

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson process type ATM aborted VerifyCard Read: ReadAmount VerifyTransactionReleaseCard State types notAccepted in order to use the same composite state definition in several situations. States can be type- based.

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson state type ReadAmount * ok abort aborted state VerifyCard * notAccepted notOkok

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson State type inheritance State type may be a specialisation of supertype by: inheriting states and transitions adding states and transitions redefining virtual procedures, among them enter & exit redefining virtual states and virtual transitions State type may be a specialisation of supertype by: inheriting states and transitions adding states and transitions redefining virtual procedures, among them enter & exit redefining virtual states and virtual transitions « state » ReadAmount « state » HelpfulReadAmount Enter() {virtual} Exit() Enter() {redefined} Exit() for any composite state type, not only the topmost state

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson state type HelpfulReadAmount inherits ReadAmount State type inheritance * help display (helpMessage) - As it is specified in the state type diagram in this case adding a help transtion to all states within HelpfulReadAmount

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson process type SimpleATM VerifyCard acceptCard (account) virtual ReadAmount virtual aborted Transaction (account,amount) VerifyTransactionReleaseCard Virtual states In order to specify which states can be redefined in a specialization. A virtual state has a constraint, and can only be redefined as an extension of the constraint.

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson virtual state ReadAmount display ('Select amount') SelectAmount amount(amount) * abort aborted The default constraint is the composite state itself, so redefinitions give extensions of the composite state.

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson process type ATM inherits SimpleATM ReleaseCard ejectCard redefined aborted redefined ReadAmount Redefinition of a virtual state A redefined state is still virtual and can be redefined in a specialization. Alternatively, a finalized state is a redefinition that can not be further redefined (like Java’s final).

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson redefined state type ReadAmount dcl nbr Integer; SelectAmount otherAmount display ('Enter amount') EnterAmount digit(nbr)ok amount := amount * 10 + nbr - State diagram of a redefined state These states and transitions are added to the states and transitions of the virtual state.

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson AccessPoint d unlock, lock isOpen, isClosed c (validity) code e (outp) (inp) Agents Agents: the main objects of SDL-2000 unifies system, block, process, service has either behaviour or agent structure or both Specified from the outside by means of interfaces and gates

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson e signal opened,closed; signal open, close; C d unlock, lock isOpen, isClosed (validity) code (outp) (inp) open, close opened, closed code (validity) AccessPoint Door Panel AccessPoint

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson Agent behaviour as state to Central Validation Idle Code (cid,PIN) Code(cid, PIN) via U Validation virtual OK to cur_panel cur_panel := sender NOK to cur_panel Idle State AccessPoint dcl cur_panel PId ; /* current panel whose Code will be validated */ dcl cid, PIN integer ; /* temporary variables for the data attributes of 'Code' */ 1(2) [Code] [(validity)] [opened,closed] [open,close] [(validity)] [Code] P D U Opening Open /* to Door */

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson e signal opened,closed; signal open, close; C d unlock, lock isOpen, isClosed open, close (validity) code (outp) (inp) opened, closed code (validity) dcl noOfTries Integer; block type AccessPoint Concurrent or alternating entities I AccessPoint Panel Door

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson e signal opened,closed; signal open, close; C d unlock, lock isOpen, isClosed open, close (validity) code (outp) (inp) opened, closed code (validity) dcl noOfTries Integer; block type AccessPoint Concurrent or alternating entities II AccessPoint Door Panel

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson e signal opened,closed; signal open, close; C d unlock, lock isOpen, isClosed open, close (validity) code (outp) (inp) opened, closed code (validity) dcl noOfTries Integer; process type AccessPoint Concurrent or alternating entities III AccessPoint Door Panel

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson Object oriented data model object types - reference assignment value types - value assignment (virtual/redefined/finalised) operators and methods inheritance Makes SDL independent of implementation language for data handling Provides data modeling in the spirit of Java, C++, with UML-like graphics, SDL-like textual, - and with SDL semantics object types - reference assignment value types - value assignment (virtual/redefined/finalised) operators and methods inheritance Makes SDL independent of implementation language for data handling Provides data modeling in the spirit of Java, C++, with UML-like graphics, SDL-like textual, - and with SDL semantics

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson Example - object types object type Event struct day Day; month Month; methods virtual possible -> Boolean; endobject type; object type Appointment inherits Event fromTime, toTime Time; methods redefined possible; endobject type;

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson value type Time struct hour Natural; minute Natural; endvalue type; value type RealTime inherits Time delay Natural; endvalue type; Example - value types

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson Data types – also by means of class symbols fromTime : Time toTime : Time day : Day month : Month possible( ) « object » Event « object » Entry delay : Natural hour : Natural min : Natural « value » Time « value » RealTime

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson Action language I Action language (textual) in task symbols and procedures C++, Java like syntax, compounds, loop constructs, etc. Makes SDL independent of C and any implementation language (a closed language) Action language (textual) in task symbols and procedures C++, Java like syntax, compounds, loop constructs, etc. Makes SDL independent of C and any implementation language (a closed language) dcl i1, i2 Integer; i1 := (x / 5) + 1; i1 := i1 * 2;... {...}...

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson Action language II Idle Code (cid,PIN) Validation virtual OK cur_panel := sender; output Code(cid,PIN) via U; NOK to cur_panel Idle state AccessPoint dcl cur_panel PId ; /* current panel whose Code will be validated */ dcl cid, PIN integer ; /* temporary variables for the data attributes of 'Code' */ 1(2) [Code] [(validity)] [opened,closed] [open,close] [(validity)] [Code] P D U Validation Idle Opening output OK to cur_panel; output Open;

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson SDL combined with UML SDL for: Systems Composite types Object structures Complete behaviour MSC for: Message sequences SDL for: Systems Composite types Object structures Complete behaviour MSC for: Message sequences UML for: Classes (type references) and Associations UML in SDL UML SDL in UML SDL Integrated tool provides both views

SDL-2000 Foil no Rolv Bræk; NTNU, SINTEF Birger Møller-Pedersen; Ericsson How this is achieved SDL UML Profile (Z.109) Specialisation of UML that maps to SDL by stereotypes: «system», «block», «process», «service», «procedure», «signal», «object», «value», «state» SDL Graphics Extensions (Z.100) Class symbols as combined type references and partial type definitions Package symbols and dependency between these Generalisation relationship for specialisation Parameterised class for type with context parameters Composition for containment General associations as comments Approved by ITU-T SG10 November 1999 SDL UML Profile (Z.109) Specialisation of UML that maps to SDL by stereotypes: «system», «block», «process», «service», «procedure», «signal», «object», «value», «state» SDL Graphics Extensions (Z.100) Class symbols as combined type references and partial type definitions Package symbols and dependency between these Generalisation relationship for specialisation Parameterised class for type with context parameters Composition for containment General associations as comments Approved by ITU-T SG10 November 1999