Permissible Observability Relations in FSM Networks

Previous attempts to capture the phenomenon of output don't care sequencesfor a componentin an FSM network have been incomplete. We demonstrate that output don't care sequencesfor a componentcan be expressed using a set of observability relations given that its state transition function is kept unchanged. Each observability relation is permissible in the sense that any implementation compatible with one of them is feasible. The representation for a set of permissible observability relations is not unique. We provide a method to find a set with the minimum number of permissible relations. We briefly discuss the exploitation of permissible observability relations in state minimization, circuit implementation and signal encoding. We have implemented these methods and present some preliminary results on a few small artificially constructed examples.

• Type: Conference
• Year: 1994
• Where: DAC
• Authors: Huey-Yih Wang, Robert K. Brayton
• Keywords: Computer Architecture, DAC 1994, Don't Care, Observability Relations, Permissible Observability Relations