Performance-Analyse und -Optimierung in der Softwareentwicklung

Nicht-funktionale Anforderungen an ein Softwaresystem beschreiben Aspekte, die nicht direkt die Funktionalit?t, wie sie der Benutzer sieht, betreffen.     

Agens Faber: Toward a Theory of Artefacts for MAS

Human intelligence has evolved along with the use of more and more sophisticated tools, allowing Homo Faber (from Homo Habilis to Homo Sapiens Sapiens) to cope with environment changes, as well as to adapt the environment to his needs. Analogously, in this seminal paper we introduce the notion of Agens Faber, conveying the idea that agent intelligence should not be considered as separated by the agent ability to perceive and affect the environment—and so, that agent intelligence is strictly related to the artefacts that enable, mediate and govern any agent (intelligent) activity.

Along this line, we first discuss the notion of artefact for MAS in general, then we try to devise out the admissible / required / desirable features of an artefact for MAS. We elaborate on the many sorts of possible relations between agents and artefacts, focusing in particular on the issue of the rational exploitation of artefacts, and also rough out a possible taxonomy of artefacts for MAS.     

Qualitative analysis of motion properties of semistate models of large-scale systems

This paper studies the behavior of motions of large-scale (LS) semistate systems (SSS) governed byP _i (t)x _i =M _i (t,x _i )x _i +f _i (t)+h _i (t, x), i=1,2,...,s, =(x ₁ ^T x ₂ ^T x _s ^T )^T, where matricesP _i (t) are singular. Using Lyapunov's approach and the tools for LS system analysis, a variant of attractivity and ultimate boundedness of appropriate time-variable sets are investigated. The results are based on a specific choice of the aggregate functions. It is assumed that the reduction of equations to a normal form of lower order is inconvenient. The aggregation-decomposition approach used in this paper reduces the dimensionality of an aggregate matrix of the system to the number of its systems. Motion properties of LS systems are deduced from the properties of its isolated subsystems, the character of interconnections, and the conditions imposed on the system aggregate matrix. Sufficient algebraic conditions for the above-mentioned motion properties are developed.     

meSAT: multiple encodings of CSP to SAT

One approach for solving Constraint Satisfaction Problems (CSP) (and related Constraint Optimization Problems (COP)) involving integer and Boolean variables is reduction to propositional satisfiability problem (SAT). A number of encodings (e.g., direct, log, support, order) for this purpose exist as well as specific encodings for some constraints that are often encountered (e.g., cardinality constraints, global constraints). However, there is no single encoding that performs well on all classes of problems and there is a need for a system that supports multiple encodings. We present a system that translates specifications of finite linear CSP problems into SAT instances using several well-known encodings, and their combinations. We also present a methodology for selecting a suitable encoding based on simple syntactic features of the input CSP instance. Thorough evaluation has been performed on large publicly available corpora and our encoding selection method improves upon the efficiency of existing encodings and state-of-the-art tools used in comparison.     

Modification of Iron with Degradable Silver Phases Processed via Laser Beam Melting for Implants with Adapted Degradation Rate

In medical technology, implants are used to improve the quality of patients’ lives. The development of materials with adapted properties can further increase the benefit of implants. If implants are only needed temporarily, biodegradable materials are beneficial. In this context, iron-based materials are promising due to their biocompatibility and mechanical properties, but the degradation rate needs to be accelerated. Apart from alloying, the creation of noble phases to cause anodic dissolution of the iron-based matrix is promising. Due to its high electrochemical potential, immiscibility with iron, biocompatibility, and antibacterial properties, silver is suited for the creation of such phases. A suitable technology for processing immiscible material combinations is powder-bed-based procedure like laser beam melting. This procedure offers short exposure times to high temperatures and therefore a limited time for diffusion of alloying elements. As the silver phases remain after the dissolution of the iron matrix, a modification is needed to ensure their degradability. Following this strategy, pure iron with 5 wt% of a degradable silver–calcium–lanthanum alloy is processed via laser beam melting. Investigation of the microstructure yields achievement of the intended microstructure and long-term degradation tests indicates an impact on the degradation, but no increased degradation rate.     

On the collective sort problem for distributed tuple spaces

In systems coordinated with a distributed set of tuple spaces, it is crucial to assist agents in retrieving the tuples they are interested in. This can be achieved by sorting techniques that group similar tuples together in the same tuple space, so that the position of a tuple can be inferred by similarity. Accordingly, we formulate the collective sort problem for distributed tuple spaces, where a set of agents is in charge of moving tuples up to a complete sort has been reached, namely, each of the N tuple spaces aggregate tuples belonging to one of the N kinds available. After pointing out the requirements for effectively tackling this problem, we propose a self-organizing solution resembling brood sorting performed by ants. This is based on simple agents that perform partial observations and accordingly take decisions on tuple movement. Convergence is addressed by a fully adaptive method for simulated annealing, based on noise tuples inserted and removed by agents on a need basis so as to avoid sub-optimal sorting. Emergence of sorting properties and scalability are evaluated through stochastic simulations.     

ReSpecT Nets: Towards an Analysis Methodology for ReSpecT Specifications

A key feature for infrastructures providing coordination services is the ability to define the behaviour of coordination abstractions according to the requirements identified at design-time. We take as a representative for this scenario the logic-based language ReSpecT (Reaction Specification Tuples), used to program the reactive behaviour of tuple centres. ReSpecT specifications are at the core of the engineering methodology underlying the TuCSoN infrastructure, and are therefore the “conceptual place” where formal methods can be fruitfully applied to guarantee relevant system properties.In this paper we introduce ReSpecT nets, a formalism that can be used to describe reactive behaviours that can succeed and fail, and that allows for an encoding to Petri nets with inhibitor arcs. ReSpecT nets are introduced to give a core model to a fragment of the ReSpecT language, and to pave the way for devising an analysis methodology including formal verification of safety and liveness properties. In particular, we provide a semantics to ReSpecT specifications through a mapping to ReSpecT nets. The potential of this approach for the analysis of ReSpecT specifications is discussed, presenting initial results for the analysis of safety properties.     

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

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.