Fair bisimulation

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

Volumn 1785 LNCS, Issue , 2000, Pages 299-314

  Henzinger, Thomas A ^a   Rajamani, Sriram K ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; TEMPORAL LOGIC;

BISIMULATION GAMES; CENTRAL OBSERVATIONS; EXPONENTIAL TIME; FINITE STATE SYSTEMS; LABELED TRANSITION SYSTEMS; LOGICAL CHARACTERIZATION; PROPERTY-PRESERVING; TIME POLYNOMIALS;

TEMPORAL LOGIC; FAULT TOLERANCE;

EID: 84863931900     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46419-0_21     Document Type: Conference Paper

References (18)

1. A. Aziz, V. Singhal, F. Balarin, R.K. Brayton, and A.L. Sangiovanni-Vincentelli. Equivalences for fair kripke structures. In ICALP 94: Automata, Languages, and Programming, Lecture Notes in Computer Science 820, pages 364-375. Springer-Verlag, 1994.
2. M.C. Browne, E.M. Clarke, and O. Grumberg. Characterizing finite Kripke structures in propositional temporal logic. Theoretical Computer Science, 59:115-131, 1988.
3. J.A. Bergstra, J.W. Klop, and E.R. Olderog. Failures without chaos: a new process semantics for fair abstraction. In Formal Description Techniques III, pages 77-103. Elsevier, 1987.
4. J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge University Press, 1990.
5. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems usingtemporal-logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244-263, 1986. (Pubitemid 16633197)
6. 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(1):36-72, 1993.
7. W. Vogler, E. Brinksma, and A. Rensink. Fair testing. In CONCUR 95: Theories of Concurrency, Lecture Notes in Computer Science 962, pages 313-327. Springer-Verlag, July 1995.
8. O. Grumbergand D.E. Long. Model checkingand modular verification. ACM Transactions on Programming Languages and Systems, 16(3):843-871, 1994.
9. M.C.B. Hennessy. An algebraic theory of fair asynchronous communicating processes. Theretical Computer Science, 49:121-143, 1987.
10. M. Huth and M. Kwiatkowska. The semantics for fair recursion with divergence. Technical Report CSR-96-4, University of Birmingham, 1996.
11. T.A. Henzinger, O. Kupferman, and S. K. Rajamani. Fair simulation. In CONCUR 97: Theories of Concurrency, Lecture Notes in Computer Science 1243, pages 273-287. Springer-Verlag, July 1997. (Pubitemid 127089324)
12. P.C. Kanellakis and S.A. Smolka. CCS expressions, finite-state processes, and three problems of equivalence. Information and Computation, 86:43-68, 1990.
13. O. Kupferman and M.Y. Vardi. Verification of fair transition systems. In CAV 96: Computer Aided Verification, Lecture Notes in Computer Science 1102, pages 372-381. Springer-Verlag, 1996.
14. O. Kupferman and M.Y. Vardi. Weak alternatingautomata and tree automata emptiness. In Proceedings of the 30th ACM Symposium on Theory of Computing, pages 224-233. ACM Press, 1998.
15. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
16. V. Natarajan and R. Cleaveland. Divergence and fair testing. In ICALP 95: Automata, Languages, and Programming, Lecture Notes in Computer Science 944, pages 648-659. Springer-Verlag, 1995.
17. D.M.R. Park. Concurrency and Automata on Infinite Sequences. Lecture Notes in Computer Science 104. Springer-Verlag, 1980.
18. R. Paige and R.E. Tarjan. Three partition-refinement algorithms. SIAM Journal of Computing, 16(6):973-989, 1987.