Information and Media Technologies
Online ISSN : 1881-0896
ISSN-L : 1881-0896
Computing
Symbolic Discord Computation for Efficient Analysis of Message Sequence Charts
Yosuke KakiuchiTomofumi NakagawaKiyoharu HamaguchiTadaaki TanimotoMasaki Nakanishi
著者情報
ジャーナル フリー

2011 年 6 巻 4 号 p. 1116-1127

詳細
抄録
Message sequence charts (MSCs) and high-level MSCs (HMSCs) have been standardized to model interactions of parallel processes as message exchanges. We can flexibly express parallel behaviors with MSCs, but alternatively, it is possible to put unintended orders of messages into the MSCs. This paper focuses on detection of such unintended orders as discord. We propose an encoding scheme in which the analysis of an HMSC is converted into a boolean SAT problem. Experimental results show that our approach achieves efficient analysis of HMSCs which have a large number of processes or a large size of graphs. This contributes efficient analysis of specification on complex interactions.
著者関連情報
© 2011 Information Processing Society of Japan
前の記事 次の記事
feedback
Top