回顾UML通信图

Ahmad Alsaadi
{"title":"回顾UML通信图","authors":"Ahmad Alsaadi","doi":"10.1109/ICSEA.2007.76","DOIUrl":null,"url":null,"abstract":"This paper shows how the communication-diagram mechanism can be supplied with concepts, so that each collaboration can be specified. It enriches sequence expressions of messages with sub-terms that denote: Types of control structures choice, concurrence, and repetition of messages; and Complete information about their guarded branches, parallel threads, and iterative messages. Furthermore, each concatenation of these sub-terms maps onto an interlacement of message structures in an abstraction level or within levels of abstraction.","PeriodicalId":395851,"journal":{"name":"International Conference on Software Engineering Advances (ICSEA 2007)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The UML Communication Diagram Revisited\",\"authors\":\"Ahmad Alsaadi\",\"doi\":\"10.1109/ICSEA.2007.76\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper shows how the communication-diagram mechanism can be supplied with concepts, so that each collaboration can be specified. It enriches sequence expressions of messages with sub-terms that denote: Types of control structures choice, concurrence, and repetition of messages; and Complete information about their guarded branches, parallel threads, and iterative messages. Furthermore, each concatenation of these sub-terms maps onto an interlacement of message structures in an abstraction level or within levels of abstraction.\",\"PeriodicalId\":395851,\"journal\":{\"name\":\"International Conference on Software Engineering Advances (ICSEA 2007)\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-08-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Software Engineering Advances (ICSEA 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSEA.2007.76\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Software Engineering Advances (ICSEA 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSEA.2007.76","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文展示了如何为通信图机制提供概念,从而可以指定每个协作。它用子术语丰富了消息的序列表达式,这些子术语表示:控制结构的类型选择、消息的并发性和重复;以及关于它们的受保护分支、并行线程和迭代消息的完整信息。此外,这些子术语的每个连接都映射到抽象级别中或抽象级别内的消息结构的交错。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The UML Communication Diagram Revisited
This paper shows how the communication-diagram mechanism can be supplied with concepts, so that each collaboration can be specified. It enriches sequence expressions of messages with sub-terms that denote: Types of control structures choice, concurrence, and repetition of messages; and Complete information about their guarded branches, parallel threads, and iterative messages. Furthermore, each concatenation of these sub-terms maps onto an interlacement of message structures in an abstraction level or within levels of abstraction.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信