A process algebra for timed systems
Information and Computation
Swarm intelligence: from natural to artificial systems
Swarm intelligence: from natural to artificial systems
Process algebra for performance evaluation
Theoretical Computer Science
Programming Pervasive and Mobile Computing Applications with the TOTA Middleware
PERCOM '04 Proceedings of the Second IEEE International Conference on Pervasive Computing and Communications (PerCom'04)
Formal modeling and quantitative analysis of KLAIM-based mobile systems
Proceedings of the 2005 ACM symposium on Applied computing
Continuous-Time Probabilistic KLAIM
Electronic Notes in Theoretical Computer Science (ENTCS)
ESOA'05 Proceedings of the Third international conference on Engineering Self-Organising Systems
Designing self-organising environments with agents and artefacts: a simulation-driven approach
International Journal of Agent-Oriented Software Engineering
Design Patterns for Self-organising Systems
CEEMAS '07 Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V
A framework for modelling and implementing self-organising coordination
Proceedings of the 2009 ACM symposium on Applied Computing
Using probabilistic model checking and simulation for designing self-organizing systems
Proceedings of the 2009 ACM symposium on Applied Computing
On the collective sort problem for distributed tuple spaces
Science of Computer Programming
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Self-organising pervasive ecosystems: a crowd evacuation example
SERENE'11 Proceedings of the Third international conference on Software engineering for resilient systems
| Hi-index | 0.00 |
Recent coordination languages and models are moving towards the application of techniques coming from the research context of complex systems: adaptivity and self-organization are exploited in order to tackle the openness, dynamism and unpredictability of today's distributed systems. In this area, systems are to be described using stochastic models, and simulation is a valuable tool both for analysis and design. Accordingly, in this work we focused on modelling and simulating emergent properties of coordination techniques. We first develop a framework acting as a general-purpose engine for simulating stochastic transition systems, built as a library for the Maude term rewriting system. We then evaluate this tool to a coordination problem called collective sort, where autonomous agents move tuples across different tuple spaces according to local criteria, and resulting in the emergence of the complete clustering property.