计算树逻辑的英文

• ctl

• "计算"英文翻译    count; compute; calculate; r ...
• "树"英文翻译    tree
• "逻辑"英文翻译    logic
• "计算机逻辑" 英文翻译 :    computer logic; logic in computer science; logic of machine
• "计算逻辑" 英文翻译 :    computational logic
• "计算逻辑树。" 英文翻译 :    computation tree logic
• "计算器逻辑" 英文翻译 :    computerlogic
• "逻辑计算机" 英文翻译 :    logic computer; logical computer; logical machine
• "磁逻辑计算机" 英文翻译 :    magnetic logic computer; magnetic logic cumputer; magnetic-logic computer
• "计算逻辑算法" 英文翻译 :    computational algorithm
• "可计算性逻辑" 英文翻译 :    computability logic
• "块逻辑计算机" 英文翻译 :    block logic computer
• "磁逻辑电路计算机" 英文翻译 :    magnetic logic computer
• "存储逻辑计算机" 英文翻译 :    stored logic computer
• "代数逻辑计算器" 英文翻译 :    calculator with algebraic logic; calculator with algebratic logic
• "多数逻辑计算机用" 英文翻译 :    majority
• "分布逻辑计算机" 英文翻译 :    distributed logic computer
• "计算机的逻辑部分" 英文翻译 :    logic
• "计算机逻辑电路" 英文翻译 :    computer logic circuit
• "计算机逻辑设计" 英文翻译 :    computer logic designing
• "计算计逻辑电路" 英文翻译 :    computer logic circuit
• "静态逻辑计算机" 英文翻译 :    static logic machine
• "可计算函数逻辑" 英文翻译 :    logic for computable function; logic of computable functions
• "逻辑和计算杂志" 英文翻译 :    journal of logic and computation
• "逻辑连接计算机" 英文翻译 :    logic in memory computer

• 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的算法对时序约束一致性进行验证。