### Table I. Test Matrices and Their Disciplines Discipline Matrices

2003

Cited by 38

### Table 2: Some formalisms used to specify structured dynamical systems according to the continuous or discrete nature of space, time, and state variables of the components. The heading Numerical Solutions refers to explicit numerical solutions of partial differential equations and systems of coupled ordinary differential equations.

2002

Cited by 1

### TABLE IV DIFFERENTIAL EQUATION

1997

Cited by 6

### Table 1- Methods for solving differential equations Method Message Description

"... In PAGE 3: ... In the more optimistic synchronization strategy we are currently developing, the objects encapsulating analog behavior may use a sufficient small time step as needed by the numerical integration, while synchronization with other objects will be made only when objects have to communicate events on interface signals. The analog objects have default methods, where the equations and parameters are included, as shown in Table1 . The Start method is responsible for the initialization of parameters, such as the integration step.... ..."

### Table I. The differential equation is solved numerically by the Runge-Kutta method with sampling time of 0.02 sec.

1990

Cited by 1

### Table 1 Example parameters of the HH equations

### Table 3: Comparison of the system costs for Differential Equation Solver, RLS-laguerre Lattice Filter, and Elliptic filter, with different time constraints.

2005

"... In PAGE 23: ...3. All experiments shown in Table 2 and Table3 are finished in less than one second and the longest running time is 0.11 seconds which occurs when Algorithm DFG Assign Repeat is experimented on Elliptic Filter with timing constraint 100 time units.... In PAGE 26: ...s 27.9% and that for Tree Assign is 30.1%. The experimental results for differential equation solver, RLS-laguerre lattice filter and elliptic filter, are shown in Table3 . In the table, each column cost under different fields presents the system costs ob- tained from different algorithms: the greedy algorithm (Field Greedy ), the ILP model (Field ILP ), DFG Assign Once (Field DFG Assign Once ), DFG Assign Repeat (Field DFG Assign Repeat ), and DFG Assign CP (Field DFG Assign CP ).... ..."

Cited by 2

### Table 3: Comparison of the system costs for Differential Equation Solver, RLS-laguerre Lattice Filter, and Elliptic filter, with different time constraints.

2005

"... In PAGE 23: ...3. All experiments shown in Table 2 and Table3 are finished in less than one second and the longest running time is 0.11 seconds which occurs when Algorithm DFG Assign Repeat is experimented on Elliptic Filter with timing constraint 100 time units.... In PAGE 26: ...s 27.9% and that for Tree Assign is 30.1%. The experimental results for differential equation solver, RLS-laguerre lattice filter and elliptic filter, are shown in Table3 . In the table, each column cost under different fields presents the system costs ob- tained from different algorithms: the greedy algorithm (Field Greedy ), the ILP model (Field ILP ), DFG Assign Once (Field DFG Assign Once ), DFG Assign Repeat (Field DFG Assign Repeat ), and DFG Assign CP (Field DFG Assign CP ).... ..."

Cited by 2