Typical Structural Properties of State Spaces

Explicit model checking algorithms explore the full state space of a system. We have gathered a large collection of state spaces and performed an extensive study of their structural properties. The results show that state spaces have several typical properties and that they differ significantly from both random graphs and regular graphs. We point out how to exploit these typical properties in practical model checking algorithms.

[1]  Kavita Ravi,et al.  A Comparative Study of Symbolic Algorithms for the Computation of Fair Cycles , 2000, FMCAD.

[2]  George S. Avrunin,et al.  Benchmarking finite-state verifiers , 2000, International Journal on Software Tools for Technology Transfer.

[3]  Ivana Cerná,et al.  Distributed Explicit Fair Cycle Detection (Set Based Approach) , 2003, SPIN.

[4]  A. Cheng,et al.  Model Checking Coloured Petri Nets - Exploiting Strongly Connected Components , 1997 .

[5]  Gerard J. Holzmann,et al.  The SPIN Model Checker , 2003 .

[6]  Theo C. Ruys.  Low-Fat Recipes for SPIN , 2000, SPIN.

[7]  Enrico Tronci,et al.  Exploiting Transition Locality in the Disk Based Mur phi Verifier , 2002, FMCAD.

[8]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.

[9]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[10]  Wang Yi,et al.  Unification & Sharing in Timed Automata Verification , 2003, SPIN.

[11]  George J. Milne,et al.  Correct Hardware Design and Verification Methods , 2003, Lecture Notes in Computer Science.

[12]  Gerard J. Holzmann.  An analysis of bitstate hashing , 1995 .

[13]  Shin Nakajima,et al.  The SPIN Model Checker : Primer and Reference Manual , 2004 .

[14]  U. Stern,et al.  Using Magnatic Disk Instead of Main Memory in the Murphi Verifier , 1998, CAV.

[15]  Alan J. Hu,et al.  Protocol verification as a hardware design aid , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[16]  Enrico Tronci,et al.  A probabilistic approach to automatic verification of concurrent systems , 2001, Proceedings Eighth Asia-Pacific Software Engineering Conference.

[17]  Jan Friso Groote,et al.  Large State Space Visualization , 2003, TACAS.

[18]  Kim G. Larsen,et al.  To Store or Not to Store , 2003, CAV.

[19]  Kathi Fisler,et al.  Is There a Best Symbolic Cycle-Detection Algorithm? , 2001, TACAS.

[20]  Gerard J. Holzmann,et al.  State Compression in SPIN: Recursive Indexing and Compression Training Runs , 2002 .

[21]  Gerard J. Holzmann,et al.  The Engineering of a Model Checker: The Gnu i-Protocol Case Study Revisited , 1999, SPIN.

[22]  Klaus Havelund,et al.  SPIN Model Checking and Software Verification , 2000, Lecture Notes in Computer Science.

[23]  Kavita Ravi,et al.  Analysis of Symbolic SCC Hull Algorithms , 2002, FMCAD.

[24]  Radek Pelánek,et al.  Distributed Explicit Fair Cycle Detection , 2003 .

[25]  Lubos Brim,et al.  Parallel breadth-first search LTL model-checking , 2003, 18th IEEE International Conference on Automated Software Engineering, 2003. Proceedings..

[26]  Gerard J. Holzmann.  Algorithms for automated protocol verification , 1990, AT&T Technical Journal.

[27]  Duncan J. Watts,et al.  Six Degrees: The Science of a Connected Age , 2003 .

[28]  Mieke Massink,et al.  Theoretical and Practical Aspects of SPIN Model Checking , 1999, Lecture Notes in Computer Science.

[29]  Ulrich Stern,et al.  Algorithmic techniques in verification by explicit state enumeration , 1997 .

[30]  Albert-László Barabási,et al.  Linked - how everything is connected to everything else and what it means for business, science, and everyday life , 2003 .

[31]  Gerard J. Holzmann,et al.  State-space caching revisited , 1995, Formal Methods Syst. Des..

[32]  Radu Mateescu,et al.  An overview of CADP 2001 , 2001 .

[33]  Paul Erdös,et al.  On random graphs, I , 1959 .

[34]  Lars Michael Kristensen,et al.  A Sweep-Line Method for State Space Exploration , 2001, TACAS.

[35]  Jan Friso Groote,et al.  The Syntax and Semantics of μCRL , 1995 .

[36]  Enrico Tronci,et al.  Exploiting Transition Locality in Automatic Verification , 2001, CHARME.