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 条
  • [21] A simulation model for message sequence charts
    Hélouët, L
    SDL'99: THE NEXT MILLENNIUM, 1999, : 473 - 488
  • [22] Deciding properties of message sequence charts
    Muscholl, A
    Peled, D
    SCENARIOS: MODELS, TRANSFORMATIONS AND TOOLS, 2005, 3466 : 43 - 65
  • [23] Interactive visualization for message sequence charts
    Eick, Stephen G.
    Ward, Amy
    Program Comprehension, Workshop Proceedings, 1996, : 2 - 8
  • [24] Instantiation semantics for message sequence charts
    Padilla, Gerardo
    Bastani, Farokh B.
    de Oca, Carlos Montes
    Serrano, Miguel A.
    SEVENTH MEXICAN INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE, PROCEEDINGS, 2006, : 191 - +
  • [25] Model checking of message sequence charts
    Alur, R
    Yannakakis, M
    CONCUR'99: CONCURRENCY THEORY, 1999, 1664 : 114 - 129
  • [26] An interactive visualization for message sequence charts
    Eick, SG
    Ward, A
    FOURTH WORKSHOP ON PROGRAM COMPREHENSION, PROCEEDINGS, 1996, : 2 - 8
  • [27] Semantics of timed message Sequence charts
    Letichevskij, A.A.
    Kapitonova, Yu.V.
    Kotlyarov, V.P.
    Letichevskij, A.A.
    Volkov, V.A.
    Kibernetika i Sistemnyj Analiz, 2002, (04): : 3 - 32
  • [28] Distributed implementation of message sequence charts
    Rouwaida Abdallah
    Loïc Hélouët
    Claude Jard
    Software & Systems Modeling, 2015, 14 : 1029 - 1048
  • [29] A framework for pathologies of message sequence charts
    Dan, Haitao
    Hierons, Robert M.
    Counsell, Steve
    INFORMATION AND SOFTWARE TECHNOLOGY, 2012, 54 (11) : 1283 - 1295
  • [30] The essence ef message sequence charts
    Broy, M
    INTERNATIONAL SYMPOSIUM ON MULTIMEDIA SOFTWARE ENGINEERING, PROCEEDINGS, 2000, : 42 - 47