### Table 3: An I/O automaton for the QCM program of principal p

1997

"... In PAGE 9: ... I/O automata are essentially process algebras with state; they are a well-established formalism for the speci cation of dis- tributed systems. Table3 gives an I/O automaton that speci es the message- sending behavior of a node controlled by a QCM program. The automaton has three state variables: a set of jobs for queries remaining to be answered; a set of inclusions representing its current accepted facts about local and non- local relations; and a set of expressions that the node has asked other nodes to evaluate.... ..."

Cited by 4

### Table 1. Translations of a hierarchical timed automaton description to an equivalent flat Uppaal model.

2001

"... In PAGE 3: ... Using the implemented translation, we have been able to check a number of safety and liveness properties of the system, indicating that formal veri cation of HTA is indeed feasible. Table1 shows a comparison between the input and the... ..."

Cited by 2

### Table 1. Translations of a hierarchical timed automaton description to an equivalent flat Uppaal model.

"... In PAGE 3: ... Using the implemented translation, we have been able to check a number of safety and liveness properties of the system, indicating that formal verification of HTA is indeed feasible. Table1 shows a comparison between the input and the... ..."

### Table 3. The BUFFER automaton.

1996

"... In PAGE 7: ... The BUFFER automaton. The BUFFER automaton appears in Table3 . The variable request stores a command while it is being buffered.... ..."

Cited by 12

### Table 7. Order Automaton

Cited by 2

### Table 1. Comparison of the average number of states of Aho-Corasick automaton, automaton Spi of section 3 and minimized automaton

in A unifying framework for seed sensitivity and its application to subset seeds (extended abstract)

2005

"... In PAGE 10: ...Table 1. Comparison of the average number of states of Aho-Corasick automaton, automaton Spi of section 3 and minimized automaton Corasick automaton not only on non-binary alphabets (which was expected), but also on the binary alphabet (cf Table1 (a)). Note that for a given seed, one can define a surjective mapping from the states of the Aho-Corasick automaton onto the states of our automaton.... ..."

Cited by 11

### Table 2: Dynamical Automaton 1.

"... In PAGE 21: ... (Implemented in Dynamical Automaton 1). We de ne a DA (called DA 1) that recognizes the language of Grammar 2 by the Input Map shown in Table2 . The essence of the DA is a two-element vector, z, corresponding to a position on the Sierpinski triangle.... In PAGE 21: ... Given a compartment and a legal input for that compartment, the change in z that results from reading the input is shown in the \State Change quot; column. If we specify that the DA must start with z = (1/2, 1/2), make state changes according to the rules in Table2 as symbols are read from an input string, and return to z = (1/2, 1/2) (the Final Region) when the last symbol is read, then the computer functions as a recognizer for the language of Grammar 2. To see this intuitively, note that any subsequence of the form \a b c d quot; invokes the identity map on z.... ..."

### Table 1: Automaton States 4

1997

Cited by 1