Modelling and analyzing adaptive self-assembly strategies with Maude

Bruni, Roberto; Corradini, Andrea; Gadducci, Fabio; Lafuente, Alberto Lluch; Vandin, Andrea

doi:10.1016/j.scico.2013.11.043

Cited by 19 publications

(13 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Rewriting logic [12] has been successfully used for more than two decades as a semantic framework wherein many different programming models and logics are naturally formalised, executed and analysed. Just by restricting to models for concurrency, there exist Maude specifications and tools for CCS [17], the π-calculus [16], Petri nets [15], Erlang [14], Klaim [18], adaptive systems [7], etc. A more comprehensive list of calculi, programming languages, tools and applications implemented in Maude is collected in [13].…”

Section: Discussionmentioning

confidence: 99%

Modelling and Verifying Contract-Oriented Systems in Maude

Bartoletti

Murgia

Scalas

et al. 2014

Rewriting Logic and Its Applications

View full text Add to dashboard Cite

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.

show abstract

Section: Discussionmentioning

confidence: 99%

Modelling and Verifying Contract-Oriented Systems in Maude

Bartoletti

Murgia

Scalas

et al. 2014

Rewriting Logic and Its Applications

View full text Add to dashboard Cite

show abstract

“…Self-assembly pada swarm robotics diaplikasikan untuk menyelesaikan masalah seperti membantu robot-robot memanjat rintangan yang tidak dapat dilakukan jika robot bekerja secara individual (Kuyucu, 2013;Li, 2016). Salah satu konsorsium di bidang swarm robotics mengaplikasikan self-assembly untuk menghindari lubang besar, menyeberangi celah, memanjat bukit, navigasi untuk segala medan, dan operasi penyelamatan (Mondada, 2004;O'Grady, 2012;Trianni, 2014;Bruni, 2015;Matthews, 2015). Sementara konsorsium yang lain mengaplikasikan self-assembly untuk pencarian sumber energi listrik jika swarm robot dilepas di lingkungan tanpa ada ada bantuan manusia (Kornienko, 2007;Meister, 2013;Levi, 2014;Vonásek, 2015).…”

Section: Pendahuluanunclassified

Strategi Self-Assembly Paralel pada Swarm Robot

Syafitri

2019

ELKOMIKA

View full text Add to dashboard Cite

ABSTRAKDari 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 ABSTRACTDespite 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 process

show abstract

“…A survey, including a broader view and also recent approaches, is presented in [24]. Formal methods are also applied to self-adaptive systems [22,5,20,6,34]. A quantitative survey [22] finds a relative low percent of formal methods papers from those dedicated to self-adaptive systems.…”

Section: Creation Of Competitive Environments For Testing Reconfigura...mentioning

confidence: 99%

Adaptive virtual organisms: A compositional model for complex hardware-software binding

Păduraru¹,

Ştefănescu²

2019

Preprint

View full text Add to dashboard Cite

The relation between a structure and the function running on that structure is of central interest in many fields, including computer science, biology (organ vs. function), psychology (body vs. mind), architecture (designs vs. functionality), etc. Our paper addresses this question with reference to computer science recent hardware and software advances, particularly in areas as robotics, AI-hardware, self-adaptive systems, IoT, CPS, etc.At the modeling, conceptual level, our main contribution is the introduction of the concept of "virtual organism" (VO), to populate the intermediary level between rigid, slightly reconfigurable, hardware agents and abstract, intelligent, adaptive software agents. A virtual organism has a structure, resembling the hardware capabilities, and it runs low-level functions, implementing the software requirements. Roughly speaking, it is an adaptive, reconfigurable, distributed, interactive, open system, consisting of a network of heterogeneous computing nodes, with a constrained structural shape, and running a bunch of overlapping functions. The model is compositional in space (allowing the virtual organisms to aggregate into larger organisms) and in time (allowing the virtual organisms to get composed functionalities).Technically, the virtual organisms studied here are in 2D (two dimensions) and their structures are described by regular 2D pattens; adding the time dimension, we conclude our VO model is in 3D (with 2D for space and 1D for time). By reconfiguration, an organism may change its structure to another structure belonging to the same 2D pattern. We illustrate the VO concept with three increasingly more complex VOs: (1) a tree collector organism (TC-organism); (2) a feeding cell * Parts of the results in this paper have been presented to the

show abstract

Modelling and analyzing adaptive self-assembly strategies with Maude

Cited by 19 publications

References 38 publications

Modelling and Verifying Contract-Oriented Systems in Maude

Modelling and Verifying Contract-Oriented Systems in Maude

Strategi Self-Assembly Paralel pada Swarm Robot

Adaptive virtual organisms: A compositional model for complex hardware-software binding

Contact Info

Product

Resources

About