To Compose, or Not to Compose, That Is the Question: An Analysis of Compositional State Space Generation
- 882 Downloads
To combat state space explosion several compositional verification approaches have been proposed. One such approach is compositional aggregation, where a given system consisting of a number of parallel components is iteratively composed and minimised. Compositional aggregation has shown to perform better (in the size of the largest state space in memory at one time) than classical monolithic composition in a number of cases. However, there are also cases in which compositional aggregation performs much worse.
It is unclear when one should apply compositional aggregation in favor of other techniques and how it is affected by action hiding and the scale of the model.
This paper presents a descriptive analysis following the quantitiative experimental approach. The experiments were conducted in a controlled test bed setup in a computer laboratory environment. A total of eight scalable models with different network topologies considering a number of varying properties were investigated comprising 119 subjects. This makes it the most comprehensive study done so far on the topic. We investigate whether there is any systematic difference in the success of compositional aggregation based on the model, scaling, and action hiding. Our results indicate that both scaling up the model and hiding more behaviour has a positive influence on compositional aggregation.
The authors would like to thank Vrije Universiteit Amsterdam for their generosity in supplying the computing resources for the experiments.
- 1.Abd Elkader, K., Grumberg, O., Păsăreanu, C.S., Shoham, S.: Automated circular assume-guarantee reasoning with N-way decomposition and alphabet refinement. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9779, pp. 329–351. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-41528-4_18CrossRefGoogle Scholar
- 2.Andersen, H.: Partial model checking. In: LICS, pp. 398–407. IEEE Computer Society Press (1995)Google Scholar
- 4.ASCI: The Distributed ASCI Supercomputer DAS4. http://www.cs.vu.nl/das4/. Accessed 09-08-2017
- 9.Crouzen, P., Hermanns, H.: Aggregation ordering for massively compositional models. In: 10th International Conference on Application of Concurrency to System Design, pp. 171–180. IEEE (2010)Google Scholar
- 10.Fernandez, J.: ALDEBARAN: un système de vérification par réduction de processus communicants. (Aldebaran : a system of verification of communicating processes by using reduction). Ph.D. thesis, Joseph Fourier University, Grenoble, France (1988)Google Scholar
- 11.Garavel, H., Lang, F., Mateescu, R.: Compositional Verification of Asynchronous Concurrent Systems using CADP (extended version). Research Report RR-8708, INRIA Grenoble - Rhône-Alpes, Apr 2015. https://hal.inria.fr/hal-01138749
- 12.Garavel, H., Sighireanu, M.: A graphical parallel composition operator for process algebras. In: FORTE/PSTV 1999. IFIP Conference Proceedings, vol. 156, pp. 185–202. Kluwer (1999)Google Scholar
- 13.Garavel, H., Lang, F.: SVL: a scripting language for compositional verification. In: 21st International Conference on Formal Techniques for Networked and Distributed Systems, pp. 377–392. Kluwer, Boston, MA (2002)Google Scholar
- 18.Hintze, J., Nelson, R.: Violin plots: a box plot-density trace synergism. Am. Stat. 52(2), 181–184 (1998)Google Scholar
- 19.Jones, C.B.: Specification and design of (parallel) programs. In: IFIP Congress, vol. 83, pp. 321–332 (1983)Google Scholar
- 20.Keller, R.K., Cameron, M., Taylor, R.N., Troup, D.B.: User interface development and software environments: the Chiron-1 system. In: Proceedings of the 13th International Conference on Software Engineering, pp. 208–218. IEEE (1991)Google Scholar
- 23.Le Lann, G.: Distributed systems - towards a formal approach. In: IFIP Congress, pp. 155–160 (1977)Google Scholar
- 25.O’Leary, Z.: The Essential Guide to Doing Research. SAGE Publications, Thousand Oaks (2004)Google Scholar
- 32.Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice Hall PTR, Upper Saddle River (1997)Google Scholar
- 34.Tai, K.C., Koppol, P.V.: Hierarchy-based incremental analysis of communication protocols. In: 1993 International Conference on Network Protocols, pp. 318–325. IEEE (1993)Google Scholar
- 35.Tai, K.C., Koppol, P.V.: An incremental approach to reachability analysis of distributed programs. In: Proceedings of the 7th International Workshop on Software Specification and Design, pp. 141–150. IEEE Computer Society Press (1993)Google Scholar