DocumentCode
1107211
Title
On Proving Sequential Machine Designs
Author
Abdali, Kamal S.
Author_Institution
IEEE
Issue
12
fYear
1971
Firstpage
1563
Lastpage
1566
Abstract
Based on a program-proving technique, a method for proving sequential machine designs is presented. The method associates with each state of the machine an assertion about the sequences taking the machine into that state. The design is proved by: showing all assertions true irrespective of state changes; and deriving the design specifications from the assertions at final states. The method is illustrated´ on two finite automata.
Keywords
Checking experiments, fault detection, finite automata, method of assertions, program proving, proof of designs, sequential machine design, switching theory.; Automata; Computer errors; Debugging; Error correction; Fault detection; Flowcharts; Logic design; Logic programming; Logic testing; Uncertainty; Checking experiments, fault detection, finite automata, method of assertions, program proving, proof of designs, sequential machine design, switching theory.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1971.223170
Filename
1671763
Link To Document