DISTRIBUTOR and BCG_MERGE: Tools for Distributed Explicit State Space Generation
The explicit-state verification of complex concurrent systems, whose underlying state spaces may be prohibitively large, requires an important amount of memory and computation time. Although explicit state space generation is known to be exponential as the number of concurrent processes in the system increases, it is tempting to push forward the capabilities of verification tools by exploiting the computing resources (memory and processors) of massively parallel machines, such as clusters and grids.
- 2.Garavel, H., Lang, F., Mateescu, R.: An Overview of CADP 2001. European Association for Software Science and Technology (EASST) Newsletter 4, 13–24 (2002)Google Scholar
- 5.Joubert, C., Mateescu, R.: Distributed On-the-Fly Equivalence Checking. In: Proc. of PDMC 2004. ENTCS, vol. 128 (2004)Google Scholar
- 6.Mateescu, R.: On-the-fly State Space Reductions for Weak Equivalences. In: Proc. of FMICS 2005, pp. 80–89. ACM Press, New York (2005)Google Scholar
- 7.Vasy. Bcg Merge Manual Page (December 2004), http://www.inrialpes.fr/vasy/cadp/man/bcgmerge.html
- 8.Vasy. Distributor Manual Page (December 2004), http://www.inrialpes.fr/vasy/cadp/man/distributor.html
- 9.Vasy and Sen2. The Vlts benchmark suite (March 2003), http://www.inrialpes.fr/vasy/cadp/resources/benchmarkbcg.html