State Minimization of SP-DEVS
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.
KeywordsState Minimization State Pair Regular Language Minimization Method Acceptance State
Unable to display preview. Download preview PDF.
- 1.Zeigler, B.P., Praehofer, H., Kim, T.G.: Theory of Modelling and Simulation: Integrating Discrete Event and Continuous Complex Dynamic Systems, 2nd edn. Academic Press, London (2000)Google Scholar
- 2.Hwang, M.H., Cho, S.K.: Timed analysis of schedule preserved devs. In: Bruzzone, A.G., Williams, E. (eds.) 2004 Summer Computer Simulation Conference, San Jose, CA, pp. 173–178. SCS (2004)Google Scholar
- 3.Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison Wesley, Reading (2000)Google Scholar
- 4.Hopcroft, J.E.: An n log n algorithm for minimizing states in a finite automaton. In: Kohavi, Z. (ed.) The Theory of Machine and Computations, pp. 189–196. Academic Press, New York (1971)Google Scholar