### Table 2 Tri state logic definition for logical AND AND

### Table 1. Notations for logical cell definition.

"... In PAGE 6: ... A logical level description of a design requires to spec- ify, for each cell, its active and passive filters and its output structure, and for each source, the structure of its passive pulse. Table1 summarizes the notations for logical level cell definition. Filters and nodes are described using the nested square brackets and nested parentheses notations in- troduced above.... ..."

### Table 1. Logical rules underlying the definition of the logical parameters associated with the regulatory graph of Figure 1

"... In PAGE 4: ... On the basis of this graph and using additional information from the literature, it is possible to derive a set of rules enabling the activation of each of the regulatory component encompassed by this graph. Presented in Table1 , these rules are sufficient to derive all the non-zero logical parameters enabling the recovery of the main known features of the wild-type cell cycle. In its present Boolean version (i.... In PAGE 6: ...Table1 . Each vertex (node) represents one state, with the regulatory components ordered as mentioned in the top panel.... ..."

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

### Table 2. Vague logical operators (three-valued logic).

2004

"... In PAGE 10: ... That is, we use a three-valued logic as the range of these predicates. The definition of the vague logical operators and, or, and not ( Table2 ) parallels the definition of the vague spatial operations in Section 4.2... ..."

Cited by 4

### Table 2. Vague logical operators (three-valued logic).

"... In PAGE 9: ... That is, we use a three-valued logic as the range of these predicates. The definition of the vague logical operators and, or, and not ( Table2 ) parallels the definition of the vague spatial operations in Section 4.2 (t, f, and m are used as abbreviations for true, false, maybe).... ..."

### Table 1: Full packing solutions of pASIC3 logic cell (for definitions of sets S1 to S7 see Figure 3).

"... In PAGE 2: ... In fact, there are 37 different cases of completely utilizing the logic cell except for the multiplexers of course. A number of these cases (but not all) are shown in Table1 . In this table, LCi refers to the ith combination of completely utilizing the pASIC3 logic cell with the primitive cell types.... In PAGE 2: ... Let Ci,Sj denote the number of primitive cells from set Sj in the ith legal combination (cf. Table1 ). The recurrence equation for this problem can be as follows: () ()17 17 17,, 0 0 ,.... In PAGE 3: ... First, the mapped cells are ordered by the level-first search strategy. For each full packing solution of pASIC3 logic cell (there are 37 such logic cell compositions as reported in Table1 ), the greedy algorithm tries to fill it as much as possible starting from the top of the list. Next, it selects the logic cell combination that has the best space utilization where utilization is defined as the ratio of filled space to the total space of the pASIC3 logic cell.... ..."

### Table 4 Definitions

"... In PAGE 8: ... Symbol dependency refers to dependencies relevant to processing logic. Definitions and abbreviations used in further equations are summarized in Table4 . Each symbol invoc a- tion requires Vs messages, one message for each symbol node.... In PAGE 10: ... Aspects connect the classes (via symbols) that would not be connected otherwise. The reduction in total entropy is then calculated as Equation 6 Reduction in entropy with aspects The probabilities have been computed as shown in Table4 . They can be also derived e mpirically from execution scenarios.... ..."