slide1
Download
Skip this Video
Download Presentation
Towards a Calculus for UML-RT Specifications

Loading in 2 Seconds...

play fullscreen
1 / 8

Towards a Calculus for UML-RT Specifications - PowerPoint PPT Presentation


  • 60 Views
  • Uploaded on

Towards a Calculus for UML-RT Specifications. Radu Grosu CIS, Upenn, Philadelphia. joint work with M. Broy, B. Selic, Gh. Stefanescu. Motivation.

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 'Towards a Calculus for UML-RT Specifications' - betty


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
slide1
Towards a Calculus for UML-RT Specifications

Radu Grosu

CIS, Upenn, Philadelphia

joint work with

M. Broy, B. Selic, Gh. Stefanescu

slide2
Motivation
  • The design of real-time systemsis a difficult task. One has to consider many different aspectslike data, behavior, architecture and distribution.
  • Moreover it usuallyinvolves people from different engineering disciplines.
  • The modern SE methods UML and UML-RTrecommend the use of visual specifications.
  • A formal foundationis needed however, to prohibit ambiguities which may be fatalin this context.
the layers of uml rt
capsule-class

has

structure

behavior

controls

uses

uses

uses

uses

uses

uses

data-class

encoded

models

c++ or rpl

embedded

run-time system

The Layers of UML-RT

Implementation

Formal Semantics

componentM

has

strctureM

behaviorM

controls

models

uses

uses

models

stateM

interaction-graphs

implemented

flow-graphs

slide4
Graph Construction Primitives

A

C

n1

n2

n1

n2

n1

B1

B2

B

A

A

A

A

B

A

A

A

B

A

identification

ramification

transposition

Operators on nodes

A1

A2

A

B

C

visual attachment

sequentialcomposition

feedback

Connectors

A

A

identity

slide5
Control- and Data-Flow Models

n2

n1

n2

n1

Control-flow model

Data-flow model

n2

n1

n2

n1

slide6
Tightening

Sliding

A

A

A

A

m

m

C

C

C

B

B

n

m

=

=

C

n

n

D

D

D

m

n

D

p

p

B

B

E

E

Two Feedback Laws

slide7
m

m

m

m

m

m

m

n

n

n

n

m

A Graph Transformation

=

=

=

=

n

tightening

morphism

tightening

sliding

slide8
Conclusions

We showed how to combinemodular specifications of controlanddata-flow.

Practical relevance:

concise, compositionalsemantics forstatecharts

basis forcompositional hybrid statecharts

clear foundation forexecution-tools

Theoretical relevance:

semantics of interactionasmixed graph algebras

clear foundation forverification-tools

ad