Testing equivalence as a bisimulation equivalence
- 1 January 1993
- journal article
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 5 (1) , 1-20
- https://doi.org/10.1007/bf01211314
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. On the basis of 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.Keywords
This publication has 10 references indexed in Scilit:
- CCS expressions, finite state processes, and three problems of equivalenceInformation and Computation, 1990
- Bisimulation and divergenceInformation and Computation, 1990
- Bisimulation through probabilistic testing (preliminary report)Published by Association for Computing Machinery (ACM) ,1989
- Bisimulation can't be tracedPublished by Association for Computing Machinery (ACM) ,1988
- Three Partition Refinement AlgorithmsSIAM Journal on Computing, 1987
- Acceptance treesJournal of the ACM, 1985
- Algebraic laws for nondeterminism and concurrencyJournal of the ACM, 1985
- Testing equivalences for processesTheoretical Computer Science, 1984
- Calculi for synchrony and asynchronyTheoretical Computer Science, 1983
- A term model for synchronous processesInformation and Control, 1981