Fair simulation

Information and Computation

Volumn 173, Issue 1, 2002, Pages 64-81

  Henzinger, Thomas A ^a   Kupferman, Orna ^b   Rajamani, Sriram K ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c MICROSOFT RESEARCH   (United States)

Author keywords

Fairness; Simulation; Verification

Indexed keywords

ALGORITHMS; COMPUTABILITY AND DECIDABILITY; GAME THEORY; POLYNOMIALS; TREES (MATHEMATICS);

FINITE-STATE SYSTEMS;

COMPUTER SIMULATION;

EID: 0037170504     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2001.3085     Document Type: Article

References (32)

1. Abadi, M., and Lamport, L. (1991), The existence of refinement mappings, Theoret. Comput. Sci. 82, 253-284.
2. Aziz, A., Singhal, V., Balarin, F., Brayton, R. K., and Sangiovanni-Vincentelli, A. L. (1994), Equivalences for fair Kripke structures, in "ICALP 94: International Colloquium on Automata, Languages, and Programming," Lecture Notes in Computer Science, Vol. 820, pp. 364-375, Springer-Verlag, Berlin/New York.
3. Bensalem, S., Bouajjani, A., Loiseanx, C., and Sifakis, J. (1992), Property-preserving simulations, in "CAV 92: Computer Aided Verification," Lecture Notes in Computer Science, Vol. 663, pp. 260-273, Springer-Verlag, Berlin/New York.
4. Bergstra, J. A., Klop, J. W., and Olderog, E. R. (1987), Failures without chaos: A new process semantics for fair abstraction, in "Formal Description Techniques III," proc. third IFIP WG 2.2 working cont. (M. Wirsing ed.), Ebberup, Denmark 1986, North Holland, pp. 77-103.
5. Bloom, B., and Paige, R. (1995), Transformational design and implementation of a new efficient solution to the ready simulation problem, Sci. Comput. Programming 24, 189-220.
6. Clarke, E. M., Emerson, E. A., and Sistla, A. P. (1986), Automatic verification of finite-state concurrent systems using temporal-logic specifications, ACM Trans. Programming Languages Systems 8, 244-263.
7. Cleaveland, R., and Natarajan, V. (1995), Divergence and fair testing, in "ICALP '95: International Colloquium on Automata, Languages, and Programming," Lecture Notes in Computer Science, Vol. 944, pp. 648-659, Springer-Verlag, Berlin/New York.
8. Cleaveland, R. J., Parrow, J., and Steffen, B. (1993), The concurrency workbench: A semantics-based tool for the verification of finite-state systems, ACM Trans. Programming Languages Systems 15, 36-72.
9. Damm, W., and Pnueli, A. (1997), Verifying out-of-order executions, in "CHARME 97: Correct Hardware Design and Verification Methods," pp. 23-47.
10. Dill, D. L., Hu, A. J., and Wong-Toi, H. (1991), Checking for language inclusion using simulation relations, in "CAV 91: Computer Aided Verification" Lecture Notes in Computer Science, Vol. 575, pp. 255-265, Springer-Verlag, Berlin/New York.
11. Grumberg, O., and Long, D. E. (1994), Model checking and modular verification, ACM Trans. Programming Languages Systems 16, 843-871.
12. Hennessy, M. C. B. (1987), An algebraic theory of fair asynchronous communicating processes, Theoret. Comput. Sci. 49, 121-143.
13. Henzinger, M. R., Henzinger, T. A., and Kopke, P. W. (1995), Computing simulations on finite and infinite graphs, in "FOCS 95: Foundations of Computer Science," pp. 453-462.
14. Henzinger, T. A., Qadeer, S., Rajamani, S. K., and Tasiran, S. (1998), An assume-guarantee rule for checking simulation, in "FMCAD 98: Formal Methods in Computer-Aided Design," Lecture Notes in Computer Science, Vol. 1522, pp. 421-432, Springer-Verlag, Berlin/New York.
15. Henzinger, T. A., and Rajamani, S. K. (2000), Fair bisimulation, in "TACAS 00: Tools and Algorithms for Construction and Analysis of Systems," Lecture Notes in Computer Science, Vol. 1785, pp. 299-314, Springer-Verlag, Berlin/New York.
16. Hojati, R. (1996), "A BDD-Based Environment for Formal Verification of Hardware Systems," Ph.D. thesis, University of California, Berkeley.
17. Kupferman, O., Safra, S., and Vardi, M. Y. (1996), Relating word and tree automata, in "LICS 96: Logic in Computer Science," pp. 322-333.
18. Kupferman, O., and Vardi, M. Y. (1996), Verification of fair transition systems, in "CAV 96: Computer Aided Verification," Lecture Notes in Computer Science, Vol. 1102, pp. 372-381, Springer-Verlag, Berlin/New York.
19. Kupferman, O., and Vardi, M. Y. (1998), Weak alternating automata and tree automata emptiness, in "STOC 98: Symposium on Theory of Computing," pp. 224-233.
20. Kupferman, O., Vardi, M. Y., and Wolper, P. (2000), An automata theoretic approach to branching time model checking, J. Assos. Comput. Mach. 47, 312-360.
21. Lamport, L. (1983), Specifying concurrent program modules, ACM Trans. Programming Languages Systems 5, 190-222.
22. Lynch, N. A., and Segala, R. (1993), "A Comparison of Simulation Techniques and Algebraic Techniques for Verifying Concurrent Systems," Technical Report, MIT/LCS/TM-499, MIT, Cambridge, MA.
23. Lynch, N. A., and Tuttle, M. R. (1987), Hierarchical correctness proofs for distributed algorithms, in "Proceedings of the 6th Annual Symposium on Principles of Distributed Computing," pp. 137-151.
24. Lynch, N. A. (1996), "Distributed Algorithms," Morgan Kaufmann, San Mateo, CA.
25. Milner, R. (1971), An algebraic definition of simulation between programs, in "Proceedings of the 2nd International Joint Conference on Artificial Intelligence," pp. 481-489.
26. Pnueli, A. (1985), Linear and branching structures in the semantics and logics of reactive systems, in "ICALP 85: International Colloquium on Automata, Languages, and Programming," Lecture Notes in Computer Science, Vol. 194, pp. 15-32, Springer-Verlag, Berlin/New York.
27. Pnueli, A., and Rosner, R. (1989), On the synthesis of a reactive module, in "POPL 89: Principles of Programming Languages," pp. 179-190.
28. Rabin, M. O. (1970), Weakly definable relations and special automata, in "Proceedings of the Symposium on Mathematical Logic and Foundations of Set Theory," pp. 1-23.
29. Safra, S. (1988), On the complexity of ω-automata, in "FOCS 88: Foundations of Computer Science," pp. 319-327.
30. Sistla, A. P., Vardi, M. Y., and Wolper, P. (1987), The complementation problem for Büchi automata with applications to temporal logic, Theoret. Comput. Sci. 49, 217-237.
31. Stockmeyer, L. J., and Meyer, A. R. (1973), Word problems requiring exponential time, in "STOC 73: Symposium on Theory of Computing," pp. 1-9.
32. Vogler, W., Brinksma, E., and Rensink, A. (1995), Fair testing, in "CONCUR 95: Theories of Concurrency," Lecture Notes in Computer Science, Vol. 962, pp. 313-327, Springer-Verlag, Berlin/New York.