Abstract
This paper develops an efficient algorithm for determining when one system is capable of simulating the behavior of another. The method combines an iterative algorithm for computing behavioral preorders with an algorithm that simultaneously computes the bisimulation equivalence classes of the systems in question. Experimental data indicate that the new routine dramatically outperforms the best-known algoritm for computing simulation, even when the systems are minimized with respect to bisimulation before the simulation algorithm is invoked.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
A. Aho, J. Hopcroft, and J. Ullman. Design and Analysis of Algorithms. Addisom Wesley, 1974.
S. Bensalem, A. Bouajjani, C. Loiseaux, and J. Sifakis. Property-preserving simulations. In G.v. Bochmann and D.K. Probst, editors, Computer Aided Verification (CAV’ 92), volume 663 of Lecture Notes in Computer Science, pages 260–273, Montréal, June/July 1992. Springer-Verlag.
A. Bouajjani, J.C. Fernandez, N. Halbwachs, C. Ratel, and P. Raymond. Minimal state graph generation. Science of Computer Programming, 18(3):247–271, June 1992.
S. D. Brookes, C. A. R. Hoare, and A. W. Roscoe. A theory of communicating sequential processes. Journal of the ACM, 31(3):560–599, July 1984.
B. Bloom. Ready Simulaton, Bisimulation, and the Semantics of CCS-Like languages. PhD thesis, Massachusetts Institute of Technology, Aug. 1989.
B. Bloom and R. Paige. Transformational design and implementation of a new effcient solution to the ready simulation problem. Science of Computer Programming, 24(3):189–220, June 1995.
U. Celikkan and R. Cleaveland. Generating diagnostic information for behavioral preordering. Distributed Computing, 9:61–75, 1995.
U. Celikkan. Semantic Preorders in the Automated Verification of Concurrent Systems. PhD thesis, North Carolina State University, Raleigh, 1995.
R. Cleaveland and M. C. B. Hennessy. Testing equivalence as a bisimulation equivalence. Formal Aspects of Computing, 5:1–20, 1993.
R. Cleaveland, G. Luettgen, V. Natarajan, and S. Sims. Modeling and verifying distributed systems using priorities: A case study. Software Concepts and Tools, 17:50–62, 1996.
R. J. Cleaveland and B. Steén. When is ‘partial’ adequate? a logic-based proof technique using partial specifications. In Proceedings of 5th Annual IEEE Symposium on Logic in Computer Science, Philadelphia, PA, June 1990.
D. Dams, R. Gerth, and O. Grumberg. Abstract interpretation of reactive systems. ACM Transactions on Programming Languages and Systems, 19(2):253–291, March 1997.
R. De Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83–133, 1983.
J.-C. Fernandez. An implementation of an efficient algorithm for bisimulation equivalence. Sicence of Computer Programming, 13:219–236, 1989/90.
M. Henzinger, T. Henzinger, and P. Kopke. Computing simulations on finite and infinite graphs. In 36th Annual IEEE Syposium on Foundations of Computer Science, pages 453–462. Computer Society Press, 1995.
B. Jonsson. Simulations between specifications of distributed systems. In J.C.M. Baeten and J.F. Groote, editors, CONCUR’ 91, volume 527 of Lecture Notes in Computer Science, pages 346–360, Amsterdam, August 1991. Springer-Verlag.
N. Lynch and F. Vaandrager. Forward and backward simulations—part i: Untimed systems. Information and Computation, 121(2):214–233, September 1995.
R. Milner. An algebraic definition of simulation between programs. In Proceedings of the Second International Joint Conference on Artificial Intelligence. BCS, 1971.
R. Paige and R. E. Tarjan. Three partition refinement algorithms. SIAM Journal of Computing, 16(6):973–989, December 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tan, L., Cleaveland, R. (2001). Simulation Revisited. In: Margaria, T., Yi, W. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2001. Lecture Notes in Computer Science, vol 2031. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45319-9_33
Download citation
DOI: https://doi.org/10.1007/3-540-45319-9_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41865-8
Online ISBN: 978-3-540-45319-2
eBook Packages: Springer Book Archive