The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - February (2002 vol.51)
pp: 216-228
ABSTRACT
<p>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.</p>
INDEX TERMS
Finite state machine, machine decomposition, closed partition lattice.
CITATION
D. Lee, M. Yannakakis, "Closed Partition Lattice and Machine Decomposition", IEEE Transactions on Computers, vol.51, no. 2, pp. 216-228, February 2002, doi:10.1109/12.980009
37 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool