State minimization of SP-DEVS

Authors:
Moon Ho Hwang;Feng Lin
Affiliations:
Dept. of Electrical & Computer Engineering, Wayne State University, Detroit, MI;Dept. of Electrical & Computer Engineering, Wayne State University, Detroit, MI
Venue:
AIS'04 Proceedings of the 13th international conference on AI, Simulation, and Planning in High Autonomy Systems
Year:
2004

Citing 2
Cited 1

Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
Theory of Modeling and Simulation

Theory of Modeling and Simulation

Discrete event modeling through a multi-formalism approach, from a user-oriented perspective

SpringSim '07 Proceedings of the 2007 spring simulation multiconference - Volume 2

Quantified Score

Hi-index	0.00

Visualization

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.