FSP Modeling of a Generic Distributed Swarm Computing Framework
Swarm computing emerged as a computing paradigm for solving complex optimization problems using a nature-inspired approach. A swarm of particles populates a virtual space that mimics the physical environment. Virtual particles modeled as computational objects are behaving in the virtual space according to the laws of nature, seeking to solve a mathematical optimization problem. In this paper we propose a formal model of a generic distributed framework for swarm computing based on Finite State Process algebra. The model is simple, clear and technology-independent, and it can serve as a basis for concurrent or distributed implementation using available software technologies.
KeywordsOperational Semantic Linear Temporal Logic Virtual Space Parallel Composition Label Transition System
- 2.Bădică, A., Bădică, C.: Specification and verification of an agent-based auction service. In: Papadopoulos, G.A., Wojtkowski, W., Wojtkowski, G., Wrycza, S., Zupancic, J. (eds.) Information Systems Development, pp. 239–248. Springer, New York (2010)Google Scholar
- 7.Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, ICNN’1995, vol. 4, pp. 1942–1948. IEEE (1995)Google Scholar
- 10.Petcu, D.: Parallel explicit state reachability analysis and state space construction. In: Proceedings of the Second International Symposium on Parallel and Distributed Computing, ISPDC’2003, Ljubljana, Slovenia, pp. 207–214. IEEE (2002)Google Scholar