Advertisement

A Fixpoint-Based Calculus for Graph-Shaped Computational Fields

  • Alberto Lluch LafuenteEmail author
  • Michele Loreti
  • Ugo Montanari
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9037)

Abstract

Coordination is essential for dynamic distributed systems exhibiting autonomous behaviors. Spatially distributed, locally interacting, propagating computational fields are particularly appealing for allowing components to join and leave with little or no overhead. In our approach, the space topology is represented by a graph-shaped field, namely a network with attributes on both nodes and arcs, where arcs represent interaction capabilities between nodes. We propose a calculus where computation is strictly synchronous and corresponds to sequential computations of fixpoints in the graph-shaped field. Under some conditions, those fixpoints can be computed by synchronised iterations, where in each iteration the attributes of a node is updated based on the attributes of the neighbours in the previous iteration. Basic constructs are reminiscent of the semiring μ-calculus, a semiring-valued generalisation of the modal μ-calculus, which provides a flexible mechanism to specify the neighbourhood range (according to path formulae) and the way attributes should be combined (through semiring operators). Additional control-flow constructs allow one to conveniently structure the fixpoint computations. We illustrate our approach with a case study based on a disaster recovery scenario, implemented in a prototype simulator that we use to evaluate the performance of a disaster recovery strategy.

Keywords

Span Tree Distribute Hash Table Edge Label Disaster Recovery Tuple Space 
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.
    Beal, J., Bachrach, J.: Infrastructure for engineered emergence on sensor/actuator networks. IEEE Intelligent Systems 21, 10–19 (2006)CrossRefGoogle Scholar
  2. 2.
    Beal, J., Michel, O., Schultz, U.P.: Spatial computing: Distributed systems that take advantage of our geometric world. ACM Transactions on Autonomous and Adaptive Systems 6, 11:1–11:3 (2011)Google Scholar
  3. 3.
    Beal, J., Dulman, S., Usbeck, K., Viroli, M., Correll, N.: Organizing the aggregate: Languages for spatial computing. CoRR, abs/1202.5509 (2012)Google Scholar
  4. 4.
    Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint satisfaction and optimization. J. ACM 44(2), 201–236 (1997)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Canal, C., Villari, M. (eds.): ESOCC 2013. Communications in Computer and Information Science, vol. 393. Springer, Heidelberg (2013)Google Scholar
  6. 6.
    Kühn, E., Pugliese, R. (eds.): COORDINATION 2014. LNCS, vol. 8459. Springer, Heidelberg (2014)Google Scholar
  7. 7.
    Liò, P., Yoneki, E., Crowcroft, J., Verma, D.C. (eds.): BIOWIRE 2007. LNCS, vol. 5151. Springer, Heidelberg (2008)zbMATHGoogle Scholar
  8. 8.
    Lluch-Lafuente, A., Montanari, U.: Quantitative mu-calculus and CTL defined over constraint semirings. Theor. Comput. Sci. 346(1), 135–160 (2005)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Mamei, M., Zambonelli, F.: Programming pervasive and mobile computing applications: The TOTA approach. ACM Transactions on Software Engingeering and Methodology 18, 15:1–15:56 (2009)Google Scholar
  10. 10.
    Mamei, M., Zambonelli, F.: Field-based coordination for pervasive computing applications. In: Liò et al (eds.) [7], pp. 376–386Google Scholar
  11. 11.
    Montagna, S., Viroli, M., Fernandez-Marquez, J.L., Di Marzo Serugendo, G., Zambonelli, F.: Injecting self-organisation into pervasive service ecosystems. MONET 18(3), 398–412 (2013)Google Scholar
  12. 12.
    Nielson, H.R., Nielson, F.: Semantics with Applications: An Appetizer. Undergraduate Topics in Computer Science. Springer (2007)Google Scholar
  13. 13.
    Viroli, M., Casadei, M., Montagna, S., Zambonelli, F.: Spatial coordination of pervasive services through chemical-inspired tuple spaces. TAAS 6(2), 14 (2011)CrossRefGoogle Scholar
  14. 14.
    Viroli, M., Damiani, F.: A calculus of self-stabilising computational fields. In: Kühn, E., Pugliese (eds.) [6], pp. 163–178Google Scholar
  15. 15.
    Viroli, M., Damiani, F., Beal, J.: A calculus of computational fields. In: Canal, Villari (eds.) [5], pp. 114–128Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2015

Authors and Affiliations

  • Alberto Lluch Lafuente
    • 1
    Email author
  • Michele Loreti
    • 2
  • Ugo Montanari
    • 3
  1. 1.DTU ComputeTechnical University of DenmarkKgs. LyngbyDenmark
  2. 2.University of FlorenceFirenzeItaly
  3. 3.Computer Science DepartmentUniversity of PisaPisaItaly

Personalised recommendations