### Abstract

The time is considered as discrete with sufficiently small steps, and the input and output of the logic circuit are treated as sequences. The method to describe the set of sequences satisfying the input constraints or the input-output specifications and the method to verify these assertions are proposed anew; # expression and the first # form are proposed as the description methods. The # expression is obtained by adding the newly proposed # concatenation and # closure to the regular expression. The first # form is a restricted # expression, where the number of states of the deterministic finite automaton accepting the set of sequences represented by the expression does not exceed twice the length of the description. In this paper, the logic circuit is regarded as a converter for the set of sequences and the verification of the input constraint or the input-output specification is reduced to the examination of the inclusive relation among the sets of sequences.

Original language | English |
---|---|

Pages (from-to) | 29-42 |

Number of pages | 14 |

Journal | Systems and Computers in Japan |

Volume | 18 |

Issue number | 2 |

Publication status | Published - 1987 Feb |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Computational Theory and Mathematics
- Hardware and Architecture
- Information Systems
- Theoretical Computer Science

### Cite this

*Systems and Computers in Japan*,

*18*(2), 29-42.

**DESCRIPTION AND VERIFICATION OF INPUT CONSTRAINTS AND INPUT-OUTPUT SPECIFICATIONS OF LOGIC CIRCUITS.** / Kimura, Shinji; Yajima, Shuzo.

Research output: Contribution to journal › Article

*Systems and Computers in Japan*, vol. 18, no. 2, pp. 29-42.

}

TY - JOUR

T1 - DESCRIPTION AND VERIFICATION OF INPUT CONSTRAINTS AND INPUT-OUTPUT SPECIFICATIONS OF LOGIC CIRCUITS.

AU - Kimura, Shinji

AU - Yajima, Shuzo

PY - 1987/2

Y1 - 1987/2

N2 - The time is considered as discrete with sufficiently small steps, and the input and output of the logic circuit are treated as sequences. The method to describe the set of sequences satisfying the input constraints or the input-output specifications and the method to verify these assertions are proposed anew; # expression and the first # form are proposed as the description methods. The # expression is obtained by adding the newly proposed # concatenation and # closure to the regular expression. The first # form is a restricted # expression, where the number of states of the deterministic finite automaton accepting the set of sequences represented by the expression does not exceed twice the length of the description. In this paper, the logic circuit is regarded as a converter for the set of sequences and the verification of the input constraint or the input-output specification is reduced to the examination of the inclusive relation among the sets of sequences.

AB - The time is considered as discrete with sufficiently small steps, and the input and output of the logic circuit are treated as sequences. The method to describe the set of sequences satisfying the input constraints or the input-output specifications and the method to verify these assertions are proposed anew; # expression and the first # form are proposed as the description methods. The # expression is obtained by adding the newly proposed # concatenation and # closure to the regular expression. The first # form is a restricted # expression, where the number of states of the deterministic finite automaton accepting the set of sequences represented by the expression does not exceed twice the length of the description. In this paper, the logic circuit is regarded as a converter for the set of sequences and the verification of the input constraint or the input-output specification is reduced to the examination of the inclusive relation among the sets of sequences.

UR - http://www.scopus.com/inward/record.url?scp=0023294917&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023294917&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0023294917

VL - 18

SP - 29

EP - 42

JO - Systems and Computers in Japan

JF - Systems and Computers in Japan

SN - 0882-1666

IS - 2

ER -