Testing Equivalence as a Bisimulation Equivalence (1993)
| Venue: | Formal Aspects of Computing |
| Citations: | 59 - 11 self |
BibTeX
@MISC{Cleaveland93testingequivalence,
author = {Rance Cleaveland and Matthew Hennessy},
title = {Testing Equivalence as a Bisimulation Equivalence },
year = {1993}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we show how the testing equivalences and preorders on transition systems may be interpreted as instances of generalized bisimulation equivalences and prebisimulation preorders. The characterization relies on defining transformations on the transition systems in such a way that the testing relations on the original systems correspond to (pre)bisimulation relations on the altered systems. Using these results, it is possible to use algorithms for determining the (pre)bisimulation relations in the case of finite-state transition systems to compute the testing relations.
Citations
| 3376 | Introduction to Automata Theory Languages and Computation. 2nd edition. Addison-Wesley Publishing Company, 2000. de - Hopcroft, Ullman - 2004 |
| 3118 | Communicating Sequential Processes - Hoare - 1985 |
| 1225 | A calculus of communicating systems - Milner - 1980 |
| 374 | Algebraic theory of processes - Hennessy - 1988 |
| 371 | A.: Bisimulation through Probabilistic Testing - Larsen, Skou - 1991 |
| 363 | M.: Testing Equivalences for Processes - Nicola, Hennessy - 1984 |
| 294 | Calculi for synchrony and asynchrony - Milner - 1983 |
| 169 | Bisimulation Can’t Be Traced - Bloom, Istrael, et al. - 1995 |
| 164 | Ccs expressions, finite state processes, and three problems of equivalence - Kanellakis, Smolka - 1983 |
| 45 | Acceptance Trees - Hennessy - 1985 |
| 11 | Bisimulation and divergence in CCS - Walker - 1988 |
| 5 | Concurrency and Automata in Infinite Strings - Park - 1981 |
| 1 | The Concurrency Workbench." To appear - Cleaveland, Parrow, et al. - 1989 |
| 1 | Three Partition Refinement Algorithms - Prentice-Hall - 1989 |
