BISIMULATION THROUGH PROBABILISTIC TESTING

被引:608
作者
LARSEN, KG
SKOU, A
机构
[1] Department of Mathematics and Computer Science, Aalborg University Center
关键词
19;
D O I
10.1016/0890-5401(91)90030-6
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We propose a language for testing concurrent processes and examine its strength in terms of the processes that are distinguished by a test. By using probabilistic transition systems as the underlying semantic model, we show how a testing algorithm can distinguish, with a probability arbitrarily close to one, between processes that are not bisimulation equivalent. We also show a similar result (in a slightly stronger form) for a new process relation called 2 3-bisimulation-which lies strictly between that of simulation and bisimulation. Finally, the ultimately strength of the testing language is shown to identify a new process relation called probabilistic bisimulation-which is strictly stronger than bisimulation. © 1991.
引用
收藏
页码:1 / 28
页数:28
相关论文
共 19 条
[1]   OBSERVATION EQUIVALENCE AS A TESTING EQUIVALENCE [J].
ABRAMSKY, S .
THEORETICAL COMPUTER SCIENCE, 1987, 53 (2-3) :225-241
[2]  
BLOOM B, 1989, LECT NOTES COMPUT SC, V363, P26
[3]  
*BLOOM B, 1988, 15TH P ACM POPL, P229
[4]  
*CHUNG KL, 1974, ELEMENTARY PROBABILI
[5]  
Cox D.R., 1974, THEORETICAL STAT
[6]   TESTING EQUIVALENCES FOR PROCESSES [J].
DENICOLA, R ;
HENNESSY, MCB .
THEORETICAL COMPUTER SCIENCE, 1984, 34 (1-2) :83-133
[7]  
DIJKSTRA EW, 1972, STRUCT PROGRAM, P1
[8]   ALGEBRAIC LAWS FOR NONDETERMINISM AND CONCURRENCY [J].
HENNESSY, M ;
MILNER, R .
JOURNAL OF THE ACM, 1985, 32 (01) :137-161
[9]  
*HUGHES G, 1972, INTRO MODAL LOGIC
[10]  
LARSEN KG, 1988, LECT NOTES COMPUT SC, V299, P215