REDUCING THE STATE SPACE OF INCOMPLETELY SPECIFIED TIMED MOORE MACHINES

摘要

In this paper, after recapping about completely specified Timed Moore Machines (TMM) and their minimization procedure, we present methods to reduce the number of states of incompletely specified Timed Moore Machines. For this purpose, we define the concepts of coverage and refinement between TMM, and we show how the coverage relation can be used to reduce the number of states of a TMM.