CLOSED COVERS - TO VERIFY PROGRESS FOR COMMUNICATING FINITE STATE MACHINES

被引：23

作者：

GOUDA, MG

机构：

来源：

关键词：

D O I：

10.1109/TSE.1984.5010313

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：846 / 855

页数：10

共 16 条

[1]

BRAND D, 1983, J ACM, V30, P361

[2]

CHOW CH, 1983, 233 U TEX DEP COMP S

[3]

GOUDA MG, 1984, IEEE T COMMUN, V32, P779, DOI 10.1109/TCOM.1984.1096134

[4] PROTOCOL VALIDATION BY MAXIMAL PROGRESS STATE EXPLORATION [J].

GOUDA, MG ;

YU, YT .

[5]

GOUDA MG, 1983, 3RD P IFIP WORKSH PR, P63

[6]

GOUDA MG, 1984, 3RD ACM S PRINC DIST

[7]

Hopcroft J.E., 1969, FORMAL LANGUAGES THE

[8]

MEASCE DA, 1980, ACM T DATABASE SYST, V4, P103

MERLIN, P ;

VONBOCHMANN, G .

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1983, 5 (01) :1-25

[10]

SUNSHINE CA, 1975, THESIS STANFORD U ST