首页> 外文会议>International Symposium on Fundamentals of Computation Theory >Local Testing of Message Sequence Charts Is Difficult
【24h】

Local Testing of Message Sequence Charts Is Difficult

机译:众所周知,邮件序列图表的本地测试

获取原文

摘要

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.
机译:消息序列图是一种有吸引力的形式主义,用于指定通信系统。测试这种系统的一种方法是通过测试过程替换组件,并观察其与系统的其余部分的交互。不幸的是,本地观测可以以意想不到的方式组合来定义原始规范中不存在的隐含方案。检查是否遵守暗示方案封闭方案规范,当时观察一次进行一个过程时,已知是不可判断的。我们表明即使我们加强观察者能够同时观察多个进程,问题仍未难以确定。事实上,即使没有消息标签,不可剥离性也会继续保持,只要我们同时观察两个或多个过程。另一方面,如果我们一次观察一个进程,则没有消息标签,检查隐含的方案是可解除的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号