Simulation revisited

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2031 LNCS, Issue , 2001, Pages 480-495

  Tan, Li ^a   Cleaveland, Ranee ^a  

^a Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; EQUIVALENCE CLASSES; ITERATIVE METHODS;

BISIMULATION EQUIVALENCES; BISIMULATIONS; ITERATIVE ALGORITHM; SIMULATION ALGORITHMS;

ITERATIVE METHODS; ALGORITHMS;

EID: 84903199314     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45319-9_33     Document Type: Conference Paper

References (19)

1. A. Aho, J. Hopcroft, and J. Ullman. Design and Analysis of Algorithms. Ad-disom Wesley, 1974.
2. 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, Montreal, June/July 1992. Springer-Verlag.
3. A. Bouajjani, J.C. Fernandez, N. Halbwachs, C. Ratel, and P. Raymond. Minimal state graph generation. Science of Computer Programming, 18(3):247-27l, June 1992.
4. 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.
5. B. Bloom. Ready Simulaton, Bisimulation, and the Semantics of CCS-Like languages. PhD thesis, Massachusetts Institute of Technology, Aug. 1989.
6. B. Bloom and R. Paige. Transformational design and implementation of a new efficient solution to the ready simulation problem. Science of Computer Programming, 24(3):189-220, June 1995.
7. U. Celikkan and R. Cleaveland. Generating diagnostic information for behavioral preordering. Distributed Computing, 9:61-75, 1995.
8. U. Celikkan. Semantic Preorders in the Automated Verification of Concurrent Systems. PhD thesis, North Carolina State University, Raleigh, 1995.
9. R. Cleaveland and M. C. B. Hennessy. Testing equivalence as a bisimulation equivalence. Formal Aspects of Computing, 5:1-20, 1993.
10. 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.
11. R. J. Cleaveland and B. Steffen. 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.
12. D. Dams, R. Gerth, and O. Grumberg. Abstract interpretation of reactive systems. ACM Transactions on Programming Languages and Systems, 19(2):253-29l, March 1997.
13. R. De Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83-133, 1983.
14. J.-C. Fernandez. An implementation of an efficient algorithm for bisimulation equivalence. Sicence of Computer Programming, 13:219-236, 1989/90.
15. M. Henzinger, T. Henzinger, and P. Kopke. Computing simulations on finite and infinite graphs. In 36 Annual IEEE Syposium on Foundations of Computer Science, pages 453-462. Computer Society Press, 1995.
16. 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.
17. N. Lynch and F. Vaandrager. Forward and backward simulations-part i: Untimed systems. Information and Computation, 121(2):2l4-233, September 1995.
18. R. Milner. An algebraic definition of simulation between programs. In Proceedings of the Second International Joint Conference on Artificial Intelligence. BCS, 1971.
19. R. Paige and R. E. Tarjan. Three partition refinement algorithms. SIAM Journal of Computing, 16(6):973-989, December 1987.