Local testing of message sequence charts is difficult

被引:0
|
作者
Bhateja, Puneet [1 ]
Gastin, Paul [2 ,3 ]
Mukund, Madhavan [1 ]
Kumar, K. Narayan [1 ]
机构
[1] Chennai Math Inst, Madras, Tamil Nadu, India
[2] ENS, LSV, Cachan, France
[3] CNRS, F-75700 Paris, France
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Message sequence charts are an attractive formalism for specifying communicating systems. One way to test such a system is to substitute a component by a test process and observe its interaction with the rest of the system. Unfortunately, local observations can combine in unexpected ways to define implied scenarios not present in the original specification. Checking whether a scenario specification is closed with respect to implied scenarios is known to be undecidable when observations are made one process at a time. We show that even if we strengthen the observer to be able to observe multiple processes simultaneously, the problem remains undecidable. In fact, undecidability continues to hold even without message labels, provided we observe two or more processes simultaneously. On the other hand, without message labels, if we observe one process at a time, checking for implied scenarios is decidable.
引用
收藏
页码:76 / +
页数:2
相关论文
共 50 条
  • [1] Testing of concurrent programs based on Message Sequence Charts
    Chung, IS
    Kim, HS
    Bae, HS
    Kwon, YR
    Lee, BS
    INTERNATIONAL SYMPOSIUM ON SOFTWARE ENGINEERING FOR PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS, 1999, : 72 - 82
  • [2] Testing of concurrent programs based on message sequence charts
    Hansung Univ
    Int Workshop Software Eng Parall Distrib Syst Proc, (72-82):
  • [3] Message sequence charts
    Genest, B
    Muscholl, A
    Peled, D
    LECTURES ON CONCURRENCY AND PETRI NETS: ADVANCES IN PETRI NETS, 2004, 3098 : 537 - 558
  • [4] An incremental testing method based on timed message sequence charts
    En-Nouaary, Abdeslam
    2008 INTERNATIONAL CONFERENCE ON COMPUTER AND COMMUNICATION ENGINEERING, VOLS 1-3, 2008, : 1248 - 1253
  • [5] Causal message sequence charts
    Gazagnaire, Thomas
    Genest, Blaise
    Helouet, Loic
    Thiagarajan, P. S.
    Yang, Shaofa
    CONCUR 2007 - CONCURRENCY THEORY, PROCEEDINGS, 2007, 4703 : 166 - +
  • [6] Tutorial on message sequence charts
    Rudolph, E
    Graubmann, P
    Grabowski, J
    COMPUTER NETWORKS AND ISDN SYSTEMS, 1996, 28 (12): : 1629 - 1641
  • [7] Semantics of message sequence charts
    Letichevsky, AA
    Kapitonova, JV
    Kotlyarov, VP
    Volkov, VA
    Letichevsky, AA
    Weigert, T
    SDL 2005: MODEL DRIVEN, PROCEEDINGS, 2005, 3530 : 117 - 132
  • [8] A toolset for message sequence charts
    Peled, DA
    COMPUTER AIDED VERIFICATION, 1998, 1427 : 532 - 536
  • [9] Causal Message Sequence Charts
    Gazagnaire, Thomas
    Genest, Blaise
    Helouet, Loic
    Thiagarajan, P. S.
    Yang, Shaofa
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (41) : 4094 - 4110
  • [10] Triggered Message Sequence Charts
    Sengupta, Bikram
    Cleaveland, Rance
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2006, 32 (08) : 587 - 607