助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   ω-自动机 的翻译结果: 查询用时:0.415秒
图标索引 在分类学科中查询
所有学科
计算机硬件技术
计算机软件及计算机应用
更多类别查询

图标索引 历史查询
 

ω-自动机
相关语句
  ω-automata
     ω-AUTOMATA AND EXTENDED REGULAR EXPRESSIONS
     ω-自动机与扩大了的正规表达式
短句来源
     On transforming ω-automata, we first introduce the full automata technique, which is helpful for analyzing the state complexity of transformations of automata. Namely we suggest to first consider the class of full automata in lower bound analysis, and later reduce the size of the large alphabet via alphabet substitutions.
     在ω-自动机转换上,我们首先提出了一种证明自动机状态转换复杂性下界的技巧,即full自动机技巧,然后将这种技巧应用到非确定ω-自动机的求补操作上。
短句来源
     Then we apply such technique to the complementation of nondeterministic ω-automata, and obtain several lower bound results. Particularly, we prove an Ω((0.76n)~n) lower bound for Buchi complementation, which also holds for almost every complementation and determinization transformation of nondeterministic ω-automata, and prove an optimal (Ω(nk))~n lower bound for the complementation of generalized Buchi automata, which holds for Streett automata as well.
     具体地,我们证明了一个Buchi自动机求补的Ω((0.76n)~n)的下界,并且证明了这个下界对于几乎所有ω-自动机的求补和确定化操作都有效。 我们也证明了一个广义Buchi自动机求补的(Ω(nk))~n的下界,而这个下界对于Streett自动机的求补也有效。
短句来源
  相似匹配句对
     Ω.
     Ω)。
短句来源
     x∈Ω.
     Ω .
短句来源
     ω-AUTOMATA AND EXTENDED REGULAR EXPRESSIONS
     ω-自动机与扩大了的正规表达式
短句来源
     A TYPE OF ALTERNATING ω-FINITE AUTOMATA
     一类交替的ω-有穷自动机
短句来源
     On ω-FAS Acceptance Conditions
     关于ω-有穷自动机的接受条件
短句来源
查询“ω-自动机”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  ω-automata
Moreover, by an application to the so-called "bad cycle detection problem", our technique can be used to efficiently solve the emptiness problem for various kinds of ω-automata.
      
In this article we establish a translation T : to a class of ω-automata closed under a synchronous parallel composition, for which T is monotonic with respect to implementation relative to Δ, and linear with respect to composition.
      
For the class , we use the L-process model of ω-automata.
      
Second, instead of directly unwinding temporal logic formulas, we use special translations to ω-automata that take into account the temporal logic hierarchy and maintain safety and liveness properties.
      


Model checking is one of the most practical techniques of automatic formal verification to ensure the correctness of design specifications.To check whether a model satisfies a linear time temporal logic(LTL) formula,this proposes a method to translate a Büchi automata from LTL.The problem of formal verification of systems can be converted into a problem of checking containment of language received by implementation automaton and specification automata.However,it is very important for model checking to reduce...

Model checking is one of the most practical techniques of automatic formal verification to ensure the correctness of design specifications.To check whether a model satisfies a linear time temporal logic(LTL) formula,this proposes a method to translate a Büchi automata from LTL.The problem of formal verification of systems can be converted into a problem of checking containment of language received by implementation automaton and specification automata.However,it is very important for model checking to reduce the size of the automata.For optimization the Büchi automata derived from LTL properties,it gives an improved method that applies rewriting the formula before translation,and then reduces the number of states generated by the translation via Boolean optimization based on ROBDD.The results suggest that reduction of the state space is efficient.

模型检验是一种重要的形式化自动验证技术。检验一个模型是否满足LTL公式,可以把LTL公式转换为一个表示相同无穷状态序列的ω自动机,通过转换后的ω自动机与系统自动机的乘积判空来进行模型检验。由于自动机的体积是模型检验的一个关键性问题,为了得到尽可能小的自动机,在LTL公式转换为ω自动机之前,对LTL公式进行预处理来减少冗余,然后基于ROBDD,通过布尔技术优化自动机

 
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关ω-自动机的内容
在知识搜索中查有关ω-自动机的内容
在数字搜索中查有关ω-自动机的内容
在概念知识元中查有关ω-自动机的内容
在学术趋势中查有关ω-自动机的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社