### Table 5: 3-valued logic truth tables

2000

"... In PAGE 7: ... Algorithms to construct these sets are de ned in the next Section. In the case of compound conditions suchasC a ^ C b or C a _ C b , the set to which a given tuple belongs can be determined by considering the 3-valued logic truth tables shown in Table5 . Here t, u and f represent the truth values true, uncertain and false respectively.... ..."

Cited by 1

### Table 1: 3-valued logic and its encoding

1997

"... In PAGE 5: ...1 Encoding A signal variable x 2 L3 requires two encoding bits cx and c x for its internal representation. The complete scheme of encoding for L3 is shown in Table1 . In order to easily detect inconsistencies,... In PAGE 25: ... For example, while property l equals logical 1 is sufficient for encoding L3 (cf. Table1 ), the encoding of logic L10 given in Table 8 is based on the following three properties: Property 1: true if final value is equal to logical 1, false otherwise. Property 2: true if signal value is 0s, false if signal cannot become 0s.... ..."

Cited by 2

### Table 1: Definition of 3-valued boolean logic

### Table 2: Operations in 3-valued boolean logic

### Table 1: 3-valued logic and its encoding conflictingsignal assignments are denoted by cx = 1^c x = 1. This property is expressed in the following definition:

1997

"... In PAGE 2: ...1 Encoding A signal variable x 2 L3 requires two encodingbits cx and c x for its internal representation. The complete scheme of encoding for L3 is shown in Table1 . In order to easily detect inconsistencies,... ..."

Cited by 27

### Table 3: The three-valued logic truth table for 2 and 3

1998

Cited by 4

### Table 3.5: Numerical and logical values

### Table 1: 3-valued logic and its encoding signal assignments are denoted by cx = 1^c x = 1. This property is expressed in the following definition: DEFINITION 1 An assignmentis called non-conflictingiff cx^c x ,

"... In PAGE 2: ...1 Encoding A signal variable x 2 L3 requires two encodingbits cx and c x for its internal representation. The complete scheme of encoding for L3 is shown in Table1 . In order to easily detect inconsistencies, conflicting... ..."

### Table 4: Critical inputs for binary logic gates and 3-state elements for 5-valued logic

"... In PAGE 6: ...2 Criticality and Test-detect backtrace For step (2) and (5), the critical inputs to binary (logic) gates and 3-state elements have to be defined. To profit from dominant values and the characteristics of specific inputs to elements, they can be defined as shown in Table4 . Only some of the binary gate types are shown since the others can be trivially derived.... In PAGE 7: ...1 Criticality and Test-detect backtrace In order to perform the TD backtraces in parallel, the criticalities for the various element types have to be de- fined in parallel, as shown in Table 5. The expressions are just (vectorized) binary formulations expressing the same as the textual expressions in Table4 in terms of the PP 4-valued signal model, for all inputs and for all possible output values. Obviously, an implementation can be highly optimized; for instance, one would not evaluate the expres- sion for TRINV for its EP or EN input, as these are never critical.... In PAGE 8: ... This is required for an output value 0, and obviously true for an output value 1. In this way, the expression covers both textual expressions for AND in Table4 . Note that the fourth expression checks only the v0 of inputs, since the second factor already excluded Z and U values.... ..."