AI helps you reading Science
Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing.
Computer Aided Verification, (2010): 132-147
EI
Get fulltext within 24h
Keywords
Abstract
There are two main classes of methods for checking universality and language inclusion of Büchi-automata: Rank-based methods and Ramsey-based methods While rank-based methods have a better worst-case complexity, Ramsey-based methods have been shown to be quite competitive in practice [10,9] It was shown in [10] (for universality checking)...More
Code:
Data:
Tags
Comments
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn