Name
Abstract | ||
|---|---|---|
If there exists a minimization method of DEVS in terms of behavioral equivalence, it will be very useful for analysis of huge and complex DEVS models. This paper shows a polynomial-time state minimization method for a class of DEVS, called schedule-preserved DEVS (SP-DEVS) whose states are finite. We define the behavioral equivalence of SP-DEVS and propose two algorithms of compression and clustering operation which are used in the minimization method. |
Year | Venue | Keywords |
|---|---|---|
2004 | Ai & Society | minimization method,clustering operation,polynomial-time state minimization method,behavioral equivalence,complex devs model,schedule-preserved devs,polynomial time |
DocType | Citations | PageRank |
Conference | 1 | 0.36 |
References | Authors | |
3 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Moon Ho Hwang | 1 | 40 | 4.77 |
| Feng Lin | 2 | 177 | 18.34 |