计算树逻辑 meaning in English

ctl

Verifying the soundness of the uml statecharts model can be translated into the verification of the soundness of the global reachable state transition diagram , and the algorithms verifying the soundness and the properties of semantic - related are given . at the aspect of verifying the consistency of temporal constraints of workflow , the time events are added into the uml statecharts , then the rules translating the extended uml statecharts into timed automata are given . the upper constraints ( the most time interval between two tasks ) , lower constraints ( the least time interval between two tasks ) and deadline constraints are defined by tctl . the consistency of these constraints in build time , instantiation time and run - time are defined respectively
在验证工作流时序约束一致性方面,在uml状态图中加入了时间事件,给出了将扩展后的uml状态图转化为时间自动机的规则,用时间计算树逻辑定义了两个任务间的最大、最小时间间隔(上、下界约束)和工作流的最终期限约束,并给出了这三类约束分别在创建阶段、实例化阶段和运行阶段的一致性定义,通过alur的算法对时序约束一致性进行验证。