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.
Research supported by British Science and Engineering Research Council grant GC/D69464.
Chapter PDF
References
Bloom, B., S. Istrail and A. Meyer. “Bisimulation Can't Be Traced.” Proceedings of the ACM Symposium on Principles of Programming Languages, 1988.
Cleaveland, R., J. Parrow and B. Steffen. “The Concurrency Workbench.” To appear in the Proceedings of the Workshop on the Automated Verification of Finite-State Systems, Grenoble, 1989.
DeNicola, R. and M. Hennessy. “Testing Equivalences for Processes.” Theoretical Computer Science 24, 1984, pp. 83–113.
Hennessy, M. “Acceptance Trees.” Journal of the ACM, v. 32, n. 4, October 1985, pp. 896–928.
Hennessy, M. Algebraic Theory of Processes. MIT Press, Cambridge, 1988.
Hennessy, M. and R. Milner. “Algebraic Laws for Nondeterminism and Concurrency.” Journal of the ACM, v. 32, n. 1, January 1985, pp. 137–161.
Hoare, C.A.R. Communicating Sequential Processes. Prentice-Hall International, London, 1985.
Hopcroft, J. and J. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, 1979.
Kanellakis, P.C. and S.A. Smolka. “CCS Expressions, Finite State Processes, and Three Problems of Equivalence.” Proceedings of the ACM Symposium on Principles of Distributed Computing, 1983, pp. 228–240.
Larsen, K. and A. Skou. “Bisimulation through Probabilistic Testing.” Proceedings of the ACM Symposium on Principles of Programming Languages, 1989.
Milner, R. A Calculus of Communicating Systems. Lecture Notes in Computer Science 92. Springer-Verlag, Berlin, 1980.
Milner, R. “Calculi for Synchrony and Asynchrony.” Theoretical Computer Science, v. 25, n. 3, July 1983, pp. 267–310.
Milner, R. Communication and Concurrency. Prentice-Hall, 1989.
Paige, R. and R.E. Tarjan. “Three Partition Refinement Algorithms.” SIAM Journal of Computing, v. 16, n. 6, December 1987, pp. 973–989.
Park, D. “Concurrency and Automata in Infinite Strings.” Lecture Notes in Computer Science 104, pp. 167–183. Springer-Verlag, Berlin, 1981.
Walker, D. “Bisimulations and Divergence in CCS.” Proceedings of the Third Annual Symposium on Logic in Computer Science, pp. 186–192. Computer Society Press, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cleaveland, R., Hennessy, M. (1990). Testing equivalence as a bisimulation equivalence. In: Sifakis, J. (eds) Automatic Verification Methods for Finite State Systems. CAV 1989. Lecture Notes in Computer Science, vol 407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52148-8_2
Download citation
DOI: https://doi.org/10.1007/3-540-52148-8_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52148-8
Online ISBN: 978-3-540-46905-6
eBook Packages: Springer Book Archive