### Table 1. Formal Definitions for Blocking Inference

2007

Cited by 1

### Table 1. Some algebraic functions and their formal definitions

### Table 3. Formal definition of the Hoshen-Kopelman finite state machine.

1997

"... In PAGE 11: ... to Q. That is, (q; a) is a state for each state q and input symbol a. The transition function, , is defined as a set of 3-tuples (Sc, a, Sn) where Sc is the current machine state, a is an element of the token alphabet, and Sn is the new machine state. Table3 formally defines the Hoshen-Kopelman finite state machine (FSM) used in this work. The FSM begins in S0 and continues until a final state is reached.... ..."

Cited by 3

### Table 6. The formal definition of timed syntactic action refinement

1996

### Table 2.8 The definition of the formality criterion

### Table Two: Listing of the constraints and Entities used in the example, and formal definition of each operation.

### Table 2. Formal definition of temporal opera- tors: recall that 2 means always; 3 eventually; and ^ next and previous state, respectively.

1996

Cited by 3

### Table 2. Formal definition of temporal opera- tors: recall that 2 means always; 3 eventually; and ^ next and previous state, respectively.

1996

Cited by 3

### Table 3.1 displays the formal definition of the evaluation. Note that all operators except equality are strict (with respect to the value ?) in all their arguments.

2003