Fair simulation

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

Volumn 1243, Issue , 1997, Pages 273-287

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

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957873489     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63141-0_19     Document Type: Conference Paper

References (28)

1. M. Abadi and L. Lamport. The existence of refinement mappings. Theoretical Computer Science, 82:253-284, 1991.
2. A. Aziz, V. Singhal, F. Balarin, R.K. Brayton, and A.L. Sangiovanni-Vincentelli. Equivalences for fair Kripke structures. In Proc. 21st ICALP, Springer LNCS 820, pp. 364-375, 1994.
3. S. Bensalem, A. Bouajjani, C. Loiseaux, and J. Sifakis. Property-preserving simulations. In Proc. 4th CAV, Springer LNCS 663, pp. 260-273, 1992.
4. J.A. Bergstra, J.W. Klop, and E.R. Olderog. Failures without chaos: a new process semantics for fair abstraction. In Proc. 8rd IFIP FDPC, Elsevier, pp. 77-103, 1987.
5. B. Bloom and R. Paige. Transformational design and implementation of a new efficient solution to the ready simulation problem. Science of Computer Programming, 24:189-220, 1996.
6. E. Brinksma, A. Rensink, and W. Vogler. Fair testing. In Proc. 6th CONCUR, Springer LNCS 962, pp. 313-327, 1995.
7. O. Bernholtz, M.Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. In Proc. 6th CAV, Springer LNCS 818, pp. 142-155, 1994.
8. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal-logic specifications. ACM Transactions on Programming Languages and Systems, 8:244-263, 1986.
9. R.J. Cleaveland, J. Parrow, and B. Steffen. The Concurrency Workbench: a semantics-based tool for the verification of finite-state systems. ACM Transactions on Programming Languages and Systems, 15:36-72, 1993.
10. D. Dill, A.J. Hu, and H. Wong-Toi. Checking for language inclusion using simulation relations. In Proc. 3rd CAV, Springer LNCS 575, pp. 255-265, 1991.
11. E.A. Emerson and C. Jutla. The complexity of tree automata and logics of programs. In Proc. 29th FOCS, IEEE Computer Society, pp. 368-377, 1988.
12. O. Grumberg and D.E. Long. Model checking and modular verification. ACM Transactions on Programming Languages and Systems, 16:843-871, 1994.
13. M.C.B. Hennessy. An algebraic theory of fair asynchronous communicating processes. Theoretical Computer Science, 49:121-143, 1987.
14. M.R. Henzinger, T.A. Henzinger, and P.W. Kopke. Computing simulations on finite and infinite graphs. In Proc. 36th FOCS, IEEE Computer Society, pp. 453-462, 1995.
15. R. Hojati. A BDD-based Environment for Formal Verification of Hardware Systems. PhD thesis, EECS Department, University of California, Berkeley, 1996.
16. O. Kupferman and M.Y. Vardi. Verification of fair transition systems. In Proc. 8th CAV, Springer LNCS 1102, pp. 372-382, 1996.
17. L. Lamport. Specifying concurrent program modules. ACM Transactions on Programming Languages and Systems, 5:190-222, 1983.
18. N.A. Lynch and R. Segaia. A comparison of simulation techniques and algebraic techniques for verifying concurrent systems. Technical Report MIT/LCS/TM-499, Laboratory for Computer Science, MIT, 1993.
19. N.A. Lynch and M.R. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proc. 6th PODC, ACM, pp. 137-151, 1987.
20. N.A. Lynch. Distributed Algorithms. Morgan-Kaufmarm, 1996.
21. R. Mihaer. An algebraic definition of simulation between programs. In Proc. 2nd IJCAL British Computer Society, pp. 481-489, 1971.
22. V. Natarajan and R.J. Cleaveland. Divergence and fair testing. In Proc. 22nd ICALP, Springer LNCS 944, pp. 648-659, 1995.
23. A. Pnueli. Linear and branching structures in the semantics and logics of reactive systems. In Proc. 12th ICALP, Springer LNCS 194, pp. 15-32, 1985.
24. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proc. 16th POPL, ACM, pp. 179-190, 1989.
25. M.O. Rabin. Weakly definable relations and special automata. In Proc. Mathematical Logic and Foundations of Set Theory, Elsevier, pp. 1-23, 1970.
26. S. Safra. On the complexity of w-automata. In Proc. 29th FOCS, IEEE Computer Society, pp. 319-327, 1988.
27. L.J. Stockmeyer and A.R. Meyer. Word problems requiring exponential time. In Proc. 5th STOC, ACM, pp. 1-9, 1973.
28. A.P. Sistla, M.Y. Vardi, and P. Wolper. The complementatian problem for Bilchi automata with appficatious to temporal logic. Theoretical Computer Science, 49:217-237, 1987.