Advertisement

The Controllability of Extended Finite State Machines

  • Xiang-Yun Wang
  • Kai-Yuan Cai
Chapter
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 129)

Abstract

The supervisory control theory of discrete event systems modeled as finite state machines (FSMs) have been studied for many years. However, the problem of state explosion in the existing theories obstructs its widespread application. To alleviate the problem, extended finite state machines (EFSMs) are considered to model discrete event systems. In the theories of supervisory control of discrete event systems, controllability is very important. So the controllability of EFSM is vital to study the supervisory control problem of discrete event systems modeled as EFSMs. This paper focuses on the controllability of EFSMs. Firstly, the controllability of EFSM is proposed. Secondly, based on the definition of non-cyclic path and EFSM of deleting-configurations, the necessary and sufficient condition for controllability and an algorithm for deciding controllability are presented.

Keywords

Initial Configuration Finite State Machine Supervisory Control State Explosion Cyclic Path 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cai, K.Y., Cangussu, J.W., DeCarlo, R.A., et al.: An overview of software cybernetics. In: Proceedings of the 11th Annual International Workshop on Software Technology and Engineering Practice, pp. 77–86 (2003)Google Scholar
  2. 2.
    Petrenko, A., Boroday, S., Groz, R., et al.: Confirming configurations in EFSM testing. IEEE Transactions on Software Engineering 30(1), 29–42 (2004)CrossRefGoogle Scholar
  3. 3.
    Wang, P., Cai, K.Y.: Representing extended finite state machines for SDL by a novel control model of discrete event systems. In: Proceedings of the 6th International Conference on Quality Software, pp. 159–166 (2006)Google Scholar
  4. 4.
    Wang, X.Y., Ma, X.R.: An equivalence relation on extended finite state machines. In: International Conference on Computational Intelligence and Software Engineering, pp. 11–13 (2009)Google Scholar
  5. 5.
    Wang, X.Y., Zhang, W., Li, Y.C., et al.: A polynomial dynamic system approach to software design for attractivity requirement. Information Science 177(13), 2712–2725 (2007)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Wang, X.Y., Zhao, L., Cai, K.Y.: Design approach for EFSM based on supervisory control theory. Computer Engineering and Applications 45(6), 20–24 (2009) (in Chinese) Google Scholar
  7. 7.
    Wonham, W.M.: Notes on control of discrete-event systems. ECE 1636F/1637S, Department of electrical and computer engineering, University of Toronto (2002)Google Scholar

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.College of Computer and Information EngineeringTianjin Normal UniversityTianjinChina
  2. 2.Department of Automatic ControlBeihang UniversityBeijingChina

Personalised recommendations