学术探索
学术期刊
新闻热点
数据分析
智能评审

REASONING ABOUT NETWORKS WITH MANY IDENTICAL FINITE STATE PROCESSES

被引：72
作者：
BROWNE, MC
CLARKE, EM
GRUMBERG, O
机构：
来源：
INFORMATION AND COMPUTATION | 1989年 / 81卷 / 01期
关键词：
D O I：
10.1016/0890-5401(89)90026-6
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：13 / 31
页数：19
相关论文
共 18 条
[1]   LIMITS FOR AUTOMATIC VERIFICATION OF FINITE-STATE CONCURRENT SYSTEMS [J].
APT, KR ;
KOZEN, DC .
INFORMATION PROCESSING LETTERS, 1986, 22 (06) :307-309
[2]  
BROOKES SD, 1983, LECT NOTES COMPUT SC, V154
[3]  
BROWNE M, 1986, IEEE T COMPUT, V35
[4]  
BROWNE MC, 1987, THEORET COMPUT SCI, V59, P115
[5]   AUTOMATIC VERIFICATION OF FINITE-STATE CONCURRENT SYSTEMS USING TEMPORAL LOGIC SPECIFICATIONS [J].
CLARKE, EM ;
EMERSON, EA ;
SISTLA, AP .
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1986, 8 (02) :244-263
[6]  
DILL DL, 1986, IEEE P, V5
[7]  
EMERSON EA, 1983, 10TH P ACM S PRINC P
[8]  
GRAF S, 1985, LECT NOTES COMPUT SC, V193
[9]  
HENNESSY M, 1980, LECT NOTES COMPUT SC
[10]  
KURSHAN RP, 1985, P S APPLIED MATH
12