Abstract:- The complexity of digital hardware designs has increased substantially with new advancements in electronic designs. It is becoming increasingly difficult to verify their correctness. MDGs have been proved to be a very effective tool in automatic hardware verification of RTL designs. In this paper, a method of variable reordering for Multiway Decision Graphs (MDG) is discussed. We present an automatic dynamic variable ordering algorithm for MDGs to reduce the effects of the state explosion problem. By contrast to ROBDDs, in MDGs difficulties are created by the presence of first order terms. The method we present here merges the benefits of stochastic evolution and sifting. It will be utilized to minimize the MDG size throughout th...
The size and complexity of software and hardware systems have significantly increased in the past ye...
We present a new algorithm for k-layer straightline crossing minimization which is based on sifting ...
In this thesis, a new general adaptive algorithm for solving a wide variety of NP-Complete combinato...
As an efficient representation of Extended Finite State Machines, Multiway Decision Graphs (MDG) are...
Traditional OBDD-based methods of automated verification suffer from the drawback that they require ...
Integrating formal verification techniques into the hardware design process provides the means to ri...
Multiway Decision Graphs (MDGs) subsume Binary Decision Diagrams (BDDs) by representing formulae whi...
Abstract Multiway Decision Graphs (MDGs) are a canonical representation of a subset of many-sorted f...
This thesis demonstrates the effectiveness of Multiway Decision Graphs (MDG) to carry out the formal...
[[abstract]]This paper proposes a new approach that successfully finds the optimal variable ordering...
After designing of Multi-Valued Logic Networks (MVLNs), the resulting circuits have to be veried to ...
This paper presents an improved variable ordering method to obtain the minimum number of nodes in Re...
In this paper we present several techniques for modeling and formal verification of the Fairisle Asy...
The increasing complexity of hardware systems requires more and more sophisticated methods of verifi...
ed Binary Decision Diagrams (SBDDs), which are improved BDDs, are useful for implementing VLSI logic...
The size and complexity of software and hardware systems have significantly increased in the past ye...
We present a new algorithm for k-layer straightline crossing minimization which is based on sifting ...
In this thesis, a new general adaptive algorithm for solving a wide variety of NP-Complete combinato...
As an efficient representation of Extended Finite State Machines, Multiway Decision Graphs (MDG) are...
Traditional OBDD-based methods of automated verification suffer from the drawback that they require ...
Integrating formal verification techniques into the hardware design process provides the means to ri...
Multiway Decision Graphs (MDGs) subsume Binary Decision Diagrams (BDDs) by representing formulae whi...
Abstract Multiway Decision Graphs (MDGs) are a canonical representation of a subset of many-sorted f...
This thesis demonstrates the effectiveness of Multiway Decision Graphs (MDG) to carry out the formal...
[[abstract]]This paper proposes a new approach that successfully finds the optimal variable ordering...
After designing of Multi-Valued Logic Networks (MVLNs), the resulting circuits have to be veried to ...
This paper presents an improved variable ordering method to obtain the minimum number of nodes in Re...
In this paper we present several techniques for modeling and formal verification of the Fairisle Asy...
The increasing complexity of hardware systems requires more and more sophisticated methods of verifi...
ed Binary Decision Diagrams (SBDDs), which are improved BDDs, are useful for implementing VLSI logic...
The size and complexity of software and hardware systems have significantly increased in the past ye...
We present a new algorithm for k-layer straightline crossing minimization which is based on sifting ...
In this thesis, a new general adaptive algorithm for solving a wide variety of NP-Complete combinato...