Communicating sequential processes
Communicating sequential processes
Communication and concurrency
Fault detection with multiple observers
IEEE/ACM Transactions on Networking (TON)
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Fault tolerant multiple observers using error control codes
ICNP '96 Proceedings of the 1996 International Conference on Network Protocols (ICNP '96)
Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)
A uniform approach to test computational complementarity
Acta Cybernetica
Fused state machines for fault tolerance in distributed systems
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
| Hi-index | 0.00 |
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.