Applicability of fair simulation

Information and Computation

Volumn 194, Issue 1, 2004, Pages 1-18

  Bustan, Doron ^a   Grumberg, Orna ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Assume guarantee; Branching time logics; Fair simulation; Minimization; Preorder

Indexed keywords

APPROXIMATION THEORY; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; FORMAL LOGIC; INFORMATION THEORY; MATHEMATICAL MODELS; OPTIMIZATION;

ASSUME-GUARANTEE; BRANCHING TIME LOGICS; FAIR SIMULATIONS; PREORDERS;

COMPUTATION THEORY;

EID: 4344653808     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2004.02.005     Document Type: Article

References (30)

1. A. Aziz, V. Singhal, T.R. Shiple, A.L. Sangiovanni-Vincentelli, F. Balarin, R.K. Brayton, Equivalences for fairkripke structures, in: ICALP, volume 840 of LNCS, 1994, pp. 364-375.
2. S. Bensalem, A. Bouajjani, C. Loiseaux, J. Sifakis, Property preserving simulations, in: Proceedings of the 4th Conference on Computer Aided Verification, volume 663 of Lecture Notes in Computer Science, Montreal, Springer-Verlag, Berlin, 1992, pp. 260-273.
3. M.C. Browne, E.M. Clarke, O. Grumberg, Characterizing finite kripke structures in propositional temporal logic, Theoretical Computer Science 59 (1988) 115-131.
4. D. Bustan, Equivalence-based reductions andchecking for preorders, PhD thesis, Technion, Haifa, Israel, 2002.
5. D. Bustan, O. Grumberg, Simulation based minimization, Conference on Automated Deduction 17 (2000) 255-270.
6. D. Bustan, O. Grumberg, Applicability of fair simulation, in: Tools and Algorithms for Construction and Analysis of Systems (TACAS), volume 17 of LNCS, 2002, pp. 401-414.
7. E.M. Clarke, O. Grumberg, D.A. Peled, Model Checking, MIT Press, Cambridge, MA, 1999.
8. C. Courcoubetis, M. Vardi, P. Wolper, M. Yannakakis, Memory efficient algorithms for the verification of temporal properties, in: Proceedings of Computer-Aided Verification, volume 531 of LNCS, 2002, pp. 233-242.
9. D.L. Dill, A.J. Hu, H. Wong-Toi, Checking for language inclusion using simulation relation, in: Computer-Aided Verification, volume 575 of LNCS, 1991, pp. 255-265.
10. E.A. Emerson, C.-L. Lei, Efficient model checking in fragments of the propositional μ-calculus, in: Proceedings of the 1st Symposium on Logic in Computer Science, Cambridge, 1986, pp. 267-278.
11. K. Etessami, G.J. Holzmann, Optimizing Büchi automata, in: Proceedings of the CONCUR 2000, volume 1877 of LNCS, Springer-Verlag, Berlin, 2000, pp. 153-167.
12. K. Etessami, T. Wilke, R. Schuller, Fair simulation relations, parity games, and state space reduction for Büchi automata, in: Automata, Languages and Programming, 28th International colloquium, volume 2076 of LNCS, 2001, pp. 694-707.
13. N. Francez, The analysis of cyclic programs, PhD thesis, Weizmann Institute of Science, 1976.
14. C. Fritz, Constructing Büchi automata from linear temporal logic using simulation relations for alternating Büchi automata, in: O.H. Ibarra, Z. Dang (Eds.), Implementation and Application of Automata. Eighth International Conference, volume 2759 of LNCS, Santa Barbara, CA, USA, 2003, pp. 35-48.
15. C. Fritz, T. Wilke, State space reductions for alternating büchi automata: quotienting by simulation equivalences, in: M. Agrawal, A. Seth (Eds.), Foundations of Software Technology and Theoretical Computer Science: 22nd Conference, volume 2556 of LNCS, Kanpur, India, 2002, pp. 157-168.
16. O. Grumberg, D.E. Long, Model checking and modular verification, ACM Transactions on Programming Languages and Systems (TOPLAS) 16 (3) (1994) 843-871.
17. S. Gurumurthy, R. Bloem, F. Somenzi, Fair simulation minimization, in: Proceedings of the 14th International Conference on Computer Aided Verification, Springer-Verlag, Berlin, 2002, pp. 610-624.
18. M. Hennessy, R. Milner, Algebraic laws for nondeterminism and concurrency, Journal of ACM 32 (1985) 137-161.
19. T.A. Henzinger, O. Kupferman, S. Rajamani, Fair simulation, in: Proceedings of the eighth Conference on Concurrency Theory, volume 1234 of LNCS, 1997.
20. C.B. Jones, Specification and design of (parallel) programs, International Federation for Information Processing (IFIP) (1983) 321-332.
21. Shmuel Katz, Doron Peled, Defining conditional independence using collapses, Theoretical Computer Science 101 (2) (1992) 337-359.
22. D. Kozen, Results on the propositional μ-calculus, Theoretical Computer Science 27 (1983) 348-359.
23. O. Kupferman, M.Y. Vardi, Verification of fair transition systems, in: Computer Aided Verification (CAV'96), volume 1102 of LNCS, 1996, pp. 372-382.
24. O. Kupferman, M.Y. Vardi, Modular model checking, in: Proceedings of the Compositionality Workshop, volume 1536 of LNCS, Springer-Verlag, Berlin, 1998.
25. O. Kupferman, M.Y. Vardi, An automata-theoretic approach to modular model checking, ACM Transactions on Programming Languages and Systems 22 (2000) 87-128.
26. C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, S. Bensalem, Property preserving abstractions for the verification of concurrent systems, Formal Methods in System Design 6 (1) (1995).
27. R. Milner, An algebraic definition of simulation between programs, in: Proceedings of the 2nd International Joint Conferences on Artificial Intelligence (IJCAI), London, UK, 1971, pp. 481-489.
28. J. Misra, K.M. Chandy, Proofs of networks of processes, IEEE Transactions on Software Engineering 7 (1981) 417-426.
29. A. Pnueli, In transition from global to modular temporal reasoning about programs, in: K.R. Apt (Ed.), Logics and Models of Concurrent Systems, volume 13 of NATO ASI series F, Springer-Verlag, Berlin, 1984.
30. F. Somenzi, R. Bloem, Efficient Büchi automata from 111 formulae, in: Twelfth Conference on Computer Aided Verification (CAV'00), volume 1633 of LNCS, Springer-Verlag, Berlin, 2000, pp. 247-263.