Applicability of fair simulation

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

Volumn 2280 LNCS, Issue , 2002, Pages 401-414

  Bustan, Doron ^a   Grumberg, Orna ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BRANCHING TIME; FAIR SIMULATION; MINIMIZATION ALGORITHMS; MODULAR FRAMEWORK; TIME COMPLEXITY;

MODEL CHECKING;

EID: 84888234096     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46002-0_28     Document Type: Conference Paper

References (16)

1. A. Aziz, V. Singhal, T.R. Shiple, A.L. Sangiovanni-Vincentelli, F. Balarin, and R.K. Brayton. Equivalences for fair kripke structures. In ICALP, LNCS 840, pages 364-375, 1994.
2. S. Bensalem, A. Bouajjani, C. Loiseaux, and J. Sifakis. Property preserving simulation. In Computer-aided Verification, volume 663 LNCS, pages 260-273, 1981.
3. D. Bustan and O. Grumberg. Simulation based minimization. In Conference on Automated Deduction, volume 17, pages 255-270, 2000.
4. E.M. Clarke, O. Grumberg, and D.A. Peled. Model Checking. MIT Press, 1999.
5. C. Courcoubetis, M. Vardi, P. Wolper, and M. Yannakakis. Memory efficient algorithms for the verification of temporal properties. In Proceedings of Computer-Aided Verification, Volume 531 of LNCS, pages 233-242, 1991.
6. D.L. Dill, A.J. Hu, and H. Wong-Toi. Checking for language inclusion using simulation relation. In Computer-Aided Verification, LNCS 575, pages 255-265, 1991.
7. K. Etessami, Th. Wilke, and R. Schuller. Fair simulation relations, parity games, and state space reduction for Büchi automata. In Automata, Languages and Pro-gramming, 28th international collquium, LNCS 2076, pages 694-707, 2001.
8. N. Francez. The Analysis of Cyclic Programs. PhD thesis, Weizmann Institute of Science, 1976.
9. O. Grumberg and D.E. Long. Model checking and modular verification. ACM Trans. on Programming Languages and Systems (TOPLAS), 16(3):843-871, 1994.
10. T.A. Henzinger, O. Kupferman, and S. Rajamani. Fair simulation. In Proc. 8th Conference on Concurrency Theory, LNCS 1234, 1997.
11. C. B. Jones. Specification and design of (parallel) programs. In In International Federation for Information Processing (IFIP), pages 321-332, 1983.
12. O. Kupferman and M.Y. Vardi. Verification of fair transition systems. In Computer Aided Verification (CAV'96), LNCS 1102, pages 372-382, 1996.
13. O. Kupferman and M.Y. Vardi. Modular model checking. In Proc. Compositionality Workshop, LNCS 1536. Springer-Verlag, 1998.
14. R. Milner. An algebraic definition of simulation between programs. In Proc. of the 2nd International Joint Conferences on Artificial Intelligence (IJCAI), pages 481-489, London, UK, 1971.
15. J. Misra and K.M. Chandy. Proofs of networks of processes. IEEE Transactions on Software Engineering, 7(7):417-426, 1981.
16. A. Pnueli. In transition for global to modular temporal reasoning about programs. In K. R. Apt, editor, Logics and Models of Concurrent Systems, Volume 13 of NATO ASI series F. sv, 1984.