Simulating Emergent Properties of Coordination in Maude: the Collective Sort Case

Casadei, Matteo; Gardelli, Luca; Viroli, Mirko

doi:10.1016/j.entcs.2007.05.022

Cited by 16 publications

(11 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, there is work on formalizing different aspects of ODP [154,[166][167][168]350,402], SOAP [13], CORBA [14], and the SMEPP P2P middleware [153]. Similarly, work on formal models of coordination includes [85,86,441,444]. Closely related to coordination models is work on formal models of distributed object reflection and adaptation [88,134,261,338,441].…”

Section: Network Distributed Architectures Middleware and Coordinamentioning

confidence: 99%

Twenty years of rewriting logic

Meseguer

2012

The Journal of Logic and Algebraic Programming

164

View full text Add to dashboard Cite

Rewriting logic is a simple computational logic that can naturally express both concurrent computation and logical deduction with great generality. This paper provides a gentle, intuitive introduction to its main ideas, as well as a survey of the work that many researchers have carried out over the last twenty years in advancing: (i) its foundations; (ii) its semantic framework and logical framework uses; (iii) its language implementations and its formal tools; and (iv) its many applications to automated deduction, software and hardware specification and verification, security, real-time and cyber-physical systems, probabilistic systems, bioinformatics and chemical systems.

show abstract

Section: Network Distributed Architectures Middleware and Coordinamentioning

confidence: 99%

Twenty years of rewriting logic

Meseguer

2012

The Journal of Logic and Algebraic Programming

164

View full text Add to dashboard Cite

show abstract

“…The SwarmLinda distribution mechanism is designed and simulated by using an executable specification based on the stochastic simulation framework defined in [15]. Using this specification, we executed many experiments on the network of 14 tuple spaces shown in Figure 1-a scale-free topology [16].…”

Section: Swarmlinda Distribution Mechanismmentioning

confidence: 99%

Self-organized over-clustering avoidance in tuple-space systems

Casadei¹,

Menezes

Viroli

et al. 2007

2007 IEEE Congress on Evolutionary Computation

Self Cite

View full text Add to dashboard Cite

When it comes to communication performance, open distributed tuple-space systems depend heavily on the proximity of tuples to processes. Researchers have proposed many approaches for storing tuples in a way that processes benefit from the organization of tuples. Although some progress has been made, most of the proposed solutions fail to address the reverse problem: if most tuples are kept near the processes, the system's robustness is affected; the over-clustering of tuples in particular nodes creates a dependence to that particular node. Hence, we have a dichotomy where it is important to organize tuples in clusters near the processes, but it is equally important to avoid over-clustering. The ideal is to have a balance where tuples are clustered but not totally concentrated in very few tuple spaces (eg. one or two). This paper presents a selforganized solution to the tuple distribution problem, in which the possibility of over-clustering is considered.

show abstract

“…A source LSA is used for gradient sources: type indicates the type of gradient (fire, exit, and so on); max is the maximum value the gradient can assume; and ann is the annealing factor [4]-its purpose will be described later, along with eco-laws. A gradient LSA is used for individual values in a gradient: value indicates the individual value; and the other parameters are like in the source LSAs.…”

Section: Types Of Lsas In the Systemmentioning

confidence: 99%

Self-organising Pervasive Ecosystems: A Crowd Evacuation Example

Montagna

Viroli

Risoldi

et al. 2011

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. The dynamics of pervasive ecosystems are typically highly unpredictable, and therefore self-organising approaches are often exploited to make their applications resilient to changes and failures. The SAPERE approach we illustrate in this paper aims at addressing this issue by taking inspiration from natural ecosystems, which are regulated by a limited set of "laws" evolving the population of individuals in a self-organising way. Analogously, in our approach, a set of so-called eco-laws coordinate the individuals of the pervasive computing system (humans, devices, signals), in a way that is shown to be expressive enough to model and implement interesting real-life scenarios. We exemplify the proposed framework discussing a crowd evacuation application, tuning and validating it by simulation.

show abstract

Simulating Emergent Properties of Coordination in Maude: the Collective Sort Case

Cited by 16 publications

References 12 publications

Twenty years of rewriting logic

Twenty years of rewriting logic

Self-organized over-clustering avoidance in tuple-space systems

Self-organising Pervasive Ecosystems: A Crowd Evacuation Example

Contact Info

Product

Resources

About