EXPRESSIBILITY RESULTS FOR LINEAR-TIME AND BRANCHING-TIME LOGICS

被引：5
作者：
CLARKE, EM
DRAGHICESCU, IA
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1989年 / 354卷
关键词：
D O I：
10.1007/BFb0013029
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：428 / 437
页数：10
相关论文
共 10 条
[1]  
BENARI M, 1981, 8TH ANN ACM S PRINC, P164
[2]  
BROWNE MC, 1987, 1987 C TREES ALGEBR
[3]   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
[4]  
CLARKE EM, 1981, P WORKSHOP LOGIC PRO
[5]  
CLARKE EM, 1986, J ASSOC COMPUT MACH, V32, P733
[6]   DECISION PROCEDURES AND EXPRESSIVENESS IN THE TEMPORAL LOGIC OF BRANCHING TIME [J].
EMERSON, EA ;
HALPERN, JY .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1985, 30 (01) :1-24
[7]  
EMERSON EA, 1983, 10TH P ACM S PRINC P
[8]  
Hughes G. E, 1977, INTRO MODAL LOGIC
[9]  
LAMPORT L, 1980, 7TH ANN ACM S PRINC, P174
[10]  
MULLER DE, 1963, 4TH P IEEE ANN S SWI, P3
1