|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
|
| |
3
|
~CHOW, T. S. 1978. Testing software design modeled by finite-state machines. IEEE Trans. ~Softw. Eng. SE-4, 3 (May), 178-187.
|
| |
4
|
~DAHBURA, A. T., SABNANI, K., AND UYAR, M.U. 1990. Formal methods for generating protocol ~conformance test sequences. Proc. IEEE (Aug.), 1317-1326.
|
| |
5
|
|
| |
6
|
|
| |
7
|
~GmL, A. 1962. Introduction to the Theory of Finite-State Machines. McGraw-Hill, New York.
|
| |
8
|
~GONENC, G. 1970. A method for the design of fault detection experiments. IEEE Trans. ~Comput. C-19, 6 (June), 551-558.
|
| |
9
|
~HENNIE, F.C. 1968. Ftnite-State Models for Logical Machines. John Wiley & Sons, New York.
|
| |
10
|
|
| |
11
|
|
| |
12
|
~JOHNSON, D.S. 1974. Approximation algorithms for combinatorial problems. J. Comput. Syst. ~Sci. 9,256-278.
|
| |
13
|
~MOORE, E.F. 1956. Gedanken-experiments on sequential machines. In Automata Studies. ~Princeton Univ. Press, Princeton, N.J. Ann. Math. SLud. 34, 1, 129-153.
|
| |
14
|
~MILLER, R. E. AND PAUL, S. 1991. Generating minimal length test sequences for conformance ~testing of communication protocols. In INFOCOM. q70-979.
|
| |
15
|
~NAITO, S AND TSUNOYAMA, M 1981. Fault detection for sequential machines by transition ~tours. In IEEE Fault Tolerunt Computing' Conference. IEEE, New York.
|
| |
16
|
|
| |
17
|
|
| |
18
|
~VASmKEVSKn, M.P. 1973. Failure diagnosis of automata. Ktbernet~ka 4, (July Aug. h 98 108.
|
 |
19
|
|
|