状态等价的英文

• state equivalent

• "状态"英文翻译    status; state; condition; st ...
• "等价"英文翻译    of equal value; equal in val ...
• "状态等价表" 英文翻译 :    state equivalence table
• "状态等" 英文翻译 :    y=abstraction
• "维持（某状态等）" 英文翻译 :    stay
• "表示性质或状态等" 英文翻译 :    ibility
• "等价状态" 英文翻译 :    equivalence state; equivalent states
• "等价状态表" 英文翻译 :    equivalence state table
• "简单状态等概率定律" 英文翻译 :    law of equal probability of single states
• "等价" 英文翻译 :    of equal value; equal in value; equivalence
• "动态等" 英文翻译 :    dynamic di atching; dynamic dispatching; dynamic scheduling
• "固态等温线" 英文翻译 :    solid isotherm
• "静态等效的" 英文翻译 :    statically equivalent
• "生态等值" 英文翻译 :    ecological efficiency; ecological equivalance
• "生态等值种" 英文翻译 :    ecological equivalent
• "形态等值线" 英文翻译 :    formline contour
• "正态等差" 英文翻译 :    normal equivalent deviate
• "固态等离子体" 英文翻译 :    solid state plasma
• "静态等张运动" 英文翻译 :    akinetic isotonic exercise
• "气态等离子体" 英文翻译 :    gaseous plasma
• "稳态等离子体" 英文翻译 :    steady-state plasma
• "磁等价" 英文翻译 :    magnetic eqivalence
• "殆等价" 英文翻译 :    almost equivalent
• "等价；同等" 英文翻译 :    parity
• "等价的" 英文翻译 :    (be)of equal value; equal in value; equipollence; equipollency; equipollent; equivalent; isovalent; tantamount

• From the equivalence relations , a minimal form is defined and a minimization algorithm of the mealy type of fuzzy finite automata is obtained . in chapter 3 , a fuzzy finite automata with a fuzzy initial state that was first considered by m . mizumoto , j . toyota and k . tanaka in 1969 is introduced . based on the mizumoto type of fuzzy finite automata , a statewise equivalence relation is considered
  在第三章中，我们首先介绍了一类有模糊初始状态的模糊有限自动机- mizumoto型模糊有限自动机，然后定义了两种状态等价和两种模糊有限自动机等价的概念，接着证明了对于每一个mizumoto型模糊有限自动机，都存在一个与之等价的状态最小化模糊有限自动机，并且给出了一个状态最小化约简算法及其算法终止条件。
• A widely used method for checking real - time systems is , according to the real - time property to be checked , to use a proper bi - simulation equivalence relation to convert the infinite - timed state space to a finite equivalence class space . the algorithm needs only to explore the finite space to get a correct answer . in most cases , exhaustive exploration is very difficult because the equivalence class space increases explosively when the scale of the system increases . in this paper , an equivalence relation is introduced to check whether a concurrent system , which is composed of a finite set of real - time automata , satisfies a linear duration property . to avoid exhaustive exploration , this paper also introduces a compatibility relation between timed states ( configurations ) . based on these two relations , an algorithm is proposed to check whether a real - time automaton network satisfies a linear duration property . the cases study shows that under some conditions this algorithm has better efficiency than the tools in the literature
  一个被广泛用于验证实时系统的方法是根据被验证的实时性质,使用适当的双向模拟等价关系使无限的状态空间转化为有限的状态等价类空间.算法只需要在这个有限的等价类空间里搜索就可以得到正确答案.但是,这个等价类空间的规模一般随着系统规模的增大而产生爆炸性的增长,以至于在很多情况下,穷尽搜索这个空间是不现实的.该文引入了一个等价关系来验证一个由多个实时自动机通过共享变量组成的并发系统是否满足一个线性时段特性.同时，还引入了格局之间的兼容关系来避免对状态等价类空间的穷尽搜索.基于这两个关系,文章提出了一个算法来验证是否一个实时自动机网满足一个线性时段特性.实例研究显示,此算法在某些情况下比其他一些工具有更好的时间和空间效率

• 状态等价的日语：じょうたいとうか