首页> 外文会议>International Conference on Computer Aided Verification(CAV 2006); 20060817-20; Seattle,WA(US) >Don't Care Words with an Application to the Automata-Based Approach for Real Addition
【24h】

Don't Care Words with an Application to the Automata-Based Approach for Real Addition

机译:不在乎单词在基于自动机的真实加法中的应用

获取原文
获取原文并翻译 | 示例

摘要

Automata are a useful tool in infinite-state model checking, since they can represent infinite sets of integers and reals. However, analogous to the use of BDDS to represent finite sets, the sizes of the automata are an obstacle in the automata-based set representation. In this paper, we generalize the notion of "don't cares" for BDDs to word languages as a means to reduce the automata sizes. We show that the minimal weak deterministic Buechi automaton (WDBA) with respect to a given don't care set, under certain restrictions, is uniquely determined and can be efficiently constructed. We apply don't cares to improve the efficiency of a decision procedure for the first-order logic over the mixed linear arithmetic over the integers and the reals based on WDBAs.
机译:自动机是无限状态模型检查中的有用工具,因为它们可以表示无限的整数和实数集。但是,类似于使用BDDS表示有限集,自动机的大小是基于自动机的集表示中的障碍。在本文中,我们将BDD的“无关”概念推广到词语言,以减小自动机大小。我们表明,在一定的限制下,针对给定的无关集的最小弱确定性Buechi自动机(WDBA)是唯一确定的,可以有效构造。对于基于WDBA的整数和实数的混合线性算术,我们采用无关紧要的方法来提高一阶逻辑决策过程的效率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号