US 7,096,138 B2Grant
Method for demonstrating the dependence of a signal based on another signal
Issue Date:2006-08-22
•10 Claims
•8 Drawing Sheets
Abstract
In order to test whether a given signal of a complex circuit has the correct behavior, a method is provided which makes it possible to obtain in a computer memory a profile of states of other signals. In order to minimize the processing time and the memory space required to obtain this profile, the method uses two binary decision diagrams starting with a binary variable of said one signal, each with two binary decision subdiagrams. The method combines the binary decision subdiagrams so that the given signal is in a first state when the binary variable is at a first value and is not in this first logical state when the binary variable is at a second value.
Metadata
Assignee
- Bull, S.A.
Inventors
- Florence Akli
- Alain Debreil
- Christian Niquet
Application Information
Application Number:US 10/049,021
Filing Date:2001-06-07
Priority Date:2001-06-07
Art Unit:2857
Classifications
IPC:
G06F17/50
Patent Drawings (8 sheets)
Description
CROSS REFERENCE TO RELATED APPLICATION
[0001] The subject matter of the subject invention is related to application Ser. No. 10/049,023 filed on Feb. 8, 2002, in the names of Florence AKLI, Alain DEBREIL and Christian NIQUET, entitled “TOOL FOR AUTOMATIC TESTABILITY ANALYSIS”, the subject matter of which is incorporated herein in its entirety.
BACKGROUND OF THE INVENTION 1. Field of the Invention
[0002] The field of application of the invention is that of a method for indicating a combination of signals to be applied to a physical element in order to obtain a change in the state of a given signal following a change in the state of another signal on which the given signal depends.
[0003] 2. Description of the Related Art
[0004] In complex physical elements, such as all or part of high-density integrated circuits, signals generated by these physical elements can depend on many other signals. It is therefore difficult to know if the physical element is behaving correctly.
[0005] Before etching into the silicon of electric circuits, the bad circuits must be detected in order to avoid using them. The technique used to sort the good circuits from the bad circuits is one that consists of applying stimuli to the circuit and comparing their responses to precalculated values.
[0006] In the case of a purely combinational circuit with two hundred inputs, it would be necessary to apply two to the power two hundred combinations of binary states in the inputs in order to test all the possible cases. A testing device operating at 50 MHz would take a thousand years to test a single circuit. These figures increase exponentially when there are stored states in the circuit.
[0007] It is therefore necessary to minimize the number of combinations of binary states to be applied to signals of the circuit in order to find the possible faults in the circuit.
[0008] For a first signal, normally generated by a physical element as a function of other signals applied to this physical element it is known from U.S. Pat. Nos. 5,434,794 and 5,737,242 to use binary decision diagrams to determine possible binary states of the first signal resulting from combinations of binary states of a second signal with binary states of third signals of the circuit.
[0009] The advantage of binary decision diagrams is that it is possible to represent in a computer memory, in a particularly compact way, the combinations of binary states of signals that lead to a given binary state of the first signal.
[0010] However, the binary decision diagrams of the prior art provide a static image of possible combinations of binary states of a second signal with third signals that produce a given binary state of the first signal. It is therefore possible for a combination of a first binary state of the second signal with binary states of third signals to produce the same given binary state of the first signal as a combination of a second binary state of the second signal with other binary states of third signals. Furthermore, it is possible to observe in the physical element either the given binary state of the first signal for the first binary state or the second binary state of the second signal, whereas the latter results not from binary combinations for which the physical element is designed, but from faults, such as a signal sticking in the physical element. Signal sticking means that a signal is in a state not intended by design, for example a state that results from a short circuit or from damage.
[0011] In order to ensure that the state of a first signal actually results from the state of a second signal, it is important to observe whether a state transition of the second signal induces a state transition of the first signal, the states of the other signals remaining unchanged. If, moreover, the transition of the first signal is does not match the transition expected, this may be interpreted as an error.
SUMMARY OF THE INVENTION
[0012] The subject of the invention is a method that associates, with a first signal generated by a physical element, two binary decision diagrams in two binary states of a second signal,
-
- [0013] the first binary decision diagram comprising:
- [0014] a first binary decision subdiagram that encodes a first set of the combinations of binary states of third signals for which the first signal is in a first binary state or in a second binary state when the second signal is in the first binary state,
- [0015] a second binary decision subdiagram that encodes a second set of the combinations of binary states of the third signals for which the first signal is in the first binary state or in the second binary state when the second signal is in the second binary state,
- [0016] the second binary decision diagram comprising:
- [0017] a third binary decision subdiagram that encodes a third set of the combinations of binary states of the third signals for which the first signal is in the second binary state or in a first nonbinary state when the second signal is in the first binary state,
- [0018] a fourth binary decision subdiagram that encodes a fourth set of the combinations of binary states of the third signals for which the first signal is in the second binary state or in the first nonbinary state when the second signal is in the second binary state.
[0019] The method includes at least one step that performs a logical combination of the first, second, and at least one of the third or fourth binary decision subdiagrams, said logical combination comprising a logical conjunction of three of said four binary decision subdiagrams wherein one of said three binary decision subdiagrams is complemented, in order to generate a fifth binary decision subdiagram that encodes a fifth set of combinations of binary states of said third signals.
[0020] If the complemented binary decision subdiagram is the first binary decision subdiagram, the fifth set of the combinations of binary states of said third signals is such that the first signal is not in the first binary state or the second binary state when the second signal is in the first binary state, a disjunction with the second and third uncomplemented binary decision subdiagrams makes the fifth set of combinations of binary states of said third signals such that the first signal is in the first nonbinary state or the second nonbinary state when the second signal is in the first binary state, and such that the first signal is in the first binary state or in the second binary state when the second signal is in the second binary state. Thus, when the second signal is in the second binary state, the first signal is in the first or the second binary state, and when the second signal passes to the first binary state, the first signal passes to the first nonbinary state.
[0021] If the complemented binary decision subdiagram is the second binary decision subdiagram, the fifth set of the combinations of binary states of said third signals is such that the first signal is not in the first state or the second binary state when the second signal is in the second binary state, a disjunction with the first and fourth uncomplemented binary decision subdiagrams makes the fifth set of combinations of binary states of said third signals such that the first signal is in the first nonbinary state or the second binary state when the second signal is in the second binary state, and such that the first signal is in the first binary state or in the second binary state when the second signal is in the first binary state. Thus, when the second signal is in the first binary state, the first signal is in the first or the second binary state, and when the second signal passes to the second binary state, the first signal passes to the first nonbinary state.
[0022] If the complemented binary decision subdiagram is the third binary decision subdiagram, the fifth set of the combinations of binary states of said third signals is such that the first signal is not in the first binary state or the first nonbinary state when the second signal is in the first binary state, a disjunction with the first and second uncomplemented binary decision subdiagrams makes the fifth set of combinations of binary states of said third signals such that the first signal is in the first binary state or the second binary state when the second signal is in the second binary state, and such that the first signal is in the first binary state or in the second binary state when the second signal is in the first binary state. Thus, when the second signal is in the first binary state, the first signal is in the second binary state, and when the second signal passes to the second binary state, the first signal passes to the first nonbinary state.
[0023] Thus, in order to test whether a given signal of a complex circuit has the correct behavior, the method makes it possible to obtain in a computer memory a profile of states of other signals, among which a change in the state of one signal must cause a change in the state of the given signal, in a physical sample of the circuit. In order to minimize the processing time and the memory space required to obtain this profile, the method uses two binary decision diagrams starting with a binary variable of said one signal, each with two binary decision subdiagrams. The method combines the binary decision subdiagrams in such a way that the given signal is in a first state when the binary variable is at a first value and is not in this first state when the binary variable is at a second value.
BRIEF DESCRIPTION OF THE DRAWINGS
[0024] Other details and advantages of the invention will be more clearly understood in the following description in reference to the figures, in which:
[0025] FIG. 1 represents steps of a method for associating with a first signal at least two binary decision diagrams;
[0026] FIG. 2 represents steps of a method for associating with the first signal another binary decision diagram for which a change in the state of a second signal causes a change in the state of the first signal with a given state of a set of third signals;
[0027] FIGS. 3 and 4 represent physical elements for understanding the effect of the method on a simple example;
[0028] FIG. 5 represents two binary decision diagrams obtained using the method of FIG. 1 , for the physical element of FIG. 3 ;
[0029] FIG. 6 represents a third binary decision diagram obtained using the method of FIG. 1 , for the physical element of FIG. 3 ;
[0030] FIG. 7 represents an exemplary binary decision diagram obtained using the method according to the invention.
[0031] FIG. 8 presents additional steps of a method according to the invention.
DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0032] FIG. 1 represents steps of a method for associating with a first signal Si at least two binary decision diagrams. These steps are executed by a computer that has in memory a connection list (netlist) of signals and physical elements that determines various relations between these signals. The intermediate and final results of the steps are automatically stored in memory in the computer.
[0033] In a first step 1, a pair of binary variables (xvi,xci) is assigned to a signal Si in order to encode at least three possible states of the signal Si. The variable xci, called a context variable, is defined in order to indicate that, when its value is equal to 1, the values 0 and 1 of the variable xvi, respectively, directly encode a first logical state B and a second logical state H of the signal Si. When the value of the context variable xci is equal to 0, the values 0 and 1 of the variable xvi respectively encode an indeterminate state and a state Z of the signal Si. The state Z of the signal Si is a high-impedance state in the sense in which the term is usually understood in an electric circuit. In the indeterminate state, there is an error state E of the signal Si such as, for example, an electrical short circuit. The pair of binary variables (xvi,xci) thus makes it possible to encode four possible states of the signal Si.
[0034] In a second step 2, three binary decision diagrams Tv(Si), Tc(Si), Te(Si) are assigned to the signal Si.
[0035] The so-called context binary decision diagram Tc(Si) is constructed by means of a rule Rc, so that it leads to 1 if the state of the signal Si is the logical state B or the logical state H.
[0036] The so-called value binary decision diagram Tv(Si) is constructed by means of a rule Rv, so that it leads to 1 if the state of the signal Si is the high-impedance state Z or the logical state H.
[0037] The so-called error binary decision diagram Te(Si) is constructed by means of a rule Re, so that it leads to 1 if the state of the signal Si is an error state.
[0038] The application of a rule Rc, Rv Re activates a third step 3, which scans the netlist in order to determine a combination Φc, Φv, Φe, that links the states of the signals Si to the states of one or more other signals Si+1, Si+2.
[0039] When the signal Si does not depend on any other signal, each of the variables xvi, xci of the pair of variables (xvi,xci) can assume a value equal to 0 or 1. This is the case, for example, for an input signal of the electric circuit or for an intermediate signal that it is possible to force by means of a test probe. The binary decision diagrams Tv(Si), Tc(Si) are such that Tv(Si) leads to 1 if xvi is equal to 1, and Tc(Si) leads to 1 if xci is equal to 1. The binary decision diagrams then being constructed immediately, an end step 6 is activated.
[0040] When the signal Si depends on one or more signals Si+1, Si+2, a fourth step 4 makes the binary decision diagrams associated with the signal Si+1, Si+2 available. If the binary decision diagrams already exist in memory, this consists in a simple reading of pointers in these binary decision diagrams. If the binary decision diagrams do not exist in memory, it consists of reactivating the method recursively for the signal or signals Si+1, Si+2, etc.
[0041] A step 5 then combines the binary decision diagrams using the combinations determined in step 3.
[0042] Let us recall that a binary decision diagram Tf associated with a first boolean function f(a, b, c, . . . , w) of binary variables a, b, c, . . . w is accessible by means of a first computer data structure that makes it possible to represent in memory the values assumed by the first function f, based on the values assumed by the binary variables a, b, c, . . . w. This first data structure is constructed using the known properties of a Shannon decomposition relative to a first variable a, i.e., using the usual notations for writing logical functions:
[0043] where ƒ(a=0, b, c , . . . , w) is a second invariable boolean function based on a, since a is set at zero, and where ƒ(a=1, b, c, . . . , w) is a third invariable boolean function based on a since a is set at one. The second boolean function assumes the same values as the first boolean function based on the values assumed by the binary variables b, c, . . . , w when a=0. The third boolean function assumes the same values as the first boolean function based on the values assumed by the binary variables b, c, . . . , w when a=1. The first data structure therefore appears as a triplet of addresses of storage areas {a,f(a=0,b, . . . ),f(a=1,b, . . . )}, which therefore comprises a first node occupied by the first variable a, a left pointer to a second data structure {b,f(a=0,b=0, . . . ),f(a=0,b=1, . . . )} that makes it possible to access a first binary decision subdiagram associated with the second boolean function and a right pointer to a third data structure {b,f(a=1,b=0, . . . ),f(a=1,b=1, . . . )} that makes it possible to access a second binary decision subdiagram associated with the third boolean function. The second and third data structures being the same type as the first data structure with, respectively, a second and third node occupied by a second binary variable b, c. The above operation is repeated until the last binary variable w gives the binary decision diagram Tf constituted by a chaining {a,{b,{ . . . },{ . . . }},{b,{ . . . },{ . . . }}} of the structures by means of the pointers. An identifier of the binary decision diagram Tf points to the first node, called the root node.
[0044] The representation in memory of a function by a binary decision diagram offers the appreciable advantage of compactness because, if two or more binary decision subdiagrams are identical, only one representation in memory is enough, since two or more pointers can point to the same data structure. When a function is independent of a binary variable, the binary decision diagram is simplified. The representation in memory of a function by a binary decision diagram can be implicit in the sense that it is possible to perform calculations on the root node without necessarily extending the binary decision diagram for all of the nodes.
[0045] One advantageous property of binary decision diagrams results from the following statement on the Shannon decomposition. When a boolean function h(a,b,c, . . . , 2) results from a combinational operation Φ(f,g) of one or more boolean functions
f(a,b,c, . . . ,w),
g(a,b,c, . . . ,w):
h(a,b,c, . . . ,w)=ā·h(a=0,b,c, . . . ,w)+a·h(a=1,b,c, . . . ,w)
=ā·Φ(ƒ(a=0,b,c, . . . ,w),g(a=0,b,c, . . . ,w))+a·Φ(ƒ(a=1,b,c, . . . ,w),g(a=1,b,c, . . . ,w))
=Φ(ā·ƒ(a=0,b,c, . . . ,w),ā·g(a=0,b,c, . . . ,w))+Φ(a·f(a=1,b,c, . . . ,w),a·g(a=1,b,c, . . . ,w))
=Φ(ā·ƒ(a=0,b,c, . . . ,w)+a·ƒ(a=1,b,c, . . . ,w),ā·g(a=0,b,c, . . . ,w))+a·g(a=1,b,c, . . . ,w))
f(a,b,c, . . . ,w),
g(a,b,c, . . . ,w):
h(a,b,c, . . . ,w)=ā·h(a=0,b,c, . . . ,w)+a·h(a=1,b,c, . . . ,w)
=ā·Φ(ƒ(a=0,b,c, . . . ,w),g(a=0,b,c, . . . ,w))+a·Φ(ƒ(a=1,b,c, . . . ,w),g(a=1,b,c, . . . ,w))
=Φ(ā·ƒ(a=0,b,c, . . . ,w),ā·g(a=0,b,c, . . . ,w))+Φ(a·f(a=1,b,c, . . . ,w),a·g(a=1,b,c, . . . ,w))
=Φ(ā·ƒ(a=0,b,c, . . . ,w)+a·ƒ(a=1,b,c, . . . ,w),ā·g(a=0,b,c, . . . ,w))+a·g(a=1,b,c, . . . ,w))
[0046] For example:
[0047] When Φ is a logical complement,
[0048]
[0049] The binary decision diagram associated with the logical complement of a function f includes the same node occupied by the variable a as the binary decision diagram associated with the function f in which the pointer in the binary decision subdiagram associated with the function f for a equal to zero is replaced by a pointer in a binary decision subdiagram associated with the logical complement of the function f for a equal to zero, and in which the pointer in the binary decision subdiagram associated with the function f for a equal to one is replaced by a pointer in a binary decision subdiagram associated with the logical complement of the function f for a equal to one.
[0050] When Φ is a logical disjunction of two functions f and g,
h(a,b,c, . . . ,w)=ƒ(a,b,c, . . . ,w)·g(a,b,c . . . ,w)
=ā·[ƒ(a=0,b,c, . . . ,w)·g(a=0,b,c, . . . ,w)]+a·[ƒ(a=1,b,c, . . . ,w)+g(a=1,b,c, . . . ,w)]
h(a,b,c, . . . ,w)=ƒ(a,b,c, . . . ,w)·g(a,b,c . . . ,w)
=ā·[ƒ(a=0,b,c, . . . ,w)·g(a=0,b,c, . . . ,w)]+a·[ƒ(a=1,b,c, . . . ,w)+g(a=1,b,c, . . . ,w)]
[0051] The binary decision diagram associated with the logical disjunction of two functions f and g includes the same node occupied by the variable a as the binary decision diagram associated with the function f in which the pointer in the binary decision subdiagram associated with the function f for a equal to zero is replaced by a pointer in a binary decision subdiagram associated with the logical disjunction of the function f for a equal to zero and the function g for a equal to zero, and in which the pointer in the binary decision subdiagram associated with the function f for a equal to one is replaced by a pointer in a binary decision subdiagram associated with the logical disjunction of the function f for a equal to one and the function g for a equal to one.
[0052] When Φ is a logical conjunction of two functions f and g,
h(a,b,c, . . . ,w)=ƒ(a,b,c, . . . ,w)·g(a,b,c, . . . ,w)
=ā·[ƒ(a=0,b,c, . . . ,w)·g(a=0,b,c, . . . ,w)]+a·[ƒ(a=1,b,c, . . . ,w)·g(a=1,b,c, . . . ,w)]
h(a,b,c, . . . ,w)=ƒ(a,b,c, . . . ,w)·g(a,b,c, . . . ,w)
=ā·[ƒ(a=0,b,c, . . . ,w)·g(a=0,b,c, . . . ,w)]+a·[ƒ(a=1,b,c, . . . ,w)·g(a=1,b,c, . . . ,w)]
[0053] The binary decision diagram associated with the logical conjunction of two functions f and g includes the same node occupied by the variable a as the binary decision diagram associated with the function f in which the pointer in the binary decision subdiagram associated with the function f for a equal to zero is replaced by a pointer in a binary decision subdiagram associated with the logical conjunction of the function f for a equal to zero and the function g for a equal to zero, and in which the pointer in the binary decision subdiagram associated with the function f for a equal to one is replaced by a pointer in a binary decision subdiagram associated with the logical conjunction of the function f for a equal to one and the function g for a equal to one.
[0054] By proceeding recursively up to the last variable w of one or more functions f, g, it is possible to perform, in a simple way, any combinational operation Φ of one or more binary decision diagrams.
[0055] The binary decision diagram Tc(Si) is constructed by means of the combination Φc, which gives Tv(Si) by replacing xvi+1, xci+1, xvi+2, xci+2, respectively, with the binary decision diagrams Tv(Si+1), Tc(Si+1), Te(Si+1), Tv(Si+2), Tc(Si+2), Te(Si+2);
[0056] The binary decision diagram Tv(Si) is constructed by means of the combination Φv, which gives Tv(Si) by replacing xvi+1, xci+1, xvi+2, xci+2, respectively, with the binary decision diagrams Tv(Si+1), Tc(Si+1), Tv(Si+1), Tv(Si+2), Tc(Si+2);
[0057] The binary decision diagram Te(Si) is constructed likewise by combining the binary decision diagrams Tv(si+1), Tc(si+1), Te(si+1), Tv(si+2), Tc(si+2), Te(si+2).
[0058] Let's apply, for example, the method described above to the elementary circuit of FIG. 3 , which constitutes a multiplexer with three inputs.
[0059] A conductor 21 conveys a signal S1. The conductor 21 is connected at a point 25 to three conductors 22, 23, 24 in parallel. The conductors 22, 23, 24 each convey a signal, respectively S2, S3, S4. The coupling of the signals S2, S3 at the point 25 is equivalent to an intermediate signal S11 coupled at the point 25 with the signal S4.
[0060] The variable xv1 is equal to 1 if and only if the state of each of the signals S2, S3, S4 is the high-impedance state Z or the logical state H.
[0061] The applicable rule Rv for constructing the binary decision diagram Tv(S11) is a rule Rvr for two conductors coupled at the same point 25:
Tv(S11)=Tv(S2)·Tv(S3).
Tv(S11)=Tv(S2)·Tv(S3).
[0062] Tv(S11) now being present in memory, the rule Rvr is again applied to S11 and S4.
Tv(S1)=Tv(S11)·Tv(S4).
Tv(S1)=Tv(S11)·Tv(S4).
[0063] An error occurs in the signal S11 if one of the signals S2, S3 is in the logical state H while the other signal S3, S2 is in the logical state B, or if one of the signals S2, S3 is in the error state.
[0064] The applicable rule Rv for constructing the binary decision diagram Te(S11) is a rule Rer for two conductors coupled at the point 25:
Te(s11)=Tc(s2)·Tc(s3)·└Tv(s2)·{overscore (Tv(s3))}+{overscore (Tv(s2))}·Tv(s3)┘+Te(s2)+Te(s3)
Te(s11)=Tc(s2)·Tc(s3)·└Tv(s2)·{overscore (Tv(s3))}+{overscore (Tv(s2))}·Tv(s3)┘+Te(s2)+Te(s3)
[0065] An error occurs in the signal S1 if one of the signals S11, S4 is in the logical state H while the other signal S4, S11 is in the logical state B, or if one of the signals S11, S4 is in the error state.
[0066] The rule Rer is again applicable for constructing the binary decision diagram Te(S1).
Te(s1)=Tc(s11)·Tc(s4)·└Tv(s11)·{overscore (Tv(s4))}+{overscore (Tv(s11))}·Tv(s4)┘+Te(s11)+Te(s4)
Te(s1)=Tc(s11)·Tc(s4)·└Tv(s11)·{overscore (Tv(s4))}+{overscore (Tv(s11))}·Tv(s4)┘+Te(s11)+Te(s4)
[0067] The variable xc1 is equal to 1 if the state of the signal S1 is the logical state B or the logical state H. The signal S11 is in the state B or H if and only if the signal S2 or the signal S3 is in the logical state B or H and if no error results from the signals S2 and S3 in the signal S11. The applicable rule Rc for constructing the binary decision diagram Tc(S11) is a rule Rcr for two conductors coupled at the point 25:
Tc(s11)=[Tc(s2)+Tc(s3)]·└{overscore (Tc(s2)·Tc(s3)·[Tv(s2)·{double overscore (Tv(s3))}{overscore (Tc(s2)·Tc(s3)·[Tv(s2)·{double overscore (Tv(s3))}{overscore (Tc(s2)·Tc(s3)·[Tv(s2)·{double overscore (Tv(s3))}{overscore (Tc(s2)·Tc(s3)·[Tv(s2)·{double overscore (Tv(s3))}+{double overscore (Tv(s2))}·Tv(s3))}]┘
Tc(s11)=[Tc(s2)+Tc(s3)]·└{overscore (Tc(s2))}+{overscore (Tc(s3))}+└{overscore (Tv(s2))}+Tv(s3)┘·└Tv(s2)+{overscore (Tv(s3))}|┘
Tc(s11)=+Tc(s2)·[{overscore (Tc(s3))}+{overscore (Tv(s2))}·{overscore (Tv(s3))}+Tv(s2)·Tv(s3)]+Tc(s3)·[{overscore (Tc(s2))}+{overscore (Tv(s2))}·{overscore (Tv(s3))}+Tv(s2)·Tv(s3)]
Tc(s11)=[Tc(s2)+Tc(s3)]·└{overscore (Tc(s2)·Tc(s3)·[Tv(s2)·{double overscore (Tv(s3))}{overscore (Tc(s2)·Tc(s3)·[Tv(s2)·{double overscore (Tv(s3))}{overscore (Tc(s2)·Tc(s3)·[Tv(s2)·{double overscore (Tv(s3))}{overscore (Tc(s2)·Tc(s3)·[Tv(s2)·{double overscore (Tv(s3))}+{double overscore (Tv(s2))}·Tv(s3))}]┘
Tc(s11)=[Tc(s2)+Tc(s3)]·└{overscore (Tc(s2))}+{overscore (Tc(s3))}+└{overscore (Tv(s2))}+Tv(s3)┘·└Tv(s2)+{overscore (Tv(s3))}|┘
Tc(s11)=+Tc(s2)·[{overscore (Tc(s3))}+{overscore (Tv(s2))}·{overscore (Tv(s3))}+Tv(s2)·Tv(s3)]+Tc(s3)·[{overscore (Tc(s2))}+{overscore (Tv(s2))}·{overscore (Tv(s3))}+Tv(s2)·Tv(s3)]
[0068] The rule Rcr is again applied for the signals S11 and S4:
Tc(s1)=+Tc(s11)·[{overscore (Tc(s4))}+{overscore (Tv(s11))}·{overscore (Tv(s4))}+Tv(s11)·Tv(s4)]+Tc(s4)·[{overscore (Tc(s11))}+{overscore (Tv(s11))}·{overscore (Tv(s4))}+Tv(s11)·Tv(s4)]
Tc(s1)=+Tc(s11)·[{overscore (Tc(s4))}+{overscore (Tv(s11))}·{overscore (Tv(s4))}+Tv(s11)·Tv(s4)]+Tc(s4)·[{overscore (Tc(s11))}+{overscore (Tv(s11))}·{overscore (Tv(s4))}+Tv(s11)·Tv(s4)]
[0069] If for S2, Tv(S2), Tc(S2), Te(S2) are not present in memory, the second step is repeated for the signal S2.
[0070] The conductor 22 is coupled to the drain of an N-type MOS transistor 27. The grid of the transistor 27 receives a signal S5 and the source of the transistor 27 receives a signal S6. In CMOS technology, the concept of a drain, and of a source, of a transistor is tied in a known way to its operating state; these two concepts are also interchangeable.
[0071] The signal S2 is in the logical state H if and only if the signals S5 and S6 are in the logical state H. The signal S2 is in the high-impedance state Z if and only if the signal S5 is in the logical state B or if the signal S5 is in the logical state H and the signal S6 is in the high-impedance state Z. The rule Rv that is applied is a rule Rvn:
Tv(s2)=[Tc(s5)·Tv(s5)·Tc(s6)·Tv(s6)+Tc(s5)·{overscore (Tv(s5))}]+Tc(s5)·Tv(s5)·{overscore (Tc(s6))}·Tv(s6)
Which with simplification yields:
Tv(s2)=[Tc(s5)·Tv(s5)·Tv(s6)+Tc(s5)·{overscore (Tv(s5))}]
Tv(s2)=[Tc(s5)·Tv(s5)·Tc(s6)·Tv(s6)+Tc(s5)·{overscore (Tv(s5))}]+Tc(s5)·Tv(s5)·{overscore (Tc(s6))}·Tv(s6)
Which with simplification yields:
Tv(s2)=[Tc(s5)·Tv(s5)·Tv(s6)+Tc(s5)·{overscore (Tv(s5))}]
[0072] The signal S2 is in the error state E if the signal S5 is in the high-impedance state Z. In fact, a transistor grid hit by a high-impedance signal is particularly noise-sensitive. The rule Re that is applied is a rule Ren:
Te(s2)=Tv(s5)·{overscore (Tc(s5))}
Te(s2)=Tv(s5)·{overscore (Tc(s5))}
[0073] The signal S2 is in the logical state B or H if and only if the signal S5 is in the logical state H and the signal S6 is in the logical state B or H. The rule Rc that is applied is a rule Rcn:
Tc(s2)=Tc(s5)·Tv(s5)·Tc(s6)
Tc(s2)=Tc(s5)·Tv(s5)·Tc(s6)
[0074] If for S4, Tv(S4), Tc(S4), Te(S4) are not present in memory, the second step is repeated for the signal S4.
[0075] The conductor 23 is coupled to the drain of an N-type MOS transistor 26. The grid of the transistor 26 receives a signal S7 and the source of the transistor 26 receives a signal S8.
[0076] The first two steps are executed for the signal S3 using the same rules Rvn, Rcn and Ren as for the signal S2 in order to obtain:
Tv(s3)=[Tc(s7)·Tv(s7)·Tv(s8)+Tc(s7)·{overscore (Tv(s7))}]
Te(s3)=Tv(s7)·{overscore (Tc(s7))}
Tc(s3)=Tc(s7)·Tv(s7)·Tc(s8)
Tv(s3)=[Tc(s7)·Tv(s7)·Tv(s8)+Tc(s7)·{overscore (Tv(s7))}]
Te(s3)=Tv(s7)·{overscore (Tc(s7))}
Tc(s3)=Tc(s7)·Tv(s7)·Tc(s8)
[0077] The conductor 24 is coupled to the drain of a P-type MOS transistor 29. The grid of the transistor 29 receives a signal S9 and the source of the transistor 27 receives a signal S10.
[0078] The signal S4 is in the logical state H if and only if the signals S9 and S10 are respectively in the logical state B and H. The signal S4 is in the high-impedance state Z if and only if the signal S9 is in the logical state H or if the signal S9 is in the logical state B and the signal S10 is in the high-impedance state Z. After simplification, the rule Rv that is applied is a rule Rvp:
Tv(s4)=[Tc(s9)·{overscore (Tv(s9))}·Tv(s10)+Tc(s9)·Tv(s9)]
Tv(s4)=[Tc(s9)·{overscore (Tv(s9))}·Tv(s10)+Tc(s9)·Tv(s9)]
[0079] The signal S4 is in the error state E if the signal S9 is in the high-impedance state Z. In fact, a transistor grid hit by a high-impedance signal is particularly noise-sensitive. The rule Re that is applied is a rule Rep:
Te(s4)=Tv(s9)·{overscore (Tc(s9))}
Te(s4)=Tv(s9)·{overscore (Tc(s9))}
[0080] The signal S4 is in the logical state B or H if and only if the signal S9 is in the logical state B and the signal S10 is in the logical state B or H. The rule Rc that is applied is a rule Rcp:
Tc(s4)=Tc(s9)·{overscore (Tv(s9))}·Tc(s10)
Tc(s4)=Tc(s9)·{overscore (Tv(s9))}·Tc(s10)
[0081] Thus, the binary decision diagrams Tv(S1), Tc(S1), Te(S1) are obtained as a function of the binary decision diagrams Tv(S5), Tc(S5), Tv(S6), Tc(S6), Tv(S7), Tc(S7), Tv(S8), Tc(S8), Tv(S9), Tc(S9), Tv(S10), Tc(S10).
[0082] If one is interested in the possible states of the signal S1, for two possible logical states B and H of each of the signals S5 through S10, the third step is executed, wherein each of the binary decision diagrams Tc(S5), Tc(S6), Tc(S7), Tc(S8), Tc(S9), Tc(S10) equals 1 and wherein each of the binary decision diagrams Tv(S5), Tv(S6), Tv(S7), Tv(S8), Tv(S9), Tv(S10) is replaced, respectively, by each of the binary decision diagrams {xv5;0;1}, {xv6;0;1}, {xv7;0;1}, {xv8;0;1}, {xv9;0;1}, {xv10;0;1}. Thus, three binary decision diagrams Tv(S1), Tc(S1), Te(S1) are obtained with nodes occupied by the variables xv5, xv6, xv7, xv8, xv9, xv10 and with leaves at 0 or at 1.
[0083] In order to know, for example, which values of xv5, xv6, xv7, xv8, xv9, xv10 put the signal S1 in the logical state H, a binary decision diagram T1(S1) is constructed using the rule R1:
T1(s1)=Tv(s1)·Tc(s1)·{overscore (Te(s1))}
T1(s1)=Tv(s1)·Tc(s1)·{overscore (Te(s1))}
[0084] The binary decision diagram T1(S1) is scanned through each branch leading from the node occupied by the variable xv5, to a leaf occupied by the value 1, saving in a logical conjunction each variable xv5, xv6, xv7, xv8, xv9, xv10 encountered, as is if the scanning of the branch is done by means of the right pointer and complemented if the scanning of the branch is done by means of the left pointer. Each logical conjunction obtained by the scan through a branch is saved in a logical disjunction until all of the branches leading to a leaf occupied by the value 1 have been scanned. Thus, a logical equation of the circuit of FIG. 3 is obtained:
s1=+s5·s6·s7·s8·{overscore (s9)}·s10+s5·s6·s7·s8·s9+s5·s6·{overscore (s7)}·{overscore (s9)}·s10 +{overscore (s5)}·s7·s8·s9+{overscore (s5)}·s7·s8·{overscore (s9)}·s10+{overscore (s5)}·{overscore (s7)}·{overscore (s9)}·s10+s5·s6·s7·{overscore (s9)}
s1=+s5·s6·s7·s8·{overscore (s9)}·s10+s5·s6·s7·s8·s9+s5·s6·{overscore (s7)}·{overscore (s9)}·s10 +{overscore (s5)}·s7·s8·s9+{overscore (s5)}·s7·s8·{overscore (s9)}·s10+{overscore (s5)}·{overscore (s7)}·{overscore (s9)}·s10+s5·s6·s7·{overscore (s9)}
[0085] Let's apply, for example, the method described above to the elementary circuit of FIG. 4 , wherein five input signals S16, S17, S18, S19, S21 are combined so as to generate a signal S12.
[0086] The elementary circuit entity of FIG. 4 comprises two NMOS transistors 34 and 35, whose sources are respectively hit by the signals S16 and S18, whose grids are respectively hit by the signals S17 and S19, and whose drains respectively generate signals S13 and S14 in conductors 29 and 30. The elementary circuit entity of FIG. 4 also comprises two PMOS transistors 37 and 36, whose sources are respectively hit by the signal S21, and a signal S20, whose grids are respectively hit by the signals S17 and S19, and whose drains respectively generate the signal S20 and a signal S15 in conductors 32 and 31. The conductors 29, 30 and 31 are connected to a conductor 28 at a point 33.
[0087] The fifth step scans each of the signals S16, S17, S18, S19, S21 of the netlist and for each signal scanned, executes the first two steps.
[0088] In the case where the sources of the transistors 34 and 35 are connected to the ground, the binary decision diagrams Tv(S16), Tc(S16), Te(S16), Tv(S18), Tc(S18), Te(S18) are respectively equal to the singletons {0}, {1}, {0}, {0}, {1}, {0}. In the case where the source of the transistor 37 is connected to the supply, the binary decision diagrams Tv(S21), Tc(S21), Te(S21) are respectively equal to the singletons {1}, {1}, {0}. In the case where the grids of the transistors 34 and 37 are connected to an input, necessarily set to a logical state 0 or 1, the binary decision diagrams Tv(S17), Tc(S17), Te(S17) are respectively {xv17,0,1}, {1}, {0}. In the case where the grids of the transistors 35 and 36 are connected to an input, necessarily set to a logical state B or H, the binary decision diagrams Tv(S19), Tc(S19), Te(S19) are respectively {x19,0,1}, {1}, {0}. The elements of the elementary circuit hit by the signals s16, s17, s18, s19, s21 of the net list are then scanned, in order to associate with the transistors 34, 35, 37, respectively, the signals S13, S14, S15, for each of which steps 1 through 5 are executed.
[0089] For the transistor 34, the rules Rvn, Rcn Ren are applied to the signal S13, in the second step.
Tv(s13)=[Tc(s17)·Tv(s17)·Tv(s16)+Tc(s17)·{overscore (Tv(s17))}]
Tc(s13)=Tc(s17)·Tv(s17)·Tv(s16)
Te(s13)=Tv(s17)·{overscore (Tc(s17))}
Tv(s13)=[Tc(s17)·Tv(s17)·Tv(s16)+Tc(s17)·{overscore (Tv(s17))}]
Tc(s13)=Tc(s17)·Tv(s17)·Tv(s16)
Te(s13)=Tv(s17)·{overscore (Tc(s17))}
[0090] Which yields, when applying the known rules for combining binary decision diagrams:
Tv(S13)={xv17,1,0}
Tc(S13)={xv17,0,1}
Te(S13)={0}
Tv(S13)={xv17,1,0}
Tc(S13)={xv17,0,1}
Te(S13)={0}
[0091] For the transistor 35, the rules Rvn, Rcn Ren are applied to the signal S14, in the second step, so as to yield, in identical fashion:
Tv(S14)={xv19,1,0}
Tc(S14)={xv19,0,1}
Te(S14)={0}
Tv(S14)={xv19,1,0}
Tc(S14)={xv19,0,1}
Te(S14)={0}
[0092] For the transistor 37, the rules Rvp, Rcp Rep are applied to the signal S20, in the second step.
Tv(s20)=[Tc(s17)·{overscore (Tv(s17))}·Tv(s21)+Tc(s17)·Tv(s17)]
Tc(s20)=Tc(s17)·{overscore (Tv(s17))}·Tc(s21)
Te(s20)=Tv(s17)·{overscore (Tc(s17))}
Tv(s20)=[Tc(s17)·{overscore (Tv(s17))}·Tv(s21)+Tc(s17)·Tv(s17)]
Tc(s20)=Tc(s17)·{overscore (Tv(s17))}·Tc(s21)
Te(s20)=Tv(s17)·{overscore (Tc(s17))}
[0093] Which yields, when applying the known rules for combining binary decision diagrams:
Tv(S20)={1}
Tc(S20)={xv17,1,0}
Te(S20)={0}
Tv(S20)={1}
Tc(S20)={xv17,1,0}
Te(S20)={0}
[0094] The sixth step is re-activated in order to scan the elements of the elementary circuit hit by the previously generated signals S13, S14, S20 of the net list, and associates with these elements, which are the point 33 and the transistor 36, respectively the signals S22 and S15, for each of which it executes the first two steps.
[0095] For the point 33, the rules Rvr, Rcr Ren are applied to the signal S22, in the second step.
Tv(S22)=Tv(S13)·Tv(S14)
Tc(s22)=+Tc(s13)·[{overscore (Tc(s14))}+{overscore (Tv(s13))}·{overscore (Tv(s14))}+Tv(s13)·Tv(s14)]+Tc(s14)·[{overscore (Tc(s13))}+{overscore (Tv(s13))}·{overscore (Tv(s14))}+Tv(s13)·Tv(s14)]
Te(s22)=Tc(s13)·Tc(s14)·└Tv(s13)·{overscore (Tv(s14))}+{overscore (Tv(s13))}·Tv(s14)┘
Tv(S22)=Tv(S13)·Tv(S14)
Tc(s22)=+Tc(s13)·[{overscore (Tc(s14))}+{overscore (Tv(s13))}·{overscore (Tv(s14))}+Tv(s13)·Tv(s14)]+Tc(s14)·[{overscore (Tc(s13))}+{overscore (Tv(s13))}·{overscore (Tv(s14))}+Tv(s13)·Tv(s14)]
Te(s22)=Tc(s13)·Tc(s14)·└Tv(s13)·{overscore (Tv(s14))}+{overscore (Tv(s13))}·Tv(s14)┘
[0096] Which yields, when applying the known rules for combining binary decision diagrams:
Tv(S22)={xv17,{xv19,1,0},0}
Tc(S22)={xv17,{xv19,0,1},1}
Te(S22)={xv17,0{xv19,0,0}}={0}
Tv(S22)={xv17,{xv19,1,0},0}
Tc(S22)={xv17,{xv19,0,1},1}
Te(S22)={xv17,0{xv19,0,0}}={0}
[0097] For the transistor 36, the rules Rvp, Rcp Rep are applied to the signal S15, in the second step.
Tv(s15)=[Tc(s19)·{overscore (Tv(s19))}·Tv(s20)+Tc(s19)·Tv(s19)]
Tc(s15)=Tc(s19)·{overscore (Tv(s19))}·Tc(s20)
Te(s15)=Tv(s19)·{overscore (Tc(s19))}
Tv(s15)=[Tc(s19)·{overscore (Tv(s19))}·Tv(s20)+Tc(s19)·Tv(s19)]
Tc(s15)=Tc(s19)·{overscore (Tv(s19))}·Tc(s20)
Te(s15)=Tv(s19)·{overscore (Tc(s19))}
[0098] Which yields, when applying the known rules for combining binary decision diagrams:
Tv(S15)={1}
Tc(S15)={xv17,{xv19,1,0},0}
Te(S15)={0}
Tv(S15)={1}
Tc(S15)={xv17,{xv19,1,0},0}
Te(S15)={0}
[0099] The sixth step is re-activated in order to scan the elements of the elementary circuit hit by the previously generated signals S22, S15 of the netlist and associates with the only element found, which is the point 33, the signal S12, for which it executes the first two steps.
[0100] For the point 33, the rules Rvr, Rcr, Rer are applied to the signal S12, in the second step.
Tv(S12)=Tv(S22)·Tv(S15)
Tc(s12)=+Tc(s22)·[{overscore (Tc(s15))}+{overscore (Tv(s22))}·{overscore (Tv(s15))}+Tv(s22)·Tv(s15)]+Tc(s15)·[{overscore (Tc(s22))}+{overscore (Tv(s22))}·{overscore (Tv(s15))}+Tv(s22)·Tv(s15)]
Te(s12)=Tc(s22)·Tc(s15)·└Tv(s22)·{overscore (Tv(s15))}+{overscore (Tv(s22))}·Tv(s15)┘
Tv(S12)=Tv(S22)·Tv(S15)
Tc(s12)=+Tc(s22)·[{overscore (Tc(s15))}+{overscore (Tv(s22))}·{overscore (Tv(s15))}+Tv(s22)·Tv(s15)]+Tc(s15)·[{overscore (Tc(s22))}+{overscore (Tv(s22))}·{overscore (Tv(s15))}+Tv(s22)·Tv(s15)]
Te(s12)=Tc(s22)·Tc(s15)·└Tv(s22)·{overscore (Tv(s15))}+{overscore (Tv(s22))}·Tv(s15)┘
[0101] Which yields, when applying the known rules for combining binary decision diagrams:
Tv(S12)={xv17,{xv19,1,0},0}
Tc(S12)={xv17,1,{xv19,1,1}}={1}
Te(S12)={xv17,0,{xv19,0,0}}={0}
Tv(S12)={xv17,{xv19,1,0},0}
Tc(S12)={xv17,1,{xv19,1,1}}={1}
Te(S12)={xv17,0,{xv19,0,0}}={0}
[0102] The only remaining signal being the signal S12, the fourth step yields the binary decision diagram Tlog(S12) using the rule Rlog:
Tlog(S12)=Tv(S12)·Tc(S12)
={xv17,{xv19,1,0},0}
Tlog(S12)=Tv(S12)·Tc(S12)
={xv17,{xv19,1,0},0}
[0103] The binary variable xv12 is in the logical state 1 for the branches of the binary decision diagram Tlog(S12) that lead to 1. This is written:
xv12 ={overscore (xv17)}·{overscore (xv19)}
xv12 ={overscore (xv17)}·{overscore (xv19)}
[0104] In the fourth step, the circuit of FIG. 4 is recognized as being a NOR gate.
[0105] FIG. 2 represents steps of the method for indicating, in connection with a physical element generating a first signal (S11) as a function of a second signal (S5) and third signals (S6, S7, S8), a combination of states of said third signals such that a state change of said second signal changes said first signal from a binary state to a nonbinary state.
[0106] Associated with a signal Si are two or three binary decision diagrams Tc(Si)={xvj,fi0,fi1}, Tv(Si)={xvj,gi0,gi1}, Te(Si)={xvj,ei0,ei1}, wherein fi0, gi0, ei0 are pointers in binary decision subdiagrams when xvj is equal to 0, and wherein fi1, gi1, ei1 are pointers in binary decision subdiagrams when xvj is equal to 1, xcj being in all cases considered equal to 1, since in this case only the binary states B, H of the signal sj with which the variable xvj is associated are considered. For simplicity's sake, these pointers will be likened to the binary decision subdiagrams to which they point. The method described is valid for any signal Sk with which a variable xvk is associated by re-ordering, in a known way, the binary decision diagrams so to move xvk up to the root of the binary decision diagram.
[0107] The values at 1 in the binary decision subdiagram fi0 encode combinations of variables xvn, for which the variable xci has the value 1, which means that the signal Si is in one of the binary states B or H when the variable xvj has the value 0.
[0108] The values at 1 in the binary decision subdiagram fi1 encode combinations of variables xvn for which the variable xci has the value 1, which means that the signal Si is in one of the binary states B or H when the variable xvj has the value 1.
[0109] The values at 1 in the binary decision subdiagram gi0 encode combinations of variables xvn for which the variable xvi has the value 1, which means that the signal Si is in the binary state H or in the nonbinary state Z when the variable xvj has the value 0.
[0110] The values at 1 in the binary decision subdiagram gi1 encode combinations of variables xvn for which the variable xvi has the value 1, which means that the signal Si is in the binary state H or in the nonbinary state Z when the variable xvj has the value 1.
[0111] The values at 1 in the binary decision subdiagram ei0 encode combinations of variables xvn for which the variables xci, xvi have the value 0, which means that the signal Si is in an indeterminate state like the nonbinary state E when the variable xvj has the value 0.
[0112] The values at 1 in the binary decision subdiagram ei0 encode combinations of variables xvn for which the variables xci, xvi have the value 0, which means that the signal Si is in an indeterminate state like the nonbinary state E when the variable xvj has the value 1.
[0113] In the remainder of the description, the symbol 
placed before a reference of a binary decision diagram indicates that the binary decision diagram is complemented in the known way according to the above.
placed before a reference of a binary decision diagram indicates that the binary decision diagram is complemented in the known way according to the above.[0114] A step 8 generates a binary decision subdiagram Cpi0 by combining the binary decision subdiagrams mentioned above using the formula:
Cpi0=fi0·ei0·(ei1+gi1·fi1).
Cpi0=fi0·
ei0·(ei1+gi1·fi1).
[0115] The combination gi1·fi1 encodes combinations of variables xvn for which the variable xvi has the value 1, which means that the signal Si is in the binary state H or in the nonbinary state Z, and for which the variable xci does not have the value 1, which means that the signal Si is not in one of the binary states B or H when the variable xvj has the value 1. The disjunction of this combination with ei1 thus encodes the combinations of variables xvn for which the signal Si is not in one of the binary states B or H when the variable xvj has the value 1. The combination fi0·ei0 encodes combinations of variables xvn for which the variable xvi has the value 1, which means that the signal Si is in the binary state H or in the nonbinary state Z, and for which the variable xci does not have the value 0, which means that the signal Si is not in a nonbinary state, when the variable xvj has the value 0. The disjunction of this last combination with ei1 thus encodes the combinations of variables xvn for which the signal Si is in one of the binary states B or H when the variable xvj has the value 0, and is not in one of the binary states B or H when the variable xvj has the value 1.
fi1 encodes combinations of variables xvn for which the variable xvi has the value 1, which means that the signal Si is in the binary state H or in the nonbinary state Z, and for which the variable xci does not have the value 1, which means that the signal Si is not in one of the binary states B or H when the variable xvj has the value 1. The disjunction of this combination with ei1 thus encodes the combinations of variables xvn for which the signal Si is not in one of the binary states B or H when the variable xvj has the value 1. The combination fi0·ei0 encodes combinations of variables xvn for which the variable xvi has the value 1, which means that the signal Si is in the binary state H or in the nonbinary state Z, and for which the variable xci does not have the value 0, which means that the signal Si is not in a nonbinary state, when the variable xvj has the value 0. The disjunction of this last combination with ei1 thus encodes the combinations of variables xvn for which the signal Si is in one of the binary states B or H when the variable xvj has the value 0, and is not in one of the binary states B or H when the variable xvj has the value 1.[0116] The values at 1 in Cpi0 correspond to a set of combinations of values xvn for which Si is in a binary state when xvj is not at the value 1, and for which Si is not in a binary state when xvj is in the value 1.
[0117] Thus, for the combinations at 1 of the variables xvn, the signal Si changes from a binary state to a nonbinary state when the signal Sj changes from the first state B to the second state H.
[0118] When the physical element is such that the state of the signal Si is never indeterminate, the binary decision subdiagram e11 is always at 0 and the binary decision subdiagram e10 is always at 1. These binary decision subdiagrams have not been taken into consideration in a step 7, which in this case uses the following simplified formula for generating the binary decision subdiagram Cpi0:
Cpi0=fi0·gi1·
fi1).
e10 is always at 1. These binary decision subdiagrams have not been taken into consideration in a step 7, which in this case uses the following simplified formula for generating the binary decision subdiagram Cpi0:
Cpi0=fi0·gi1·
fi1).
[0119] A step 10 generates a binary decision subdiagram Cpi1 by combining the binary decision subdiagrams mentioned above using the formula:
Cpi1=fi1·ei1·(ei0+gi0·fi0).
Cpi1=fi1·
ei1·(ei0+gi0·fi0).
[0120] The combination gi0·fi0 encodes combinations of variables xvn for which the variable xvi has the value 1, which means that the signal Si is in the binary state H or in the nonbinary state Z, and for which the variable xci does not have the value 1, which means that the signal Si is not in one of the binary states B or H when the variable xvj has the value 0. The disjunction of this combination with ei0 thus encodes the combinations of variables xvn for which the signal Si is not in one of the binary states B or H when the variable xvj has the value 0. The combination fi1·ei1 encodes combinations of variables xvn for which the variable xvi has the value 1, which means that the signal Si is in the binary state H or in the nonbinary state Z, and for which the variable xci does not have the value 0, which means that the signal Si is not in a nonbinary state, when the variable xvj has the value 1. The disjunction of this last combination with ei0 thus encodes the combinations of variables xvn for which the signal Si is in one of the binary states B or H when the variable xvj has the value 1, and is not in one of the binary states B or H when the variable xvj has the value 0.
fi0 encodes combinations of variables xvn for which the variable xvi has the value 1, which means that the signal Si is in the binary state H or in the nonbinary state Z, and for which the variable xci does not have the value 1, which means that the signal Si is not in one of the binary states B or H when the variable xvj has the value 0. The disjunction of this combination with ei0 thus encodes the combinations of variables xvn for which the signal Si is not in one of the binary states B or H when the variable xvj has the value 0. The combination fi1·ei1 encodes combinations of variables xvn for which the variable xvi has the value 1, which means that the signal Si is in the binary state H or in the nonbinary state Z, and for which the variable xci does not have the value 0, which means that the signal Si is not in a nonbinary state, when the variable xvj has the value 1. The disjunction of this last combination with ei0 thus encodes the combinations of variables xvn for which the signal Si is in one of the binary states B or H when the variable xvj has the value 1, and is not in one of the binary states B or H when the variable xvj has the value 0.[0121] The values at 1 of Cpi1 correspond to a set of combinations of values xvn for which Si is in a binary state when xvj is not at the value 0, and for which Si is not in a binary state when xvj is at the value 0.
[0122] Thus, for the combinations at 1 of the variables xvn, the signal Si changes from a binary state to a nonbinary state when the signal Sj changes from the second state H to the first state B.
[0123] When the physical element is such that the state of the signal Si is never indeterminate, the binary decision subdiagram e11 is always at 0 and the binary decision subdiagram e10 is always at 1. These binary decision subdiagrams have not been taken into consideration in a step 9, which in this case uses the following simplified formula for generating the binary decision subdiagram Cpi1:
Cpi1=fi1·gi0·fi0).
e10 is always at 1. These binary decision subdiagrams have not been taken into consideration in a step 9, which in this case uses the following simplified formula for generating the binary decision subdiagram Cpi1:
Cpi1=fi1·gi0·
fi0).
[0124] A step 11 generates a binary decision diagram Cp(Si,sj) with the variable xvj at its root, a left branch equal to the subdiagram Cpi0 and a right branch equal to the subdiagram Cpi1. The values at 1 of this binary decision subdiagram encode the combinations of signals Sn for which a binary state change of the signal Sj changes the signal Si from a binary state to a nonbinary state.
[0125] A step 13 generates a binary decision subdiagram Cdi0 by combining the binary decision subdiagrams mentioned above using the formula:
Cdi0=fi0·
gi0·ei0·fi1·gi1·ei1.
Cdi0=fi0·
gi0·ei0·fi1·gi1·ei1.
[0126] The combination gi1·fi1 encodes combinations of variables xvn for which the variable xvi has the value 1, which means that the signal Si is in the binary state H or in the nonbinary state Z, and for which the variable xci has the value 1, which means that the signal Si is in the binary state H when the variable xvj has the value 1. The conjunction of this combination with ei1 thus encodes the combinations of variables xvn for which the signal Si is in the binary state H when the variable xvj has the value 1. The combination fi0·ei0 encodes combinations of variables xvn for which the variable xvi has the value 1, which means that the signal Si is in the binary state H or in the binary state B, and for which the variable xci does not have the value 0, which means that the signal Si is not in a nonbinary state, when the variable xvj has the value 0. The conjunction of this last combination with gi0 thus encodes the combinations of variables xvn for which the signal Si is in the binary state B when the variable xvj has the value 0, and is not in a nonbinary state when the variable xvj has the value 0.
ei1 thus encodes the combinations of variables xvn for which the signal Si is in the binary state H when the variable xvj has the value 1. The combination fi0·ei0 encodes combinations of variables xvn for which the variable xvi has the value 1, which means that the signal Si is in the binary state H or in the binary state B, and for which the variable xci does not have the value 0, which means that the signal Si is not in a nonbinary state, when the variable xvj has the value 0. The conjunction of this last combination with gi0 thus encodes the combinations of variables xvn for which the signal Si is in the binary state B when the variable xvj has the value 0, and is not in a nonbinary state when the variable xvj has the value 0.[0127] The values at 1 of Cdi0 correspond to a set of combinations of values xvn for which Si is in a binary state B when xvj is not at the value 0, and for which Si is in a binary state H when xvj is at the value 1.
[0128] Thus, for the combinations at 1 of the variables xvn, the signal Si changes from a binary state B to a binary state H when the signal Sj changes from the first state B to the second state H. Symmetrically, the signal Si changes from a binary state H to a binary state B when the signal Sj changes from the first state B to the second state H.
[0129] When the physical element is such that the state of the signal Si is never indeterminate, the binary decision subdiagram e11 is always at 0 and the binary decision subdiagram e10 is always at 1. These binary decision subdiagrams have not been taken into consideration in a step 12, which in this case uses the following simplified formula for generating the binary decision subdiagram Cdi0:
Cdi0=fi0·
gi0·fi1·gi1·.
e10 is always at 1. These binary decision subdiagrams have not been taken into consideration in a step 12, which in this case uses the following simplified formula for generating the binary decision subdiagram Cdi0:
Cdi0=fi0·
gi0·fi1·gi1·.
[0130] A step 15 generates a binary decision subdiagram Cii(si,sj) by combining the binary decision subdiagrams mentioned above using the formula:
Cii(si,sj)=fi0·gi1·ei0·fi1·gi0·ei1.
Cii(si,sj)=fi0·
gi1·ei0·fi1·gi0·ei1.
[0131] The combination gi0 fi0 encodes combinations of variables xvn for which the variable xvi has the value 1, which means that the signal Si is in the binary state H when the variable xvj has the value 0. The conjunction of this combination with ei1 thus encodes the combinations of variables xvn for which the signal Si is not in an indeterminate state when the variable xvj does not have the value 0. The combination fi1·gi1 encodes combinations of variables xvn for which the variable xvi has the value 0, which means that the signal Si is in the binary state B when the variable xvj has the value 1. The conjunction of this last combination with ei0 thus encodes the combinations of variables xvn for which the signal Si is not in an indeterminate state, when the variable xvj does not have the value 1.
ei1 thus encodes the combinations of variables xvn for which the signal Si is not in an indeterminate state when the variable xvj does not have the value 0. The combination fi1·gi1 encodes combinations of variables xvn for which the variable xvi has the value 0, which means that the signal Si is in the binary state B when the variable xvj has the value 1. The conjunction of this last combination with ei0 thus encodes the combinations of variables xvn for which the signal Si is not in an indeterminate state, when the variable xvj does not have the value 1.[0132] The values at 1 of Cii(Si,Sj) correspond to a set of combinations of values xvn for which Si is in a binary state H when xvj is at the value 0, and for which Si is in a binary state B when xvj is at the value 1.
[0133] Thus, for the combinations at 1 of the variables xvn, the signal Si changes from a binary state H to a binary state B when the signal Sj changes from the first state B to the second state H. Symmetrically, the signal Si changes from a binary state B to a binary state H when the signal Sj changes from the second state H to the first state H.
[0134] When the physical element is such that the state of the signal Si is never indeterminate, the binary decision subdiagram e11 is always at 0 and the binary decision subdiagram e10 is always at 1. These binary decision subdiagrams have not been taken into consideration in a step 14, which in this case uses the following simplified formula for generating the binary decision subdiagram Cii(Si,Sj):
Cii(Si,Sj)=fi0·gi1·fi1·gi0.
e10 is always at 1. These binary decision subdiagrams have not been taken into consideration in a step 14, which in this case uses the following simplified formula for generating the binary decision subdiagram Cii(Si,Sj):
Cii(Si,Sj)=fi0·
gi1·fi1·gi0.
[0135] Steps 7 through 15 have in common the generation of a binary decision diagram wherein the values at 1 correspond to a first state of the signal Si when xvj is at a first value and to a second, different state when xvj is not at the first value.
[0136] Returning to the elementary circuit of FIG. 3 , the three binary decision diagrams are developed recursively from each of the binary decision diagrams Tc(S5), Tc(S6), Tc(S7), Tc(S8), Tc(S9), Tc(S10) valued at 1, and from each of the binary decision diagrams Tv(S5), Tv(S6), Tv(S7), Tv(S8), Tv(S9), Tv(S10), respectively replaced by each of the binary decision diagrams {xv5;0;1}, {xv6;0;1}, {xv7;0;1}, {xv8;0;1}, {xv9;0;1}, {xv10;0;1}. Thus we obtain, in alphanumeric order:
[0137] For S4:
Tv(s4)=[Tc(s9)·{overscore (Tv(s9))}·Tv(s10)+Tc(s9)·Tv(s9)]
Tv(S4)={xv9;{xv10;0;1};0}+{xv9;0;1}
Tv(S4)={xv9;{xv10;0;1};1}
Tc(s4)=Tc(s9)·{overscore (Tv(s9))}·Tc(s10)
Tc(S4)={xv9;1;0}
Te(S4)={0}
Tv(s4)=[Tc(s9)·{overscore (Tv(s9))}·Tv(s10)+Tc(s9)·Tv(s9)]
Tv(S4)={xv9;{xv10;0;1};0}+{xv9;0;1}
Tv(S4)={xv9;{xv10;0;1};1}
Tc(s4)=Tc(s9)·{overscore (Tv(s9))}·Tc(s10)
Tc(S4)={xv9;1;0}
Te(S4)={0}
[0138] For S3:
Tv(s3)=[Tc(s7)·Tv(s7)·Tv(s8)+Tc(s7)·{overscore (Tv(s7))}]
Tv(S3)={xv7;0;{xv8;0;1}}+{xv7;1;0}
Tv(S3)={xv7;1;{xv8;0;1}}
Tc(s3)=Tc(s7)·Tv(s7)·Tc(s8)
Tc(S3)={xv7;0;1}
Te(S3)={0}
Tv(s3)=[Tc(s7)·Tv(s7)·Tv(s8)+Tc(s7)·{overscore (Tv(s7))}]
Tv(S3)={xv7;0;{xv8;0;1}}+{xv7;1;0}
Tv(S3)={xv7;1;{xv8;0;1}}
Tc(s3)=Tc(s7)·Tv(s7)·Tc(s8)
Tc(S3)={xv7;0;1}
Te(S3)={0}
[0139] For S2:
Tv(S2)={xv5;1;{xv6;0;1}}
Tc(S2)={xv5;0;1}
Te(S2)={0}
Tv(S2)={xv5;1;{xv6;0;1}}
Tc(S2)={xv5;0;1}
Te(S2)={0}
[0140] For S11:
Tc(s11)=+Tc(s2)·[{overscore (Tc(s3))}+{overscore (Tv(s2))}·{overscore (Tv(s3))}+Tv(s2)·Tv(s3)]+Tc(s3)·[{overscore (Tc(s2))}+{overscore (Tv(s2))}·{overscore (Tv(s3))}+Tv(s2)·Tv(s3)]
Tc(s11)=+Tc(s2)·[{overscore (Tc(s3))}+{overscore (Tv(s2))}·{overscore (Tv(s3))}+Tv(s2)·Tv(s3)]+Tc(s3)·[{overscore (Tc(s2))}+{overscore (Tv(s2))}·{overscore (Tv(s3))}+Tv(s2)·Tv(s3)]
[0141] The rules for combining binary decision diagrams yield the binary decision diagram Tc(S11) represented in FIG. 5 , i.e. a triplet {xv5;f10;f11}
[0142] Where f10 is a pointer in a binary decision subdiagram {xv7;0;1} and where f11 is a pointer in a binary decision subdiagram.
{xv6;{xv7;1;{xv8;1;0}};{xv7;1;{xv8;0;1}}}
Tv(S11)=Tv(S2)·Tv(S3).
{xv6;{xv7;1;{xv8;1;0}};{xv7;1;{xv8;0;1}}}
Tv(S11)=Tv(S2)·Tv(S3).
[0143] The rules for combining binary decision diagrams yield the binary decision diagram Tc(S11) represented in FIG. 5 , i.e. a triplet {xv5;f10;f11}
[0144] Where g10 is a pointer in a binary decision subdiagram {xv7;1;{xv8;0;1}} and where g11 is a pointer in a binary decision subdiagram {xv6;0;{xv7;1;{xv8;0;1}}}.
Te(s11)=Tc(s2)·Tc(s3)·└Tv(s2)·{overscore (Tv(s3))}+{overscore (Tv(s2))}·Tv(s3)┘+Te(s2)+Te(s3)
Te(s11)=Tc(s2)·Tc(s3)·└Tv(s2)·{overscore (Tv(s3))}+{overscore (Tv(s2))}·Tv(s3)┘+Te(s2)+Te(s3)
[0145] The rules for combining binary decision diagrams yield the binary decision diagram Te(S11) represented in FIG. 6 , i.e. a triplet {xv5;e10;e11}
[0146] Where e10 is a pointer in a binary decision subdiagram {0} and where e11 is a pointer in a binary decision subdiagram {xv6;{xv7;0;{xv8;0;1}}; {xv7;0;{xv8;1;0}}}.
[0147] The binary decision subdiagram Cp(S11,S5)={xv5;cp10;cp11} is generated in step 11 with:
cp10=ƒ10·{overscore (e10)}·(e11+{overscore (ƒ11)}·g11)
cp10=ƒ10·{overscore (e10)}·(e11+{overscore (ƒ11)}·g11)
[0148] When applying the rules for combining binary decision diagrams, cp10 points to a binary decision subdiagram {xv6;{xv7;0;{xv8;0;1}}; {xv7;0;{xv8;1;0}}}}}.
cp11=ƒ11·{overscore (e11)}·(e10+{overscore (ƒ10)}·g10)
cp11=ƒ11·{overscore (e11)}·(e10+{overscore (ƒ10)}·g10)
[0149] When applying the rules for combining binary decision diagrams, cp 11 points to a binary decision subdiagram {xv6;{xv7;1;{xv8;1;0}};0}.
[0150] Which results in the binary decision diagram Cp(S11,S5) represented in FIG. 7 .
[0151] A scan of the branches of the binary decision diagram Cp(S11,S5) that lead to the value 1 yields the following logical combinations of variables:
-
- [0152] for vv5 initially at zero:
{overscore (xv6)}·xv7·xv8+xv6·xv7·{overscore (xv8)}=1 - [0153] for xv5 initially equal to 1:
{overscore (xv6)}·{overscore (xv7)}+{overscore (xv6)}·xv7·{overscore (xv8)}=1
- [0152] for vv5 initially at zero:
[0154] When a binary state is applied to each of the signals S5, S6, S7, S8, the variables xc5 xc6 xc7 xc8 all have the value 1, and the values at 0, and respectively the values at 1, of the variables xc5 xc6 xc7 xc8 represent the states B, and respectively H, of the signals S5, S6, S7, S8.
[0155] The first combination indicates that when the set of signals {S6, S7, S8} is set to the states {B, H, H} or respectively {H, B, B}, the change of the signal S5 from a state B to H changes the signal S11 from a binary state, in this case H or respectively B, to a nonbinary state, in this case an error state.
[0156] The second combination indicates that when the set of signals {S6, S7} is set to the states {B, B}, or respectively when the set of signals {S6, S7, S8} is set to the states {B, H B}, the change of the signal S5 from a state H to B, changes the signal S11 from a binary state, in this case B, to a nonbinary state, in this case a high-impedance state, or respectively an error state.
[0157] Steps 12 and 14 or 13 and 15 of the method described above make it possible to obtain, for an output signal S11, a direct context binary decision diagram Cd(S11, S5) and an inverse context binary decision diagram Ci(S11, S5) for each input signal S5 on which the signal S11 depends.
[0158] A scan of each branch of the direct context binary decision diagram Cd(S11, S5) that leads to 1 yields a logical conjunction of binary states of signals S6, S7, S8, etc., for which a binary state change of the signal S5 is sensed to cause the same binary state change of the signal S11, A scan of each branch of the inverse context binary decision diagram Ci(S11, S5) that leads to 1 yields a logical conjunction of binary states of signals S6, S7, S8, etc., for which a binary state change of the signal S5 is sensed to cause an inverse binary state change of the signal S11
[0159] By applying a combination of binary states to the signals S6, S7, S8, etc., in a material sample of the circuit tested, in such a way that a logical conjunction found in the preceding paragraph is at 1, a detection of a behavior of the output signal S11 that does not match the binary state change sensed to have been caused by a binary state change test of the signal S5, indicates a fault in this material sample. A material sample for which a fault is indicated must be declared unfit for use.
[0160] By repeating the preceding operation with S6, S7, S8, etc., as a test signal, it is possible to make sure that the behavior of the signal S11 matches a binary state change of each of the signals S6, S7 S8.
[0161] In order to reduce the number of input signals to be tested, the method advantageously includes the following additional steps.
[0162] In a step 61, a binary decision diagram S(11, S5) is constructed as being a logical disjunction of the direct Cd(S11, S5) and inverse Ci(S11, S5) context binary decision diagrams.
S(S11,S5)=Cd(S11,S5)+Ci(S11,S5)
S(S11,S5)=Cd(S11,S5)+Ci(S11,S5)
[0163] In a step 62, for a signal S6, a binary decision diagram S(11, S6) is constructed as being a logical disjunction of the direct Cd(S11,S6) and inverse Ci(S11,S6) context binary decision diagrams.
S(S11,S6)=Cd(S11,S6)+Ci(S11,S6)
S(S11,S6)=Cd(S11,S6)+Ci(S11,S6)
-
- [0164] for the pair of signals S5, S6, a binary decision diagram S(S11, S5, S6) is constructed as being a logical conjunction of the binary decision diagrams S(S11, S5) and S(S11,S6)
S(S11,S5, S6)=S(S11,S5)·S(S11,S6)
- [0164] for the pair of signals S5, S6, a binary decision diagram S(S11, S5, S6) is constructed as being a logical conjunction of the binary decision diagrams S(S11, S5) and S(S11,S6)
[0165] In a step 63, the binary decision diagram S(S11,S5, S6) is ordered so as to begin with the variables xv5, xv6. If the binary decision diagram S(S11,S5, S6) exists in the form of a binary decision diagram a(xv7, xv8, . . . ) independent of xv5 and xv6, the branches of the binary decision diagram a(xv7, xv8, . . . ) are scanned in a step 64. The first branch that leads to 1 yields a logical conjunction of binary states of signals S7, S8, etc., for which a binary state change of the signal S5 is sensed to cause a binary state change of the signal S11 and for which a binary state change of the signal S6 is sensed to cause a binary state change of the signal S11. In essence, with the construction of S(S11,S5, S6), the logical conjunction of binary states of signals S7, S8, etc., thus found simultaneously verifies S(S11,S5) and S(S11,S6).
[0166] By applying a combination of binary states to the signals S7, S8, etc., in a material sample of the circuit tested, in such a way that a logical conjunction found in the preceding paragraph is at 1, a detection of a behavior of the output signal S11 that does not match the binary state change sensed to have been caused by a binary state change test of the signal S5, or a detection of a behavior of the output signal S11 that does not match the binary state change sensed to have been caused by a binary state change test of the signal S6, indicates a fault in this material sample. A material sample for which a fault is indicated must be declared unfit for use.
[0167] Thus, the same binary state profile of signals S7, S8, etc., makes it possible to test whether the change of the signal S11 matches both signals S5 and S6. When such a profile is found by executing steps 61 through 63, a it saves time in the testing of a material sample of the circuit, since this same profile makes it possible to test the change of two different input signals.
[0168] If the binary decision diagram S(S11,S5,S6) is not present in step 63 in the form of a binary decision diagram a(xv7, xv8, . . . ) independent of xv5 and xv6, the signal S6 is saved in an auxiliary list in order to apply step 61 to it, wherein the signal S6 replaces the signal S5, so as to detect any equivalent faults with other signals S7, S8.
[0169] After step 64, as long as there are signals S7, S8, etc. on which the signal S11 depends, steps 62 and 63 are repeated, in which each of the signals S7, S8, etc. in turn replaces the signal S6.
[0170] This makes it possible to find a common profile for all the signals that positively verify step 63 for a given signal S8. This common profile makes it possible to reduce the duration of the testing of a material sample of the circuit for these input signals.
[0171] While this invention has been described in conjunction with specific embodiments thereof, it is evident that many alternatives, modifications and variations will be apparent to those skilled in the art. Accordingly, the preferred embodiments of the invention as set forth herein, are intended to be illustrative, not limiting. Various changes may be made without departing from the true spirit and full scope of the invention as set forth herein and defined in the claims.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
We claim:
1. A method for indicating, in connection with a physical element generating a first signal as a function of a second signal and a plurality of third signals, a combination of states of said third signals such that a state change of said second signal changes said first signal from a binary state to a nonbinary state, wherein two binary decision diagrams are associated with said first signal, and wherein
a first binary decision diagram includes a first binary decision subdiagram that encodes a first set of the combinations of binary states of the third signals for which the first signal is in a first binary state or in a second binary state when the second signal is in the first binary state, and a second binary decision subdiagram that encodes a second set of the combinations of binary states of the third signals for which the first signal is in the first binary state or in the second binary state when the second signal is in the second binary state, and
a second binary decision diagram includes a third binary decision subdiagram that encodes a third set of the combinations of binary states of the third signals for which the first signal is in the second binary state or in a first nonbinary state when the second signal is in the first binary state and a fourth binary decision subdiagram that encodes a fourth set of the combinations of binary states of the third signals for which the first signal is in the second binary state or in the first nonbinary state when the second signal is in the second binary state said method comprising:
a first step that includes forming a first logical combination of the first, second and fourth binary decision subdiagrams, in order to generate a fifth binary decision subdiagram that encodes a fifth set of combinations of states of said third signals, for which
the first signal is in a first binary state or a second binary state when the second signal is in the first binary state,
the first signal is not in the first binary state or the second binary state when the second signal is in the second binary state, and
the first signal is in the second binary state or in the first nonbinary state when the second signal is in the second binary state, so that a change of said second signal, viewed as a control signal with reverse polarity, from the second binary state to the first binary state changes said first signal from a binary state to the first nonbinary state.
2. A method according to claim 1, wherein a third binary decision diagram is associated with said first signal,
wherein the third binary decision diagram includes a sixth binary decision subdiagram that encodes a sixth set of the combinations of binary states of the third signals for which the first signal is in a second nonbinary state when the second signal is in the first binary state (B), and a seventh binary decision subdiagram that encodes a seventh set of the combinations of binary states of the third signals for which the first signal is in a second nonbinary state when the second signal is in the second binary state, and
wherein said method further comprises:
a second step that includes forming a second logical combination of the first, second, fourth, sixth and seventh binary decision subdiagrams, in order to generate the fifth binary decision subdiagram which encodes an eighth set of combinations of states of said third signals,
wherein the first signal is in the second binary state or in the first nonbinary state when the second signal is in the second binary state and the first signal is not in the first binary state or in the second binary state when the second signal is in the second binary state or the first signal is in the second nonbinary state when the second signal is in the second binary state, and
wherein the first signal is in the first binary state or in the second binary state when the second signal is in the first binary state and the first signal is not in the second nonbinary state when the second signal is in the first binary state, so that a change of said second signal, viewed as a control signal with reverse polarity, from the second binary state to the first binary state changes said first signal from a binary state to the first or the second nonbinary state.
3. A method according to claim 2, further comprising:
a third step that includes forming a third logical combination of the first, second and third binary decision subdiagrams, in order to generate an eighth binary decision subdiagram that encodes a ninth set of combinations of states of said third signals, for which
the first signal is in a first binary state or in a second binary state when the second signal is in the second binary state,
the first signal is not in the first binary state or in the second binary state when the second signal is in the first binary state,
the first signal is in the second binary state or in the first nonbinary state when the second signal is in the first binary state, so that a change of said second signal, viewed as a control signal with reverse polarity, from the first binary state to the second binary state changes said first signal from a binary state to the first nonbinary state.
4. A method according to claim 3, further comprising:
a fourth step that includes forming a fourth logical combination of the first, second, third, sixth and seventh binary decision subdiagrams, in order to generate the eighth binary decision subdiagram which encodes a tenth set of combinations of states of said third signals, for which
the first signal is in the second binary state or in the first nonbinary state when the second signal is in the first binary state and the first signal is not in the first binary state or in the second binary state when the second signal is in the first binary state or the first signal is in the second nonbinary state when the second signal is in the first binary state, and for which
the first signal is in the first binary state or in the second binary state when the second signal is in the second binary state and the first signal is not in the second nonbinary state when the second signal is in the second binary state, so that a change of said second signal, viewed as a control signal with reverse polarity, from the first binary state to the second binary state changes said first signal from a binary state to the first or the second nonbinary state.
5. A method according to claim 4, further comprising:
a fifth step that includes forming a fourth binary decision diagram constituted by the fifth binary decision subdiagram when the second signal is in the first binary state and by the eighth binary decision subdiagram when the second signal is in the second binary state, so that a change of said second signal, viewed as control signal with reverse polarity, from the first binary state to the second binary state, or respectively of said second signal, viewed as a control signal with reverse polarity, from the first binary state to the second binary state, changes said first signal from a binary state to the second or the first nonbinary state.
6. A method according to claim 5, further comprising:
a sixth step that includes forming a fifth logical combination of the first, second third and fourth binary decision subdiagrams, in order to generate a fifth binary decision diagram that encodes an eleventh set of combinations of states of said third signals, for which
the first signal is in a first binary state or in a second binary state when the second signal is in the first binary state,
the first signal is in a first binary state or in a second binary state when the second signal is in the second binary state,
the first signal is not in the first binary state or in the second binary state when the second signal is in the first binary state, and
the first signal is in the second binary state or in the first nonbinary state when the second signal is in the second binary state, so that a change of said second signal, viewed as a control signal with reverse polarity, from the first binary state to the second binary state, or respectively from the second binary state to the first binary state, changes said first signal from the first binary state to the second binary state, or respectively from the second binary state to the first binary state.
7. A method according to claim 6, further comprising: a seventh step that includes forming a sixth logical combination of the fifth logical combination and the sixth and seventh binary decision subdiagrams, in order to generate the fifth binary decision diagram, which encodes a twelfth set of combinations of states of said third signals, for which
the first signal is not in a second nonbinary state and the first signal is not in the second nonbinary state when the second signal is in the second binary state, so that a change of said second signal, viewed as a control signal with reverse polarity, from the first binary state to the second binary state, or respectively from the second binary state to the first binary state, changes said first signal from the first binary state to the second binary state, or respectively from the second binary state to the first binary state.
8. A method according to claim 7, further comprising:
an eighth step that includes forming a seventh logical combination of the first, second, third and fourth binary decision subdiagrams, in order to generate a sixth binary decision diagram that encodes a thirteenth set of combinations of states of said third signals for which the first signal is in a first binary state or in a second binary state when the second signal is in the first binary state, wherein
the first signal is in a first binary state or in a second binary state when the second signal is in the second binary state,
the first signal is in the first binary state or in the second binary state when the second signal is in the first binary state,
the first signal is not in the second binary state or in the first nonbinary state when the second signal is in the second binary state, so that a change of said second signal, viewed as a control signal with reverse polarity, from the first binary state to the second binary state, or respectively from the second binary state to the first binary state, changes said first signal from the second binary state to the first binary state, or respectively from the first binary state to the second binary state.
9. A method according to claim 8, further comprising: a ninth step that includes forming an eighth logical combination of the seventh logical combination and the sixth and seventh binary decision subdiagrams, in order to generate the sixth binary decision diagram, which then encodes a fourteenth set of combinations of states of said third signals, for which
the first signal is not in a second nonbinary state when the second signal is in the first binary state, and
the first signal is not in the second nonbinary state when the second signal is in the second binary state, so that a change of said second signal, viewed as a control signal with reverse polarity, from the first binary state to the second binary state, or respectively from the second binary state to the first binary state, changes said first signal from the first binary state to the second binary state, or respectively from the second binary state to the first binary state.
10. A method according to claim 9, further comprising:
a tenth step that including forming a first logical disjunction of the fifth and sixth binary decision diagrams for a first input signal,
an eleventh step that that includes forming a second logical disjunction of the fifth and sixth binary decision diagrams for a second input signal and that performs a logical conjunction of the first and second logical disjunctions,
a twelfth step that includes scanning the binary decision diagram corresponding to the logical conjunction obtained in the eleventh step if said corresponding binary decision diagram depends on binary states of signals different from the signals, in order to obtain a logical conjunction of binary states of signals.
Patent Citations (1)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US5572535(A) | 1996-11-01 | Pixley et al. | Applicant |
Non-Patent Literature (7)
- Akers, Sheldon B. “Binary Decision Diagrams”, Jun. 1978 IEEE Transactions on Computers vol. C-27, No. 6, pp. 509-516.Examiner
- Madre et al. “The Formal Verification Chain at Bull”, May 29-Jun. 1, 1990 Euro ASIC '90, pp. 474-479.Examiner
- Lee et al. “Fast Parallel Algorithms for Model Checking Using BDDs”, Apr. 13-16, 1993., Proceedings of Seventh International Parallel Processing Symposium. pp. 444-448.Examiner
- Stanion, T., “Tsunami: A Path Oriented Scheme for Algebraic Test Generation”, International Symposium on Fault Tolerant Computing Systems, (FTCS), U.S., Los Alamitos, IEEE Comp. Soc. Press, vol. SYMP. 21, Jun. 25, 1991, pp. 36-43, XP000242690, ISBN: 0-8186-2150-8, the entire document.Applicant
- Fummi, F., et al., “A Complete Testing Stragtegy Based on Interacting and Hierarchical FSM's”, Integration, The VSLI Journal, NL, North-Holland Publishing Company, Amsterdam, vol. 23, No. 1, Oct. 1, 1997, pp. 75-93, XP004100336, ISSN: 0167-9260, the entire document.Applicant
- Bryant, R.E., “Binary Decision Diagrams and Beyond: Enabling Technologies for Formal Verification”, IEEE/ACM International Conference on Computer-Aided Design, U.S., Los Alamitos, IEEE Comp. Soc. Press, Nov. 5, 1995, pp. 236-243, XP000620913, ISBN: 0-8186-7213-7, the entire document.Applicant
- Hojati, R., et al., “Early Quantification and Partitioned Transition Relations”, Proceedings of the International Conference on Computer Design, ICCD, VLSI In Computers and Processors, U.S., Los Alamitos, IEEE Comp. Soc. Press, Oct. 7, 1996, pp. 12-19, XP000729882, ISBN: 0-8186-7554-3, the entire document.Applicant