Skip to main content
SpringerLink
Log in
Book cover

International Conference on AI, Simulation, and Planning in High Autonomy Systems

AIS 2004: Artificial Intelligence and Simulation pp 243–252Cite as

State Minimization of SP-DEVS

  • Conference paper

  • 1198 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3397))

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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 

Download references

Author information

Authors and Affiliations

  1. Dept. of Electrical & Computer Engineering, Wayne State University, Detroit, MI, 48202, USA

    Moon Ho Hwang & Feng Lin

Authors
  1. Moon Ho Hwang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Feng Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of EECS, Korea Advanced Institute of Science and Technology (KAIST), 373-1 Guseong-dong, Yuseong-gu, Daejeon, Republic of Korea

    Tag Gon Kim

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hwang, M.H., Lin, F. (2005). State Minimization of SP-DEVS. In: Kim, T.G. (eds) Artificial Intelligence and Simulation. AIS 2004. Lecture Notes in Computer Science(), vol 3397. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30583-5_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30583-5_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24476-9

  • Online ISBN: 978-3-540-30583-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation