Improving Language Containment Using Fairness Graphs
暂无分享,去创建一个
Robert K. Brayton | Robert B. Mueller-Thuns | Ramin Hojati | R. Brayton | R. Hojati | R. Mueller-Thuns
[1] Vigyan Singhal,et al. Edge-Streett/Edge-Rabin Automata Environment for Formal Verification Using Language Containment , 1994 .
[2] R. Bryant. Graph-Based Algorithms for Boolean Function Manipulation12 , 1986 .
[3] Pierre Wolper,et al. An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.
[4] R. P. Kurshan,et al. Reducibility in analysis of coordination , 1988 .
[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[6] 室 章治郎. Michael R.Garey/David S.Johnson 著, "COMPUTERS AND INTRACTABILITY A guide to the Theory of NP-Completeness", FREEMAN, A5判変形判, 338+xii, \5,217, 1979 , 1980 .
[7] Robert K. Brayton,et al. Efficient omega-Regular Language Containment , 1992, CAV.
[8] Robert K. Brayton,et al. Implicit state enumeration of finite state machines using BDD's , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.