Awareness and Control in Adaptable Transition Systems

The talk presents ATSs and some applications, and it introduces an explicit representation of awareness data, ideally intended as those “sensor” data that are exploited at the control level in order to possibly enforce an adaptation. Awareness and control data complement each other in answering the question regarding where and when adaptation takes places: A clear identification of awareness data helps selecting which artifacts indicate that it may be necessary to perform an adaptation, and precisely stating when that may occur

MultiVeStA: Statistical Model Checking for Discrete Event Simulators

The modeling, analysis and performance evaluation of large-scale systems are difficult tasks. Due to the size and complexity of the considered systems, an approach typically followed by engineers consists in performing simulations of systems models to obtain statistical estimations of quantitative properties. Similarly, a technique used by computer scientists working on quantitative analysis is Statistical Model Checking (SMC), where rigorous mathematical languages (typically logics) are used to express systems properties of interest. Such properties can then be automatically estimated by tools performing simulations of the model at hand. These property specifications languages, often not popular among engineers, provide a formal, compact and elegant way to express systems properties without needing to hard-code them in the model definition. This paper presents MultiVeStA, a statistical analysis tool which can be easily integrated with existing discrete event simulators, enriching them with efficient distributed statistical analysis and SMC capabilities

Strategi Self-Assembly Paralel pada Swarm Robot

ABSTRAK Dari banyaknya strategi yang diusulkan untuk proses self-assembly pada swarm robotics, hanya beberapa grup riset berkonsentrasi di bidang ini yang mengusulkan proses paralel pada penggabungan antar robot. Tetapi, strategi ini hanya digunakan ketika sebuah robot memerlukan tumpuan dari dua robot atau lebih pada satu waktu. Berdasar pada kebutuhan untuk menyebarkan ratusan hingga ribuan robot pada satu swarm, strategi penggabungan antar robot satu-demi-satu memerlukan waktu yang sangat lama untuk diselesaikan. Di artikel ini, strategi self-assembly antar robot pada suatu swarm secara paralel diusulkan untuk mengurangi waktu proses self-assembly dengan menempatkan sejumlah robot di posisi tertentu. Saat penggabungan, robot-robot ini akan bergerak menempatkan dirinya sesuai dengan posisi akhir yang ditargetkan. Hasil menunjukkan bahwa strategi ini dapat mereduksi waktu proses self-assembly hingga setengah dari waktu yang diperlukan dengan proses penggabungan satu-demi-satu. Kata kunci: swarm robot, self-assembly, proses paralel   ABSTRACT Despite the number of strategies proposed for self-assembly process in swarm robotics, only few research groups working in this area have proposed the parallel process of robots assembled each other. However, this strategy only works when a robot needs to be supported by two or more robots in a time. When deploying hundred to thousand robots in a swarm is required, the strategy of robots connecting to the structure of assembled robots in a one-by-one manner requires an extremely long time to accomplish. In this paper, a strategy of parallel selfassembly for robots in a swarm is proposed for reducing the self-assembly process time by placing a number of robots at particular positions. While connecting, they will move to position themselves appropriately to the targeted final structure. Result shows that this strategy can reduce the process of self-assembly time up to half of the time required for one-by-one process. Keywords: swarm robots, self-assembly, parallel proces

Modelling and verifying contract-oriented systems in Maude

We address the problem of modelling and verifying contractoriented systems, wherein distributed agents may advertise and stipulate contracts, but — differently from most other approaches to distributed agents — are not assumed to always behave “honestly”. We describe an executable specification in Maude of the semantics of CO2, a calculus for contract-oriented systems [6]. The honesty property [5] characterises those agents which always respect their contracts, in all possible execution contexts. Since there is an infinite number of such contexts, honesty cannot be directly verified by model-checking the state space of an agent (indeed, honesty is an undecidable property in general [5]). The main contribution of this paper is a sound verification technique for honesty. To do that, we safely over-approximate the honesty property by abstracting from the actual contexts a process may be engaged with. Then, we develop a model-checking technique for this abstraction, we describe an implementation in Maude, and we discuss some experiments with it

Modelling and analyzing adaptive self-assembling strategies with Maude

Building adaptive systems with predictable emergent behavior is a challenging task and it is becoming a critical need. The research community has accepted the challenge by introducing approaches of various nature: from software architectures, to programming paradigms, to analysis techniques. We recently proposed a conceptual framework for adaptation centered around the role of control data. In this paper we show that it can be naturally realized in a reflective logical language like Maude by using the Reflective Russian Dolls model. Moreover, we exploit this model to specify, validate and analyse a prominent example of adaptive system: robot swarms equipped with self-assembly strategies. The analysis exploits the statistical model checker PVeStA

Modelling and analyzing adaptive self-assembling strategies with Maude

Building adaptive systems with predictable emergent behavior is a challenging task and it is becoming a critical need. The research community has accepted the challenge by introducing approaches of various nature: from software architectures, to programming paradigms, to analysis techniques. We recently proposed a conceptual framework for adaptation centered around the role of control data. In this paper we show that it can be naturally realized in a reflective logical language like Maude by using the Reflective Russian Dolls model. Moreover, we exploit this model to specify, validate and analyse a prominent example of adaptive system: robot swarms equipped with self-assembly strategies. The analysis exploits the statistical model checker PVeStA

A Conceptual Framework for Adapation

This paper presents a white-box conceptual framework for adaptation that promotes a neat separation of the adaptation logic from the application logic through a clear identification of control data and their role in the adaptation logic. The framework provides an original perspective from which we survey archetypal approaches to (self-)adaptation ranging from programming languages and paradigms, to computational models, to engineering solutions

A Conceptual Framework for Adapation

We present a white-box conceptual framework for adaptation. We called it CODA, for COntrol Data Adaptation, since it is based on the notion of control data. CODA promotes a neat separation between application and adaptation logic through a clear identification of the set of data that is relevant for the latter. The framework provides an original perspective from which we survey a representative set of approaches to adaptation ranging from programming languages and paradigms, to computational models and architectural solutions

A Conceptual Framework for Adapation

This paper presents a white-box conceptual framework for adaptation that promotes a neat separation of the adaptation logic from the application logic through a clear identification of control data and their role in the adaptation logic. The framework provides an original perspective from which we survey archetypal approaches to (self-)adaptation ranging from programming languages and paradigms, to computational models, to engineering solutions