Symmetric Spin

  • Dragan Bošnački
  • Dennis Dams
  • Leszek Holenderski
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1885)


We give a detailed description of SymmSpin, a symmetry-reduction package for Spin. It offers four strategies for state-space reduction, based on the heuristic that we presented in [3], and a fifth mode for reference. A series of new experiments is described, underlining the effectiveness of the heuristic and demonstrating the generalisation of the implementation to multiple scalar sets, multiple process families, as well as almost the full Promela language.


State Vector Model Check Symmetry Reduction Exploration Algorithm Canonical Representative 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    AdjustPan script (April 2000),
  2. 2.
    Bošnački, D., Dams, D.: Integrating real time into Spin: a prototype implementation. In: Budkowski, S., Cavalli, A., Najm, E. (eds.) Proc. of FORTE/PSTV 1998 (Formal Description Techniques and Protocol Specification, Testing and Verification), Paris, France, October 1998, pp. 423–438 (1998)Google Scholar
  3. 3.
    Bošnački, D., Dams, D., Holenderski, L.: A Heuristic for Symmetry Reductions with Scalarsets. In: FORTE 2000 (The 13th Int. Conf. on Formal Description Techniques for Distributed Systems and Communication Protocols) (2000) (submitted to)Google Scholar
  4. 4.
    Clarke, E.M., Enders, R., Filkorn, T., Jha, S.: Exploiting symmetry in temporal logic model checking. Formal Methods in System Design 19, 77–104 (1996)CrossRefGoogle Scholar
  5. 5.
    Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (2000)Google Scholar
  6. 6.
    Dravapoulos, I., Pronios, N., Denazis, S., et al.: The Magic WAND, Deliverable 3D2, Wireless ATM MAC (September 1997)Google Scholar
  7. 7.
    Emerson, E.A.: Temporal and modal logic. In: van Leeuwen, J. (ed.) Formal Models and Semantic. Handbook of Theoretical Computer Science, vol. B, ch.16, pp. 995–1072. Elsevier/The MIT Press (1990)Google Scholar
  8. 8.
    Emerson, E.A., Jha, S., Peled, D.: Combining partial order and symmetry reduc- tions. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol. 1217, pp. 19–34. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  9. 9.
    Emerson, E.A., Sistla, A.P.: Symmetry and model checking. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 463–478. Springer, Heidelberg (1993)Google Scholar
  10. 10.
    Emerson, E.A., Trefler, R.J.: Model checking real-time properties of symmetric systems. In: Proc. of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS), August 1998, pp. 427–436 (1998)Google Scholar
  11. 11.
    Emerson, E.A., Trefler, R.J.: From asymmetry to full symmetry: new techniques for symmetry reduction in model checking. In: Pierre, L., Kropf, T. (eds.) CHARME 1999. LNCS, vol. 1703, pp. 142–157. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  12. 12.
    Emerson, E.A., Sistla, A.P.: Utilizing symmetry when model-checking under fai- rness assumptions: an automata-theoretic approach. ACM Transactions on Pro- gramming Languages and Systems 19(4), 617–638 (1997)CrossRefGoogle Scholar
  13. 13.
    Feijen, W.H.J., van Gasteren, A.J.M.: On a method of multiprogramming. Springer, Heidelberg (1999)zbMATHGoogle Scholar
  14. 14.
    Godefroid, P.: Exploiting symmetry when model-checking software. In: Proc. of FORTE/PSTV 1999 (Formal Methods for Protocol Engineering and Distributed Sy- stems), Beijing, October 1999, pp. 257–275 (1999)Google Scholar
  15. 15.
    Gyuris, V., Sistla, A.P.: On-the fly model checking under fairness that exploits symmetry. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 232–243. Springer, Heidelberg (1997)Google Scholar
  16. 16.
    Holzmann, G.J.: Design and Validation of Communication Protocols, Prentice Hall (1991), Also:
  17. 17.
    Ip, C.N., Dill, D.L.: Better verification through symmetry. In: Agnew, D., Cla- esen, L.C., Camposano, R. (eds.) Proc. of the 1993 Conference on Computer Hardware Description Languages and their Applications (April 1993)Google Scholar
  18. 18.
    Ip, C.N., Dill, D.L.: Better verification through symmetry. Formal Methods in System Design 9, 41–75 (1996)CrossRefGoogle Scholar
  19. 19.
    Ip, C.N.: State Reduction Methods for Automatic Formal Verification, PhD thesis, Department of Computer Science of Stanford University (December 1996)Google Scholar
  20. 20.
    Lipskiy, V.: Kombinatorika dlya programmistov, Mir, Moscow, (1988) (in Russian)Google Scholar
  21. 21.
    Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco (1996)zbMATHGoogle Scholar
  22. 22.
    Nalumasu, R., Gopalakrishnan, G.: Explicit-enumeration based Verification made Memory-efficient. In: Proc. of CHDL 1995 (Computer Hardware Description Languages), Chiba, Japan, August 1995, pp. 617–622 (1995)Google Scholar
  23. 23.
    Valmari, A.: Stubborn sets for reduced state space generation. In: Rozenberg, G. (ed.) APN 1990. LNCS, vol. 483, pp. 491–515. Springer, Heidelberg (1991)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Dragan Bošnački
    • 1
  • Dennis Dams
    • 2
  • Leszek Holenderski
    • 1
  1. 1.Dept. of Computing Sci.Eindhoven University of TechnologyEindhovenThe Netherlands
  2. 2.Dept. of Electrical Eng.Eindhoven University of TechnologyEindhovenThe Netherlands

Personalised recommendations