251 search results - page 40 / 51 » Lattice-Valued Binary Decision Diagrams |
TACAS
2001
Springer
14 years 2 months ago
2001
Springer
Multi-valued logics support the explicit modeling of uncertainty and disagreement by allowing additional truth values in the logic. Such logics can be used for verification of dyn...
APN
1999
Springer
14 years 2 months ago
1999
Springer
Abstract. Symbolic techniques based on BDDs (Binary Decision Diagrams) have emerged as an e cient strategy for the analysis of Petri nets. The existing techniques for the symbolic ...
VLSID
1999
IEEE
14 years 2 months ago
1999
IEEE
In this paper we address the problem of detailed FPGA routing using Boolean formulation methods. In the context of FPGA routing where routing resources are fixed, Boolean formulat...
AGP
1998
IEEE
14 years 2 months ago
1998
IEEE
The subject of groundness analysis for (constraint) logic programs has been widely studied, and interesting domains have been proposed. Pos has been recognized as the most suitabl...
ISSTA
1998
ACM
14 years 2 months ago
1998
ACM
Symbolic model checking has proved highly successful for large nite-state systems, in which states can be compactly encoded using binary decision diagrams (BDDs) or their variants...