Abstract
We present four versions of a new heuristic for coping with the problem of finding (canonical) representatives of symmetry equivalence classes (the so-called orbit problem), in symmetry techniques for model checking. The practical implementation of such techniques hinges on appropriate workarounds of this hard problem, which is equivalent to graph isomorphism. We implemented the four strategies on top of the Spin model checker, and compared their performance on several examples, with encouraging results.
This research has been supported by the VIRES project (Verifying Industrial Reactive Systems, Esprit Long Term Research Project #23498).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Bošsnački, Enhancing State Space Reduction Techniques for Model Checking, Ph.D. Thesis, Department of Computer Science, Eindhoven University of Technology, expected in 2001.
D. Bošnački, D. Dams, Integrating real time into Spin: a prototype implementation, in S. Budkowski, A. Cavalli, E. Najm (eds), Proc. of FORTE/PSTV’98 (Formal Description Techniques and Protocol Specification, Testing and Verification), pp. 423–438, Paris, France, 1998.
D. Bošnački, D. Dams, L. Holenderski, Symmetric Spin, SPIN’2000 (The 7th International SPIN Workshop on Model Checking of Software), pp. 1–19, LNCS 1885, 2000.
E.M. Clarke, R. Enders, T. Filkorn, S. Jha, Exploiting symmetry in temporal logic model checking, Formal Methods in System Design, Vol. 19, pp. 77–104, 1996.
E.M. Clarke, O. Grumberg, D.A. Peled, Model Checking, The MIT Press, 2000.
C. Courcoubetis, M. Vardi, P. Wolper, M. Yannakakis, Memory eficient algorithm for the verification of temporal properties, Formal Methods in System Design I, pp. 275–288, 1992.
I. Dravapoulos, N. Pronios, S. Denazis et al, The Magic WAND, Deliverable 3D2, Wireless ATM MAC, Sep 1997.
E.A. Emerson, Temporal and modal logic, in Jan van Leeuwen (ed.), Formal Models and Semantic, Vol. B of Handbook of Theoretical Computer Science, Chap. 16, pp. 995–1072, Elsevier/The MIT Press, 1990.
E.A. Emerson, S. Jha, D. Peled, Combining partial order and symmetry reductions, in Ed Brinksma (ed.), Proc. of TACAS’97 (Tools and Algorithms for the Construction and Analysis of Systems), LNCS 1217, pp. 19–34, Springer, 1997.
E.A. Emerson, A.P. Sistla, Symmetry and model checking, in C. Courcoubetis (ed.), Proc. of CAV’93 (Computer Aided Verification), LNCS 697, pp. 463–478, Springer, 1993.
E.A. Emerson, R.J. Trefler, Model checking real-time properties of symmetric systems, Proc. of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS), pp. 427–436, Aug. 1998.
E.A. Emerson, R.J. Trefler, From asymmetry to full symmetry: new techniques for symmetry reduction in model checking, Proc. of CHARME’99 (The 10th IFIP WG10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods), Bad Herrenalb, Germany, Sep. 1999.
E.A. Emerson, A.P. Sistla, Utilizing symmetry when model-checking under fairness assumptions: an automata-theoretic approach, ACM Transactions on Pro-gramming Languages and Systems, 19(4):617–638, July 1997.
P. Godefroid, Exploiting symmetry when model-checking software, Proc. of FORTE/PSTV’99 (Formal Methods for Protocol Engineering and Distributed Systems), pp. 257–275, Beijing, Oct. 1999.
V. Gyuris, A.P. Sistla, On-the-fly model checking under fairness that exploits symmetry, in O. Grumberg (ed.), Proc. of CAV’97 (Computer Aided Verification), LNCS 1254, pp. 232–243, Springer, 1997.
G.J. Holzmann, Design and Validation of Communication Protocols, Prentice Hall, 1991. Also: http://netlib.bell-labs.com/netlib/spin/whatispin.html
VEfication through symmetry, in D. Agnew, L. Claesen, R. Camposano (eds), Proc. of the 1993 Conference on Computer Hardware Description Languages and their Applications, Apr. 1993.
C.N. Ip, D.L. Dill, Better verification through symmetry. Formal Methods in System Design, Vol. 9, pp. 41–75, 1996.
C.N. Ip, State Reduction Methods for Automatic Formal Verification, Ph.D. thesis, Department of Computer Science of Stanford University, Dec 1996.
N.A. Lynch, Distributed Algorithms, Morgan Kaufmann Publishers, 1996.
R. Nalumasu, G. Gopalakrishnan, Explicit-enumeration based Verification made Memory-eficient, Proc. of CHDL’95 (Computer Hardware Description Languages), 617–622, Chiba, Japan, Aug. 1995.
A. Valmari, Stubborn sets for reduced state space generation, Advances in Petri Nets 1990, LNCS 483, pp. 491–515, Springer, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlag Berlin Heidelberg
About this paper
Cite this paper
Bošnački, D., Holenderski, L., Dams, D. (2001). A Heuristic for Symmetry Reductions with Scalarsets. In: Oliveira, J.N., Zave, P. (eds) FME 2001: Formal Methods for Increasing Software Productivity. FME 2001. Lecture Notes in Computer Science, vol 2021. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45251-6_30
Download citation
DOI: https://doi.org/10.1007/3-540-45251-6_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41791-0
Online ISBN: 978-3-540-45251-5
eBook Packages: Springer Book Archive