【24h】

Verification of Protocol ECMA with Decomposition of Petri Net Model

机译:用Petri网模型分解验证协议ECMA

获取原文
获取原文并翻译 | 示例

摘要

Decomposition of Petri net model of ECMA communication protocol into minimal functional subnets, left and right communicating systems, subsystems of connection establishing and disconnecting is implemented. A correct protocol ought to be invariant one. Invariance of source model is proved on the base of established invariance of functional subnets. Isomorphism of subnets has allowed the calculation of invariants in the process of consecutive composition of net. Acceleration of computations for decomposition technique was estimated. It is exponential with the respect to net dimension.
机译:将ECMA通信协议的Petri网模型分解为功能最小的子网,左右通信系统,建立连接和断开连接的子系统。正确的协议应该是不变的。在已建立的功能子网不变性的基础上,证明了源模型的不变性。子网的同构性允许在网络的连续组成过程中计算不变量。估计了分解技术的计算速度。它相对于净尺寸是指数的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号