Application of the principal partition and principal lattice of partitions of a graph to the problem of decomposition of a finite state machine

Abstract

We relate the Principal Partition of a graph G to the problem of Finite State Machine (FSM) Decomposition by modelling the FSMaa a Stotc Tkansition Graph (STG) and using the underlying graph of its STG. We obtain efficient algorithms to decompose a FSM by relating the Principal Partition to the more general notion of the Principal Lattice oj Portitionr of an ap propriately defined submodular function.