结果表明基于博弈的AT L逻辑比传统的基于计算树逻辑(CTL)更适合于描述和分析复杂电子商务协议。
These works indicate that the alternating-time temporal logic (ATL) logic based on game is more suit-able to describe and analyze complex e-commerce protocols than traditional CTL.
使用标准消息流操作逻辑,该树位置处的值可以静态地定义、根据消息内容计算得出,或者从外部来源得出。
Using standard message flow manipulation logic, the value at the tree location could be defined statically, computed from message content, or even derived from an external source.
对故障树进行逻辑简化将有效提高分析计算的速度。
Logical reduction can speed up fault tree analysis effectively.
对故障树进行逻辑简化将有效提高分析计算的速度。
Logical reduction can speed up fault tree analysis effectively.
应用推荐