This Article 
 Bibliographic References 
 Add to: 
Closed Partition Lattice and Machine Decomposition
February 2002 (vol. 51 no. 2)
pp. 216-228

Finite state machines are widely used to model systems in diverse areas. Often, the modeling machines can be decomposed into smaller component machines and this decomposition can facilitate the system design, implementation, and analysis. Hartmanis and Stearns developed an elegant algebraic theory for machine decomposition that is based on the closed partition lattice of a machine. In this paper, we study the computation of the closed partition lattice of finite state machines for the application to their decomposition. We present efficient algorithms for constructing the closed partition lattice and for machine decomposition.

[1] A.V. Aho,J.E. Hopcroft, and J.D. Ullman,The Design and Analysis of Computer Algorithms.Reading, Mass.: Addison-Wesley, 1974.
[2] D. Brand and P. Zafiropulo, “On Communicating Finite-State Machines,” J. ACM, vol. 30, no. 2, pp. 323-342, 1983.
[3] J. Hartmanis and R.E. Stearns, Algebraic Structure Theory of Sequential Machines. Prentice Hall, 1966.
[4] C.A.R. Hoare, Communicating Sequential Processes, Prentice Hall, Englewood Cliffs, N.J., 1985.
[5] J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Apr. 1979.
[6] Z. Kohavi, Switching and Finite Automata Theory, second ed. McGraw-Hill, 1978.
[7] D. Lee and M. Yannakakis, Principles and Methods of Testing Finite State Machines, a Survey Proc. IEEE, vol. 84, no. 8, pp. 1090-1123, Aug. 1996.
[8] G. Noubir, B.Y. Choueiry, and H.J. Nussbaumer, “Fault Tolerant Multiple Observers Using Error Control Codes,” Proc. Int'l conf. Network Protocols (ICNP), pp. 84-91, 1996.
[9] R.E. Tarjan, “Efficiency of a Good but Not Linear Set Union Algorithm,” J. ACM, vol. 22, no. 2, pp. 215-225, 1975.
[10] R. Milner, Communication and Concurrency, Prentice-Hall, Englewood Cliffs, N.J., 1989.
[11] C. Wang and M. Schwartz, “Fault Detection with Multiple Observers,” IEEE/ACM Trans. Networking, vol. 1, no. 1, pp. 48-55, 1993.

Index Terms:
Finite state machine, machine decomposition, closed partition lattice.
D. Lee, M. Yannakakis, "Closed Partition Lattice and Machine Decomposition," IEEE Transactions on Computers, vol. 51, no. 2, pp. 216-228, Feb. 2002, doi:10.1109/12.980009
Usage of this product signifies your acceptance of the Terms of Use.