DMCA
Bisimulation through probabilistic testing (1989)
| Venue: | in “Conference Record of the 16th ACM Symposium on Principles of Programming Languages (POPL |
| Citations: | 528 - 14 self |
BibTeX
@INPROCEEDINGS{Larsen89bisimulationthrough,
author = {Kim G. Larsen and Arne Skou},
title = {Bisimulation through probabilistic testing},
booktitle = {in “Conference Record of the 16th ACM Symposium on Principles of Programming Languages (POPL},
year = {1989},
pages = {344--352}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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 $-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. li? 1991 Academic Press. Inc. 1.
