From asymmetry to full symmetry: New techniques for symmetry reduction in model checking

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

Volumn 1703, Issue , 1999, Pages 142-157

  Emerson, E Allen ^a   Trefler, Richard J ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; DESIGN; HARDWARE; QUANTUM THEORY; RECONFIGURABLE HARDWARE;

ASYMMETRIC SYSTEM; PROGRAM STATE; REDUCED SYSTEMS; SYMBOLIC MODEL CHECKING; SYMMETRIC SYSTEMS; SYMMETRY GROUPS; SYMMETRY REDUCTION;

MODEL CHECKING;

EID: 84958599158     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48153-2_12     Document Type: Conference Paper

References (25)

1. Ajami, K., Haddad, S. and Ilie, J.-M., Exploiting Symmetry in Linear Time Temporal Logic Model Checking: One Step Beyond. In Tools and Algorithms for the Construction and Analysis of Systems, 4th Interntational Conference, ETAPS98 LNCS 1384, Springer Verlag, 1998.
2. Burch, J. R., Clarke, E. M., McMillan, K. L., Dill, D. L. and Hwang, L. J., Symbolic Model Checking: 1020 states and beyond. In Information and Computation, 98(2):142-170, June, 1992.
3. Bryant, R. E., Graph-Based Algorithms for Boolean Function Manipulation. In IEEE Transactions on Computers, Vol. C-35, No. 8, Aug. 86, pp. 677-691.
4. Clarke, E. M., and Emerson, E. A., Design and Verification of Synchronization Skeletons using Branching Time Temporal Logic. In Logics of Programs Workshop, Springer, LNCS no. 131., pp. 52-71, May 1981.
5. Clarke, E. M., Emerson, E. A., Jha, S. and Sistla A. P., Symmetry Reductions in Model Checking. In Computer Aided Verification, 10th International Conference LNCS 1427, Springer- Verlag, 1998.
6. Clarke, E. M., Emerson, E. A., and Sistla, A. P., Automatic Verification of Finite State Concurrent System Using Temporal Logic. In ACM Trans. on Prog. Lang. and Sys., vol. 8, no. 2, pp. 244-263, April 1986.
7. Clarke, E. M., Enders, R., Filkorn, T., and Jha, S., Exploiting Symmetry in Temporal Logic Model Checking. In Formal Methods in System Design, Kluwer, vol. 9, no. 1/2, August 1996.
8. Clarke, E. M., Grumberg, O. and Long, D. E., Model Checking and Abstraction. In Transactions on Programming Languages and Systems ACM, vol 16, no. 5, 1994.
9. E. Allen Emerson, Temporal and Modal Logic. In J. van Leeuwen editor Handbook of Theoretical Computer Science vol. B, Elsevier Science Publishing, 1990.
10. Emerson, E. A., and Halpern, J. Y., ‘Sometimes’ and ‘Not Never’ Revisited: On Branching versus Linear Time Temporal Logic, JACM, vol. 33, no. 1, pp. 151-178, Jan. 86.
11. Emerson, E. A. and Sistla, A. P., Symmetry and Model Checking. In Formal Methods in System Design, Kluwer, vol. 9, no. 1/2, August 1996.
12. Emerson, E. A. and Sistla, A. P., Utilizing Symmetry when Model Checking under Fairness Assumptions. In TOPLAS 19(4): 617-638 (1997).
13. Emerson, E. A. and Trefler, R. J., Model Checking Real-Time Properties of Symmetric Systems. In Mathematical Foundations of Computer Science, 23rd International Symposium LNCS 1450, Springer-Verlag, 1998.
14. Gyuris, V. and Sistla, A. P., On-the-Fly Model checking under Fairness that Exploits Symmetry. In Proceedings of the 9th International Conference on Computer Aided Verification, Haifa, Israel, 1997.
15. Haddad, S., Ilie, J. M., Taghelit, M. and Zouari, B., Symbolic Reachability Graph and Partial Symmetries. In Application and Theory of Petri Nets 1995, Springer-Verlag, LNCS 935, 1995.
16. Hennessy, M., Milner, R., Algebraic Laws for Nondeterminism and Concurrency. In Journal of the ACM, Vol 32, no. 1, January, 1985, pp 137-161.
17. Ip, C-W. N., Dill, D. L., Better Verification through Symmetry. In Formal Methods in System Design, Kluwer, vol. 9, no. 1/2, August 1996.
18. Jensen, K. and Rozenberg, G. (eds.), High-Level Petri Nets: Theory and Application, Springer- Verlag, 1991.
19. Kohavi, Zvi, Switching and Finite Automata Theory, second edition, McGraw- Hill Book Company, New York, 1978.
20. Lichtenstein, O., and Pnueli, A., Checking That Finite State Concurrent Programs Satisfy Their Linear Specifications, POPL85, pp. 97-107, Jan. 85.
21. Michel, F., Azema, P. and Vernadat, F., Permutable Agents in Process Algebra. In Tools and Algorithms for the Construction and Analysis of Systems, 96, Springer Verlag, LNCS 1055, 1996.
22. Milner, R., An Algebraic Definition of Simulations Between Programs. In Proceedings of the Second International Joint Conference on Artificial Intelligence, British Computer Society, 1971, pp 481-489.
23. McMillan, K. L., Symbolic Model Checking: An Approach to the State Explosion Problem, Ph.D. Thesis, Carnegie Mellon University, 1992.
24. Park, D., Concurrency and Automata on Infinite Sequences. In Theoretical Computer Science: 5th GI-Conference, Karlsruhe, Springer-Verlag, LNCS 104, pp 167-183, 1981.
25. Queille, J. P., and Sifakis, J., Specification and verification of concurrent programs in CESAR, Proc. 5th Int. Symp. Prog., Springer LNCS no. 137, pp. 195-220, 1982.