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. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Hwang, M. H., & Lin, F. (2005). State minimization of SP-DEVS. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3397, pp. 243–252). Springer Verlag. https://doi.org/10.1007/978-3-540-30583-5_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
