Advertisement

FSP Modeling of a Generic Distributed Swarm Computing Framework

  • Amelia Bădică
  • Costin BădicăEmail author
  • Marius Brezovan
Conference paper
Part of the Studies in Computational Intelligence book series (SCI, volume 616)

Abstract

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.

Keywords

Operational Semantic Linear Temporal Logic Virtual Space Parallel Composition Label Transition System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Ben-Ari, M.: Principles of the Spin Model Checker. Springer, Berlin (2008)zbMATHGoogle Scholar
  2. 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
  3. 3.
    Bădică, A., Bădică, C.: FSP and FLTL framework for specification and verification of middle-agents. Appl. Math. Comput. Sci. 21(1), 9–25 (2011)zbMATHGoogle Scholar
  4. 4.
    Coulouris, G., Dollimore, J., Kindberg, T., Blair, G.: Distributed Systems. Concepts and Design, 5th edn. Addison Wesley, London (2011)zbMATHGoogle Scholar
  5. 5.
    Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)zbMATHGoogle Scholar
  6. 6.
    Ilie, S., Bădică, C.: Multi-agent approach to distributed ant colony optimization. Sci. Comput. Program. 78(6), 762–774 (2013)CrossRefGoogle Scholar
  7. 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
  8. 8.
    Magee, J., Kramer, J.: Concurrency. State Models and Java Programs. World Wide Series in Computer Science, 2nd edn. Wiley, New York (2006)zbMATHGoogle Scholar
  9. 9.
    Pedemonte, M., Nesmachnow, S., Cancela, H.: A survey on parallel ant colony optimization. Appl. Soft. Comput. 11(8), 5181–5197 (2011)CrossRefGoogle Scholar
  10. 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

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Amelia Bădică
    • 1
  • Costin Bădică
    • 1
    Email author
  • Marius Brezovan
    • 1
  1. 1.University of CraiovaCraiovaRomania

Personalised recommendations