%!PS-Adobe-3.0
%%Title: (References)
%%Creator: (Microsoft Word: LaserWriter 8 8.3.4)
%%CreationDate: (3:20 PM Monday, June 7, 1999)
%%For: (bach)
%%Pages: 6
%%DocumentFonts: Times-Bold Times-Roman
%%DocumentNeededFonts: Times-Bold Times-Roman
%%DocumentSuppliedFonts:
%%DocumentData: Clean7Bit
%%PageOrder: Ascend
%%Orientation: Portrait
%%DocumentMedia: Default 612 792 0 () ()
%ADO_ImageableArea: 30 31 582 761
%%EndComments
userdict begin/dscInfo 5 dict dup begin
/Title(References)def
/Creator(Microsoft Word: LaserWriter 8 8.3.4)def
/CreationDate(3:20 PM Monday, June 7, 1999)def
/For(bach)def
/Pages 6 def
end def end
/md 134 dict def md begin/currentpacking where {pop /sc_oldpacking currentpacking def true setpacking}if
%%BeginFile: adobe_psp_basic
%%Copyright: Copyright 1990-1993 Adobe Systems Incorporated. All Rights Reserved.
/bd{bind def}bind def
/xdf{exch def}bd
/xs{exch store}bd
/ld{load def}bd
/Z{0 def}bd
/T/true
/F/false
/:L/lineto
/lw/setlinewidth
/:M/moveto
/rl/rlineto
/rm/rmoveto
/:C/curveto
/:T/translate
/:K/closepath
/:mf/makefont
/gS/gsave
/gR/grestore
/np/newpath
14{ld}repeat
/$m matrix def
/av 83 def
/por true def
/normland false def
/psb-nosave{}bd
/pse-nosave{}bd
/us Z
/psb{/us save store}bd
/pse{us restore}bd
/level2
/languagelevel where
{
pop languagelevel 2 ge
}{
false
}ifelse
def
/featurecleanup
{
stopped
cleartomark
countdictstack exch sub dup 0 gt
{
{end}repeat
}{
pop
}ifelse
}bd
/noload Z
/startnoload
{
{/noload save store}if
}bd
/endnoload
{
{noload restore}if
}bd
level2 startnoload
/setjob
{
statusdict/jobname 3 -1 roll put
}bd
/setcopies
{
userdict/#copies 3 -1 roll put
}bd
level2 endnoload level2 not startnoload
/setjob
{
1 dict begin/JobName xdf currentdict end setuserparams
}bd
/setcopies
{
1 dict begin/NumCopies xdf currentdict end setpagedevice
}bd
level2 not endnoload
/pm Z
/mT Z
/sD Z
/realshowpage Z
/initializepage
{
/pm save store mT concat
}bd
/endp
{
pm restore showpage
}def
/$c/DeviceRGB def
/rectclip where
{
pop/rC/rectclip ld
}{
/rC
{
np 4 2 roll
:M
1 index 0 rl
0 exch rl
neg 0 rl
:K
clip np
}bd
}ifelse
/rectfill where
{
pop/rF/rectfill ld
}{
/rF
{
gS
np
4 2 roll
:M
1 index 0 rl
0 exch rl
neg 0 rl
fill
gR
}bd
}ifelse
/rectstroke where
{
pop/rS/rectstroke ld
}{
/rS
{
gS
np
4 2 roll
:M
1 index 0 rl
0 exch rl
neg 0 rl
:K
stroke
gR
}bd
}ifelse
%%EndFile
%%BeginFile: adobe_psp_colorspace_level1
%%Copyright: Copyright 1991-1993 Adobe Systems Incorporated. All Rights Reserved.
/G/setgray ld
/:F1/setgray ld
/:F/setrgbcolor ld
/:F4/setcmykcolor where
{
pop
/setcmykcolor ld
}{
{
3
{
dup
3 -1 roll add
dup 1 gt{pop 1}if
1 exch sub
4 1 roll
}repeat
pop
setrgbcolor
}bd
}ifelse
/:Fx
{
counttomark
{0{G}0{:F}{:F4}}
exch get
exec
pop
}bd
/:rg{/DeviceRGB :ss}bd
/:sc{$cs :ss}bd
/:dc{/$cs xdf}bd
/:sgl{}def
/:dr{}bd
/:fCRD{pop}bd
/:ckcs{}bd
/:ss{/$c xdf}bd
/$cs Z
%%EndFile
%%BeginFile: adobe_psp_basic_text
%%Copyright: Copyright 1990-1993 Adobe Systems Incorporated. All Rights Reserved.
/S/show ld
/A{
0.0 exch ashow
}bd
/R{
0.0 exch 32 exch widthshow
}bd
/W{
0.0 3 1 roll widthshow
}bd
/J{
0.0 32 4 2 roll 0.0 exch awidthshow
}bd
/V{
0.0 4 1 roll 0.0 exch awidthshow
}bd
/fcflg true def
/fc{
fcflg{
vmstatus exch sub 50000 lt{
(%%[ Warning: Running out of memory ]%%\r)print flush/fcflg false store
}if pop
}if
}bd
/$f[1 0 0 -1 0 0]def
/:ff{$f :mf}bd
/MacEncoding StandardEncoding 256 array copy def
MacEncoding 39/quotesingle put
MacEncoding 96/grave put
/Adieresis/Aring/Ccedilla/Eacute/Ntilde/Odieresis/Udieresis/aacute
/agrave/acircumflex/adieresis/atilde/aring/ccedilla/eacute/egrave
/ecircumflex/edieresis/iacute/igrave/icircumflex/idieresis/ntilde/oacute
/ograve/ocircumflex/odieresis/otilde/uacute/ugrave/ucircumflex/udieresis
/dagger/degree/cent/sterling/section/bullet/paragraph/germandbls
/registered/copyright/trademark/acute/dieresis/notequal/AE/Oslash
/infinity/plusminus/lessequal/greaterequal/yen/mu/partialdiff/summation
/product/pi/integral/ordfeminine/ordmasculine/Omega/ae/oslash
/questiondown/exclamdown/logicalnot/radical/florin/approxequal/Delta/guillemotleft
/guillemotright/ellipsis/space/Agrave/Atilde/Otilde/OE/oe
/endash/emdash/quotedblleft/quotedblright/quoteleft/quoteright/divide/lozenge
/ydieresis/Ydieresis/fraction/currency/guilsinglleft/guilsinglright/fi/fl
/daggerdbl/periodcentered/quotesinglbase/quotedblbase/perthousand
/Acircumflex/Ecircumflex/Aacute/Edieresis/Egrave/Iacute/Icircumflex/Idieresis/Igrave
/Oacute/Ocircumflex/apple/Ograve/Uacute/Ucircumflex/Ugrave/dotlessi/circumflex/tilde
/macron/breve/dotaccent/ring/cedilla/hungarumlaut/ogonek/caron
MacEncoding 128 128 getinterval astore pop
level2 startnoload
/copyfontdict
{
findfont dup length dict
begin
{
1 index/FID ne{def}{pop pop}ifelse
}forall
}bd
level2 endnoload level2 not startnoload
/copyfontdict
{
findfont dup length dict
copy
begin
}bd
level2 not endnoload
md/fontname known not{
/fontname/customfont def
}if
/Encoding Z
/:mre
{
copyfontdict
/Encoding MacEncoding def
fontname currentdict
end
definefont :ff def
}bd
/:bsr
{
copyfontdict
/Encoding Encoding 256 array copy def
Encoding dup
}bd
/pd{put dup}bd
/:esr
{
pop pop
fontname currentdict
end
definefont :ff def
}bd
/scf
{
scalefont def
}bd
/scf-non
{
$m scale :mf setfont
}bd
/ps Z
/fz{/ps xs}bd
/sf/setfont ld
/cF/currentfont ld
/mbf
{
/makeblendedfont where
{
pop
makeblendedfont
/ABlend exch definefont
}{
pop
}ifelse
def
}def
%%EndFile
/currentpacking where {pop sc_oldpacking setpacking}if end
%%EndProlog
%%BeginSetup
md begin
countdictstack[{
%%BeginFeature: *ManualFeed False
level2 {1 dict dup /ManualFeed false put setpagedevice}{statusdict begin /manualfeed false store end} ifelse
%%EndFeature
}featurecleanup
countdictstack[{
%%BeginFeature: *InputSlot Upper

%%EndFeature
}featurecleanup
countdictstack[{
%%BeginFeature: *PageRegion LetterSmall
level2 {
		2 dict dup /PageSize [612 792] put dup /ImagingBBox [30 31 582 761] put setpagedevice
	}{
		/lettersmall where {pop lettersmall} {letterR} ifelse
	} ifelse
%%EndFeature
}featurecleanup
(bach)setjob
/mT[1 0 0 -1 30 761]def
/sD 16 dict def
300 level2{1 dict dup/WaitTimeout 4 -1 roll put setuserparams}{statusdict/waittimeout 3 -1 roll put}ifelse
%%IncludeFont: Times-Bold
%%IncludeFont: Times-Roman
/f0_1/Times-Bold
:mre
/f0_18 f0_1 18 scf
/f0_12 f0_1 12 scf
/f1_1/Times-Roman
:mre
/f1_12 f1_1 12 scf
/Courier findfont[10 0 0 -10 0 0]:mf setfont
%%EndSetup
%%Page: 1 1
%%BeginPageSetup
initializepage
(bach; page: 1 of 6)setjob
%%EndPageSetup
gS 0 0 552 730 rC
494 741 :M
f0_12 sf
1.5(146)A
72 74 :M
f0_18 sf
.675(References)A
.25 G
72 87 440 9 rC
74 89 437 6 rF
0 G
74.5 89.5 436 5 rS
gR
gS 0 0 552 730 rC
90 129 :M
f1_12 sf
-.108([Aho88])A
142 129 :M
.54 .054(A. Aho, et al., "An Optimization Technique for Protocol Conformance Test)J
142 147 :M
.368 .037(Generation Based on UIO Sequences and Rural Chinese Postman Tours", in)J
142 165 :M
2.135 .213(Protocol Specification, Testing and Verification VIII, S. Aggarwal and)J
142 183 :M
.34 .034(K.K. Sabnani \(Eds.\), New York: Elsevier North-Holland, 1988, pp. 75-86.)J
90 201 :M
-.235([AlVu93])A
142 201 :M
-.066(J. Alilovic-Curgus and S.T. Vuong, \322A Metric Based Theory of Test Selection)A
142 219 :M
1.375 .137(and Coverage\323, IFIP Transactions, Proc. of the IFIP 13th Symposium on)J
142 237 :M
2.007 .201(Protocol Specification, Testing and Verification, Liege, Belgium, 1993,)J
142 255 :M
.955 .096(pp. 289-304.)J
90 273 :M
-.045([Boch78])A
142 273 :M
1.528 .153(G.v. Bochmann, \322Finite State Description of Communication Protocols\323,)J
142 291 :M
.224 .022(Computer Networks, Vol. 2, October 1978, pp. 361-372.)J
90 309 :M
-.045([Boch86])A
142 309 :M
.362 .036(G.v. Bochmann, \322Recent Development in Protocol Specification, Validation)J
142 327 :M
.579 .058(and Testing\323, Journal of China Institute of Communications, Vol.7, 4, July,)J
142 345 :M
.859 .086(1986, pp. 76-88.)J
90 363 :M
-.045([Boch90])A
142 363 :M
.634 .063(G.v. Bochmann, \322Protocol Specification for OSI\323, Computer Networks and)J
142 381 :M
.46 .046(ISDN Systems, 18, April, 1990, pp. 167-184.)J
90 399 :M
-.045([Boch92])A
142 399 :M
2.596 .26(G.v. Bochmann, et al., \322Fault Models in Testing\323, IFIP Transactions,)J
142 417 :M
.097 .01(Protocol Test Systems, IV \(Proc. of IFIP TC6 4th International Workshop on)J
142 435 :M
2.458 .246(Protocol Test Systems, 1991\), Ed. by J. Kroon, R. J. Heijink and Ed)J
142 453 :M
.464 .046(Brinksma, 1992, North-Holland, pp. 17-30.)J
90 471 :M
-.094([Boll79])A
142 471 :M
.384 .038(B. Bollobas, \322Graph Theory - An Introductory Course\323, Spring-Verlag New)J
142 489 :M
.488 .049(York Inc., 1979, 180 p.)J
90 507 :M
([BoPe94])S
142 507 :M
.202 .02(G.v. Bochmann and A. Petrenko, \322Protocol Testing: Review of Methods and)J
142 525 :M
.07 .007(Relevance for Software Testing\323, Proc. of the 1994 International Symposium)J
142 543 :M
1.038 .104(on Software Testing and Analysis \(ISSTA\), Seattle, USA, Ed. by Thomas)J
142 561 :M
.54 .054(Ostrand, 1994, pp. 109-123.)J
90 579 :M
-.054([BPY95])A
142 579 :M
-.002(G.v. Bochmann, A. Petrenko and M. Yao, "Fault Coverage of Tests Based on)A
142 597 :M
.203 .02(Finite State Models", IFIP Transactions, Protocol Test Systems VII \(Proc. of)J
142 615 :M
.847 .085(IWPTS'94, 1994\), Ed. by T. Mizuno, T. Higashino and N. Shiratori, 1995,)J
142 633 :M
1.056 .106(pp. 55-76.)J
90 651 :M
-.045([Brin87])A
142 651 :M
.343 .034(E. Brinksma, et al., Lotos specification, their implementation and their tests,)J
142 669 :M
.796 .08(in B. Sarikaya and G. v. Bochmann \(eds.\), Protocol Specification, Testing,)J
142 687 :M
-.009(and Verification VI, North Holland, Amsterdam, 1987, pp. 349-360.)A
endp
%%Page: 2 2
%%BeginPageSetup
initializepage
(bach; page: 2 of 6)setjob
%%EndPageSetup
-12 -12 :T
gS 12 12 552 730 rC
506 753 :M
f0_12 sf
1.5(147)A
102 81 :M
f1_12 sf
-.045([Brin88])A
154 81 :M
1.752 .175(E. Brinksma, A theory for the derivation of tests, in S. Aggarwal \(ed.\),)J
154 99 :M
2.623 .262(Protocol Specification, Testing, and Verification VIII, North Holland,)J
154 117 :M
.362 .036(Amsterdam, 1988, pp. 63-74.)J
102 135 :M
-.045([Brin90])A
154 135 :M
.492 .049(E. Brinksma, et al., \322A Formal Approach to Conformance Testing\323, in J. de)J
154 153 :M
.377 .038(Meer et al. \(eds.\), IWPTS\32590, 1990, pp. 349-363.)J
102 171 :M
.663 .066([Chow78] T.S. Chow, \322Test Design Modeled by Finite-State Machines\323, IEEE Trans.)J
154 189 :M
.716 .072(SE-4, 3, )J
210 189 :M
.813 .081(1978, pp. 178-187.)J
102 207 :M
-.139([DaSa88])A
154 207 :M
-.081(A.T. Dahbura and K. Sabnani, \322An Experience in Estimating Fault Coverage )A
154 225 :M
.67 .067(of a Protocol Test\323, Proc. IEEE INFOCOM, New Orleans, LA, USA 1988,)J
154 243 :M
1.056 .106(pp. 71-79.)J
102 261 :M
-.219([DDB91])A
154 261 :M
.211 .021(M. Dubuc, R. Dssouli and G.V. Bochmann, \322TESTL: A tool for Incremental)J
154 279 :M
-.107(Test Suite Design Based on Finite State Model\323, 4th International Workshop )A
154 297 :M
.036 .004(on Protocol Test Systems, Holland, November 1991.)J
102 315 :M
-.092([Este87])A
154 315 :M
.027 .003(ISO DIS9074, \322Estelle: A formal description technique based on an extended)J
154 333 :M
-.056(state transition model\323, 1987.)A
102 351 :M
-.043([FrWe88])A
154 351 :M
.227 .023(P.G. Frankl and E.J. Weyuker, \322An Applicable Family of Data Flow Testing)J
154 369 :M
.284 .028(Criteria\323, IEEE Trans. SE-14, No. 10, October, 1988, pp. 1483-1498.)J
102 387 :M
.048([FuBo91])A
154 387 :M
.626 .063(S. Fujiwara and G.v. Bochmann, \322Testing non-deterministic state machines)J
154 405 :M
2.109 .211(with fault coverage\323, in 4th Int\325l Workshop on Protocol Test Systems,)J
154 423 :M
.076 .008(Amsterdam, 1991, North-Holland.)J
102 441 :M
-.046([Fuji91])A
154 441 :M
1.49 .149(S. Fujiwara, et al., "Test Selection Based on Finite State Models", IEEE)J
154 459 :M
.623 .062(Trans. SE-17, No. 6, June 1991, pp. 591-603.)J
102 477 :M
-.053([GDB92])A
154 477 :M
1.011 .101(A. Ghedamsi, R. Dssouli and G.v. Bochmann, "Diagnostic tests for single)J
154 495 :M
2.025 .203(transition faults in non-deterministic finite state machines", in 4th Int\325l)J
154 513 :M
.006 .001(Workshop on Protocol test Systems, Amsterdam, 1992, North-Holland.)J
102 531 :M
-.093([Gill62])A
154 531 :M
-.08(A. Gill, "Introduction to the Theory of Finite-State Machines", McGraw-Hill )A
154 549 :M
.495 .05(Book Company, Inc., 1962, 207 p.)J
102 567 :M
.05([Gins59])A
154 567 :M
2.32 .232(S. Ginsburg, \322On the Reduction of Superfluous States in a Sequential)J
154 585 :M
.354 .035(Machines\323, J. ACM, Vol. 6, 1959, pp. 252-282.)J
102 603 :M
([Gold78])S
154 603 :M
1.608 .161(E.M. Gold, "Complexity of Automaton Identification from Given Data",)J
154 621 :M
.34 .034(Information and Control, No. 3, 1978, pp. 302-320.)J
102 639 :M
([Gone70])S
154 639 :M
1.544 .154(G. Gonenc, \322A Method for the Design of Fault Detection Experiments\323,)J
154 657 :M
.392 .039(IEEE Trans. Computers, Vol. C-19, No. 6, June 1970, pp. 551-558.)J
102 675 :M
([GrLu65])S
154 675 :M
2.025 .203(A. Grasselli and F. Luccio, \322A Method for Minimizing the Number of)J
154 693 :M
3.766 .377(Internal States in Incompletely Sequential Networks\323, IEEE Trans.)J
154 711 :M
.137 .014(Electronic Computers, Vol. EC-14, June 1965, pp. 350-359.)J
endp
%%Page: 3 3
%%BeginPageSetup
initializepage
(bach; page: 3 of 6)setjob
%%EndPageSetup
-12 -12 :T
gS 12 12 552 730 rC
506 753 :M
f0_12 sf
1.5(148)A
102 81 :M
f1_12 sf
([Henn64])S
154 81 :M
.21 .021(F.C. Hennie, \322Fault Detecting Experiments for Sequential Circuits\323, Proc. of)J
154 99 :M
1.108 .111(5th Annual Symposium on Switching Circuit Theory and Logical Design,)J
154 117 :M
.527 .053(Princeton, NJ 1964, pp. 95-110.)J
102 135 :M
.049([HoSt93])A
154 135 :M
1.664 .166(D. Hoffman and P. Strooper, "A Case Study in Class Testing", in Proc.)J
154 153 :M
.377 .038(CASCON'93, Toronto, Canada, October 24-28, 1993, pp. 472-482.)J
102 171 :M
([Hsie71])S
154 171 :M
.609 .061(E.P. Hsieh, \322Checking Experiments for Sequential Machines\323, IEEE Trans.)J
154 189 :M
.341 .034(on Computers, Vol. 20, No. 10, October 1971, pp. 1152-1166.)J
102 207 :M
.052([Kars94])A
154 207 :M
.152 .015(P. Kars, "Test Coverage Estimation by Explicit Generation of Faulty FSMs",)J
154 225 :M
.918 .092(Proc. of IWPTS'94, 1994.)J
102 243 :M
-.092([Kell70])A
154 243 :M
3.737 .374(J. Kella, \322State Minimization of Incompletely Specified Sequential)J
154 261 :M
.161 .016(Machines\323, IEEE Trans. Computers, Vol. C-19, 4, April 1970, pp. 342-348.)J
102 279 :M
-.092([Kell71])A
154 279 :M
-.074(J. Kella, \322Sequential Machine Identification\323, IEEE Trans. Computers \(Short )A
154 297 :M
.469 .047(Notes\), Vol. C-20, No. 3, March 1971, pp. 332-338.)J
102 315 :M
([Koha78])S
154 315 :M
.679 .068(Z. Kohavi, "Switching and Finite Automata Theory", New York, McGraw-)J
154 333 :M
.497 .05(Hill, 1978, 658 p.)J
102 351 :M
-.233([LeYa94])A
154 351 :M
3.975 .397(D. Lee and M. Yannakakis, \322Testing Finite-State Machines: State)J
154 369 :M
.41 .041(Identification and Verification\323, IEEE Trans. on Computers, Vol. 43, No. 3,)J
154 387 :M
.32 .032(March 1994, pp. 306-320.)J
102 405 :M
([LoSh92])S
154 405 :M
3.083 .308(F. Lombardi and Y.N. Shen, "Evaluation and Improvement of Fault)J
154 423 :M
3.02 .302(Coverage of Conformance Testing by UIO Sequences", IEEE Trans.)J
154 441 :M
.438 .044(Commun., Vol. COM-40, 8, August, 1992, pp. 1288-1293.)J
102 459 :M
-.093([Loto87])A
154 459 :M
-.079(ISO DIS8807, \322LOTOS: a formal description technique\323, 1987.)A
102 477 :M
-.055([MCS93])A
154 477 :M
2.712 .271(H. Motteler, A. Chung and D. Sidhu, "Fault Coverage of UIO-based)J
154 495 :M
.096 .01(Methods for Protocol Testing", Proc. IWPTS, Pau, France, 28-30 September,)J
154 513 :M
.859 .086(1993, pp. 21-33.)J
102 531 :M
-.141([MiPa92])A
154 531 :M
.298 .03(R.E. Miller and S. Paul, "Structural Analysis of a Protocol Specification and)J
154 549 :M
1.764 .176(Generation of a Maximal Fault Coverage Conformance Test Sequence",)J
154 567 :M
-.092(submitted for publication.)A
102 585 :M
-.092([Moor56])A
154 585 :M
1.227 .123(E.F. Moore, \322Gedanken-Experiments on Sequential Machines\323, Automata)J
154 603 :M
.231 .023(Studies, Princeton University Press, Princeton, New Jersey, 1956.)J
102 621 :M
-.139([More90])A
154 621 :M
1.734 .173(L.J. Morell, \322A Theory of Fault-Based Testing\323, IEEE Trans. SE-16, 8,)J
154 639 :M
.434 .043(August 1990, pp. 844-857.)J
102 657 :M
([NaTs81])S
154 657 :M
.933 .093(S. Naito and M. Tsunoyama, \322Fault Detection for Sequential Machines by)J
154 675 :M
.425 .043(Transition-Tours\323, Proc. of FTCS, 1981, pp. 238-243.)J
endp
%%Page: 4 4
%%BeginPageSetup
initializepage
(bach; page: 4 of 6)setjob
%%EndPageSetup
-12 -12 :T
gS 12 12 552 730 rC
506 753 :M
f0_12 sf
1.5(149)A
102 81 :M
f1_12 sf
.051([PaUn59])A
154 81 :M
3.545 .354(M.C. Paull and S.H. Unger, \322Minimizing the Number of States in)J
154 99 :M
3.261 .326(Incompletely Specified Sequential Switching Functions\323, IRE Trans.)J
154 117 :M
-.075(Electronic Computers, Vol. )A
294 117 :M
.63 .063(EC-8, Sept. 1959, pp. 356-367.)J
102 135 :M
-.054([PBD93])A
154 135 :M
.898 .09(A. Petrenko, G.v. Bochmann and R. Dssouli, "Conformance Relations and)J
154 153 :M
2.635 .264(Test Derivation", Proc. IWPTS, Pau, France, 28-30 September, 1993,)J
154 171 :M
.955 .096(pp. 157-178.)J
102 189 :M
-.044([Petr91])A
154 189 :M
1.148 .115(A.F. Petrenko, \322Checking Experiments with Protocol Machines\323, Proc. of)J
154 207 :M
.146 .015(the 4th Int. Workshop on Protocol Test Systems, 1991, pp. 83-94.)J
102 225 :M
-.139([PeYe92])A
154 225 :M
1.754 .175(A.F. Petrenko and N. Yevtushenko, "Test Generation for a FSM with a)J
154 243 :M
.793 .079(Given Type of Implementation  Errors", Proc. of 12th IFIP Symposium on)J
154 261 :M
-.04(Protocol Specification, Testing and Verification, Florida, USA, June 1992,)A
102 279 :M
-.045([Rayn87])A
154 279 :M
4.065 .407(D. Rayner, \322OSI Conformance Testing\323, North-Holland, Computer)J
154 297 :M
.352 .035(Networks and ISDN Systems 14, 1987, pp. 79-98.)J
102 315 :M
([SaBo82])S
154 315 :M
1.578 .158(B. Sarikaya and G.v. Bochmann, \322Some Experience with Test Sequence)J
154 333 :M
4.759 .476(Generation for Protocols\323, Proc. of 2nd Int. Workshop Protocol)J
154 351 :M
-.08(Specification, Testing and Verification, 1982.)A
102 369 :M
([SaBo84])S
154 369 :M
.538 .054(B. Sarikaya and G.v. Bochmann, \322Synchronization and Specification Issues)J
154 387 :M
1.564 .156(in Protocol Testing\323, IEEE Trans. on Communications, COM-32, No. 4,)J
154 405 :M
.317 .032(April 1984, pp. 389-395.)J
102 423 :M
-.139([SaDa88])A
154 423 :M
.869 .087(K.K. Sabnani and A.T. Dahbura, \322A Protocol Test Generation Procedure\323,)J
154 441 :M
.357 .036(Computer Networks and ISDN Systems, Vol. 15, No. 4, 1988, pp. 285-297.)J
102 459 :M
.049([SaSp90])A
154 459 :M
2.797 .28(M. Sahinoglu and H. Spafford, \322Sequential Statistical Procedures for)J
154 477 :M
.834 .083(Approving Test Sets Using Mutation-Based Software Testing\323, SERC-TR-)J
154 495 :M
.175 .017(79-P, Software Engineering Research Center, Purdue University, September,)J
154 513 :M
.25(1990.)A
102 531 :M
-.108([SDL87])A
154 531 :M
.154 .015(CCITT SG XI, Recommendation Z.100, 1987.)J
102 549 :M
([Shen89])S
154 549 :M
1.808 .181(Y. N. Shen, et al., "Protocol Conformance Testing Using Multiple UIO)J
154 567 :M
.155 .015(Sequences", Proc. of 9th IFIP Symposium on Protocol Specification, Testing)J
154 585 :M
.096 .01(and Verification, Twente, Holland, 1989, pp. 131-143.)J
102 603 :M
-.092([SiLe89])A
154 603 :M
2.126 .213(D.P. Sidhu and T.K. Leung, \322Formal Methods for Protocol Testing: A)J
154 621 :M
1.653 .165(Detailed Study\323, IEEE Trans. Software Engineering, Vol. SE-15, No. 4,)J
154 639 :M
.317 .032(April 1989, pp. 413-426.)J
102 657 :M
-.14([Tome72])A
154 657 :M
1.444 .144(I. Tomescu, \322A Matrix Method for Determining All Pairs of Compatible)J
154 675 :M
.895 .089(States of a Sequential Machine\323, IEEE Trans. Computers, Vol. C-21, May)J
154 693 :M
.813 .081(1972, pp. 502-503.)J
endp
%%Page: 5 5
%%BeginPageSetup
initializepage
(bach; page: 5 of 6)setjob
%%EndPageSetup
-12 -12 :T
gS 12 12 552 730 rC
506 753 :M
f0_12 sf
1.5(150)A
102 81 :M
f1_12 sf
-.187([ToVa90])A
154 81 :M
.513 .051(P. Tollkuehn and L.Zs. Varga, \322Analysis of Formal Approaches in Protocol)J
154 99 :M
.081 .008(Conformance Testing\323, KFKI-1990-42/M, Preprint, 1990.)J
102 117 :M
([TPB95])S
154 117 :M
.914 .091(Q.M. Tan, A. Petrenko and G.v. Bochmann, \322Modelling Basic LOTOS by)J
154 135 :M
4.882 .488(FSMs for Conformance Testing\323, Publication #958, D\216partement)J
154 153 :M
2.339 .234(d\325informatique et de recherche op\216rationnelle, Universit\216 de Montr\216al,)J
154 171 :M
.3 .03(February 1995.)J
102 189 :M
-.046([TuRo92])A
154 189 :M
.749 .075(C.D. Turner and D.J. Robson, "The Testing of Object-Oriented Programs",)J
154 207 :M
-.049(Technical Report TR-13/92, University of Durham, 1992.)A
102 225 :M
([Unge65])S
154 225 :M
.654 .065(S.H. Unger, \322Flow Table Simplification - Some Useful Aids\323, IEEE Trans.)J
154 243 :M
.137 .014(Electronic Computers, Vol. EC-14, June 1965, pp. 472-475.)J
102 261 :M
-.043([Ural87])A
154 261 :M
-.046(H. Ural, \322A test derivation method for protocol conformance testing\323, in Proc.)A
154 279 :M
.278 .028(of PSTV-VII, 1987.)J
102 297 :M
-.043([Ural91])A
154 297 :M
2.843 .284(H. Ural, "Formal Methods for Test Sequence Generation", Computer)J
154 315 :M
.4 .04(Communications, Vol. 15, No. 5, June 1992, pp. 311-325.)J
102 333 :M
-.14([Vasi73])A
154 333 :M
3.126 .313(M. P. Vasilevskii, "Failure Diagnosis of Automata", translated from)J
154 351 :M
.515 .052(Kibernetika, No.4, July-August, 1973, pp. 98-108.)J
102 369 :M
-.235([VuAl92])A
154 369 :M
3.209 .321(S.T. Vuong and J. Alilovic-Curgus, \322On Test Coverage Metrics for)J
154 387 :M
1.8 .18(Communication Protocols\323, in J. Kroon et al. \(eds.\), IWPTS-IV, North-)J
154 405 :M
.62 .062(Holland, 1992, pp. 31-46.)J
102 423 :M
-.093([Vuon89])A
154 423 :M
3.516 .352(S.T. Vuong, et al., \322The UIOv-method for Protocol Test Sequence)J
154 441 :M
1.792 .179(Generation\323, Proc. of the 2nd Int. Workshop on Protocol Test Systems,)J
154 459 :M
(Berlin, Germany, Oct. 3-)S
280 459 :M
.801 .08(6, 1989, pp. 203-225.)J
102 477 :M
1.083 .108([VuKo90] S.T. Vuong and K.C. Ko, \322A Novel Approach to Protocol Test Sequence)J
154 495 :M
.21 .021(Generation\323, Proc. of GlobalCOM\32590, 1990, pp. 1880-1884.)J
102 513 :M
-.14([YaBo93])A
154 513 :M
.099 .01(M. Yao and G. v. Bochmann, "Testing for a Conformance Relation Based on)J
154 531 :M
3.539 .354(Acceptance", in Lecture Notes in Computer Science \(LNCS\) #668,)J
154 549 :M
.122 .012(TAPSOFT\32593: Theory and Practice of Software Development, M.-C. Gaudel)J
154 567 :M
1.105 .11(and J.-P. Jouannaud \(Eds.\), Springer-Verlag, Berlin Heidelberg, 1993, pp.)J
154 585 :M
.144(519-528.)A
102 603 :M
-.233([YaLe91])A
154 603 :M
.034 .003(M. Yannakakis and D. Lee, "Testing Finite State Machines", Proc. of the 23d)J
154 621 :M
-.221(Annual )A
196 621 :M
4.01 .401(ACM Symposium on Theory of Computing, New Orleans,)J
154 639 :M
.463 .046(Louisiana, 1991, pp. 476-485.)J
102 657 :M
-.163([Yao95])A
154 657 :M
1.147 .115(M. Yao, \322User\325s Guide to FACT - The Fault Coverage Analysis Tool for)J
154 675 :M
.013 .001(Protocol Conformance Testing\323, D\216partement d\325informatique et de recherche)J
154 693 :M
-.041(op\216rationnelle, Universit\216 de Montr\216al, February, 1995.)A
endp
%%Page: 6 6
%%BeginPageSetup
initializepage
(bach; page: 6 of 6)setjob
%%EndPageSetup
-12 -12 :T
gS 12 12 552 730 rC
506 753 :M
f0_12 sf
1.5(151)A
102 81 :M
f1_12 sf
-.09([YaUr90])A
154 81 :M
2.694 .269(B. Yang and H. Ural, "Protocol Conformance Test Generation Using)J
154 99 :M
2.129 .213(Multiple UIO Sequences with Overlapping", Computer Communication)J
154 117 :M
.694 .069(Review, No. 4, 1990, pp. 118-125.)J
102 135 :M
2.634 .263([YPB93a] M. Yao, A. Petrenko and G.v. Bochmann, \322Conformance Testing of)J
154 153 :M
.6 .06(Machines without Reset\323, Publication #861, D\216partement d\325informatique et)J
154 171 :M
-.042(de recherche op\216rationnelle, Universit\216 de Montr\216al, Feb. 1993, 27 p.)A
102 189 :M
.047 .005([YPB93b] M. Yao, A. Petrenko and G.v. Bochmann, "Conformance Testing of Protocol)J
154 207 :M
1.299 .13(Machines without Reset", Proc. of the 13th IFIP Symposium on Protocol)J
154 225 :M
.84 .084(Specification, Testing and Verification, Liege, Belgium, May 25-28, 1993,)J
154 243 :M
.955 .096(pp. 241-253.)J
102 261 :M
1.691 .169([YPB94a] M. Yao, A. Petrenko and G.v. Bochmann, \322Fault Coverage Analysis in)J
154 279 :M
.877 .088(Respect to an FSM Specification\323, Proc. of IEEE INFOCOM\32594, Toronto,)J
154 297 :M
.189 .019(Ontario, Canada, June 12-16, 1994.)J
102 315 :M
.379 .038([YPB94b] M. Yao, A. Petrenko and G.v. Bochmann, \322A Structural Analysis Approach)J
154 333 :M
1.517 .152(to the Evaluation of Fault Coverage for Protocol Conformance Testing\323,)J
154 351 :M
.382 .038(Proc. of FORTE\32594, 1994.)J
102 369 :M
-.046([ZhCh94])A
154 369 :M
2.001 .2(J. Zhu and S.T. Chanson, \322Fault Coverage Evaluation of Protocol Test)J
154 387 :M
2.403 .24(Sequences\323, Proc. of 14th IFIP Symposium on Protocol Specification,)J
154 405 :M
-.076(Testing and Verification, 1994.)A
102 423 :M
-.092([Zhan92])A
154 423 :M
1.237 .124(L. D. Zhang, et al., "A Further Optimization Technique for Conformance)J
154 441 :M
.659 .066(Testing Based on Multiple UIO Sequences", Proc. of 5th Int. Workshop on)J
154 459 :M
-.035(Protocol Test Systems, Montreal, Quebec, Canada, September 1992.)A
endp
%%Trailer
end
%%EOF