PROBLEMS CONCERNING FAIRNESS AND TEMPORAL LOGIC FOR CONFLICT-FREE PETRI NETS

被引:19
作者
HOWELL, RR [1 ]
ROSIER, LE [1 ]
机构
[1] UNIV TEXAS, DEPT COMP SCI, AUSTIN, TX 78712 USA
关键词
D O I
10.1016/0304-3975(89)90053-4
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:305 / 329
页数:25
相关论文
共 49 条
[1]   LIMITS FOR AUTOMATIC VERIFICATION OF FINITE-STATE CONCURRENT SYSTEMS [J].
APT, KR ;
KOZEN, DC .
INFORMATION PROCESSING LETTERS, 1986, 22 (06) :307-309
[2]   CORRECTION [J].
BEST, E .
INFORMATION PROCESSING LETTERS, 1984, 19 (03) :162-162
[3]   FAIRNESS AND CONSPIRACIES [J].
BEST, E .
INFORMATION PROCESSING LETTERS, 1984, 18 (04) :215-220
[4]   BOUNDS ON POSITIVE INTEGRAL SOLUTIONS OF LINEAR DIOPHANTINE EQUATIONS [J].
BOROSH, I ;
TREYBIG, LB .
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1976, 55 (02) :299-304
[5]  
BRAMS GW, 1983, RESEAUX PETRI THEORI, V1
[6]  
CARSTENSEN H, 1987, LECT NOTES COMPUT SC, V247, P396
[7]  
CARSTENSEN H, 1985, LECT NOTES COMPUT SC, V188, P83
[8]  
CLARKE EM, 1986, 5TH P ACM S PRINC DI, P240
[9]  
Crespi-Reghizzi S., 1975, Information Processing Letters, V3, P78, DOI 10.1016/0020-0190(75)90020-4
[10]   MODALITIES FOR MODEL CHECKING - BRANCHING TIME LOGIC STRIKES BACK [J].
EMERSON, EA ;
LEI, CL .
SCIENCE OF COMPUTER PROGRAMMING, 1987, 8 (03) :275-306