Ready Simulation, Bisimulation, and the Semantics of CCS-Like Languages (1993)
| Citations: | 15 - 3 self |
BibTeX
@MISC{Bloom93readysimulation,,
author = {Bard Bloom},
title = {Ready Simulation, Bisimulation, and the Semantics of CCS-Like Languages},
year = {1993}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The questions of program comparison --- asking when two programs are equal, or when one is a suitable substitute for another --- are central in the semantics and verification of programs. It is not obvious what the definitions of comparison should be for parallel programs, even in the relatively simple case of core languages for concurrency, such as the kernel language of Milner's CCS. We introduce some criteria for judging notions of program comparison. Our basic notion is that of a congruence: two programs are equivalent with respect to a language L and a set of observations O iff they cannot be distinguished by any observation in O in any context of L. Bisimulation, the notion of program equivalence ordinarily used with CCS, is finer than CCS congruence: there are two programs which are not bisimilar, but cannot be told apart by CCS contexts. We explore the possibility of making bisimulation into a congruence. We CCS is defined by a set of structured operational rules. We introduc...
