Testing Equivalences for Processes (1984)
by
R. De Nicola
,
M. C. B. Hennessy
| Venue: | Theoretical Computer Science |
| Citations: | 363 - 19 self |
BibTeX
@ARTICLE{Nicola84testingequivalences,
author = {R. De Nicola and M. C. B. Hennessy},
title = {Testing Equivalences for Processes},
journal = {Theoretical Computer Science},
year = {1984},
pages = {83--133}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. Given a set of processes and a set of tests on these processes we show how to define in a natural way three different eyuitalences on processes. ThesP equivalences are applied to a particular language CCS. We give associated complete proof systems and fully abstract models. These models have a simple representation in terms of trees.
