The Simplification of Sequential Machines with Input Restrictions

Authors:
Joonki Kim;M. M. Newborn
Affiliations:
Department of Electrical Engineering and Computer Science, Columbia University;-
Venue:
IEEE Transactions on Computers
Year:
1972

Citing 0
Cited 2

Submodule Construction for Specifications with Input Assumptions and Output Guarantees

FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Testing in context: framework and test derivation

Computer Communications

Quantified Score

Hi-index	14.98

Visualization

Abstract

A procedure is presented for simplifying the flow table of a sequential machine M when, in addition to the given flow table, it is specified that certain input sequences cannot occur. It is assumed that M receives its input from the output of another machine M, and that the restricted sequences are therefore those sequences that M, cannot generate.