Safety-liveness semantics for UML 2.0 sequence diagrams

被引：24

作者：

Grosu, R ^{[1
]}

Smolka, SA ^{[1
]}

机构：

[1] SUNY Stony Brook, Dept Comp Sci, Stony Brook, NY 11794 USA

来源：

ACSD2005: FIFTH INTERNATIONAL CONFERENCE ON APPLICATION OF CONCURRENCY TO SYSTEM DESIGN, PROCEEDINGS | 2005年

关键词：

D O I：

10.1109/ACSD.2005.31

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

We provide an automata-theoretic solution to one of the main open questions about the UML standard, namely how to assign a formal semantics to a set of sequence diagrams without compromising refinement? Our solution relies on a rather obvious idea, but to our knowledge has not been used before in this context: that bad and good sequence diagrams in the UML standard should be regarded as safety and liveness properties, respectively. Proceeding in this manner we obtain a semantics that essentially complements the set of behaviors associated with the set of sequence diagrams, thereby allowing us to use the standard notion of refinement as language inclusion. We show that refinement in this setting is compositional with respect to sequential composition, alternative composition, parallel composition, and star+ composition.

引用

页码：6 / 14

页数：9

共 27 条

[1] DEFINING LIVENESS [J].

ALPERN, B ;

SCHNEIDER, FB .

INFORMATION PROCESSING LETTERS, 1985, 21 (04) :181-185

[2]

ALPERN B, 1986, 86727 CORN U

[3]

Alur A., 1999, Automata, Languages and Programming. 26th International Colloquium, ICALP'99. Proceedings (Lecture Notes in Computer Science Vol.1644), P169

[4] Modular refinement of hierarchic reactive machines [J].

Alur, R ;

Grosu, R .

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 2004, 26 (02) :339-369

[5]

Alur R, 1999, LECT NOTES COMPUT SC, V1664, P114

[6]

Alur R, 1996, SOFTWARE-CONC TOOL, V17, P70

[7]

ALUR R, 2000, P 22 INT C SOFTW ENG

[8]

[Anonymous], 1991, SDL APPL PROTOCOL SP

[9]

[Anonymous], COMPUTER J

[10]

BENABDALLAH H, 1997, P 2 INT WORKSH TOOLS

← 1 2 3 →