Dynamic Software Architecture Research Articles

Automata-Based Approach to Manage Self-Adaptive Component-Based Architectures

Dynamic software architectures in changing environments need human supervision to continue operation in all conditions. These changes may come from the software architecture or its environment. Such software architecture is required to monitor itself and its environment, detect changes, decide how to react, and act to perform such changes. Enhancing the software architecture with the ability to self-adapt offers a very interesting way forward. This work presents an automata based approach to manage self-adaptive component-based architecture. This approach allows software architecture to adjust itself to changes during runtime and without stopping its execution. It helps the maintenance of the consistency and the coherence of software architecture before, during and after adaptation. The proposed approach is based mainly on the use of the meta-model, automata concept, XML language and UPPAAL model checking tool for the verification of the software consistency before enacting adaptation.

A formal framework-based K-Maude for modelling scalable software architectures

Dynamic software architecture (DySA) is one of the most important challenges and crucial problems for managing dynamically scalable software evolution. In this paper, we propose DySAL, a DySA specific modelling language, primarily based on interfaces, dealing with both evolution types: spatial reconfiguration at system level and architectural elements changes (types and behaviour) at architecture level. DySAL combines MDE and K-Maude techniques for modelling different DySA aspects (topology, behaviour, interactions, and dynamic evolution). It is defined according to an incremental and multi-level approach and may benefit from the strength of the used approaches: meta-modelling (MDE) and formal semantics (Maude). This has the advantage to manage all types of dynamic evolution and their eventual side effects. Moreover, DySAL facilitates DySA definition with multiple views while covering all phases of dynamic application development life cycle, including validation and verification. Our approach is illustrated and evaluated through a realistic example of a ubiquitous system.

A formal framework-based K-Maude for modelling scalable software architectures

Dynamic software architecture (DySA) is one of the most important challenges and crucial problems for managing dynamically scalable software evolution. In this paper, we propose DySAL, a DySA specific modelling language, primarily based on interfaces, dealing with both evolution types: spatial reconfiguration at system level and architectural elements changes (types and behaviour) at architecture level. DySAL combines MDE and K-Maude techniques for modelling different DySA aspects (topology, behaviour, interactions, and dynamic evolution). It is defined according to an incremental and multi-level approach and may benefit from the strength of the used approaches: meta-modelling (MDE) and formal semantics (Maude). This has the advantage to manage all types of dynamic evolution and their eventual side effects. Moreover, DySAL facilitates DySA definition with multiple views while covering all phases of dynamic application development life cycle, including validation and verification. Our approach is illustrated and evaluated through a realistic example of a ubiquitous system.

Compiling, verifying and simulating dynamic software architectures using ANTLR and coloured-ADL

The concept of reconfigurable and dynamic software architecture (DSA) occupies today an important place in the field of software engineering. As result, several architecture description languages (ADLs) and approaches have been proposed for describing DSA in the highest level of abstraction. However, most of these works present theoretical solutions without giving an idea on the execution of final systems at run time. In this paper, we propose a new DSA called coloured software architecture (CSA) based on two concepts coloured operation and coloured connector. Then, we propose a new ADL called coloured-ADL and implement a compiling, verification and simulation tool dedicated to CSA. The simulation of system instances, derived from a CSA, is mainly used to explain coloured-ADL and evaluate the reliability of the simulated system. On the other hand, the verification is focused on checking a new defined safety property called architectural stack overflow (ASO). A safe CSA should be free of ASO violation property. To check a CSA, the verification uses also finite state processes (FSP) and labelled transition state (LTS) to expect this kind of property. We illustrate our propositions through two case studies from the literature.

Compiling, verifying and simulating dynamic software architectures using ANTLR and coloured-ADL

The concept of reconfigurable and dynamic software architecture (DSA) occupies today an important place in the field of software engineering. As result, several architecture description languages (ADLs) and approaches have been proposed for describing DSA in the highest level of abstraction. However, most of these works present theoretical solutions without giving an idea on the execution of final systems at run time. In this paper, we propose a new DSA called coloured software architecture (CSA) based on two concepts coloured operation and coloured connector. Then, we propose a new ADL called coloured-ADL and implement a compiling, verification and simulation tool dedicated to CSA. The simulation of system instances, derived from a CSA, is mainly used to explain coloured-ADL and evaluate the reliability of the simulated system. On the other hand, the verification is focused on checking a new defined safety property called architectural stack overflow (ASO). A safe CSA should be free of ASO violation property. To check a CSA, the verification uses also finite state processes (FSP) and labelled transition state (LTS) to expect this kind of property. We illustrate our propositions through two case studies from the literature.

RAMSES: A new reference architecture for self-adaptive middleware in Wireless Sensor Networks

Wireless Sensor Networks (WSNs) consist of networks composed of tiny devices equipped with sensing, processing, storage, and wireless communication capabilities. WSN nodes have limited computing resources and are usually powered by batteries. First generations of WSNs were designed to attend requirements of a unique target application usually with a single user, who was also the infrastructure owner. However, the rapid evolution in this area and the increasing of the complexity of the sensors and applications pose new challenges to WSN solutions, which can be addressed by specific middleware platforms for these networks. Existing middleware systems provide suitable mechanisms to define the high-level application logic and to deal with heterogeneity and distribution issues of WSN, but most of them do not provide explicit mechanisms to define the underlying autonomic behavior of the system, an essential feature of this kind of network. In this perspective, Autonomic Computing (AC) appears as a promising option to meet autonomic requirements in WSN middleware design. This paper presents the consolidated specification of RAMSES, a reference architecture of a self-adaptive middleware for WSNs. RAMSES was conceived in light of a well-stablished Reference Architecture Model, the RAModel. It follows the autonomic computing model MAPE-K, and presents a mapping of AC conceptual model to a set of software components. We claim that, with the aid of a middleware that supports the autonomic computing principles, a WSN becomes an autonomous WSN by design. RAMSES realizes our vision by providing: (i) an architectural template with core aspects of the self-adaptive systems from which is possible to build concrete middleware instances for self-adaptive WSNs, and (ii) a specification of the reference architecture using a formal architecture description language (Pi-ADL), which enables the representation of dynamic software architectures as required by WSNs. A scenario-based qualitative analysis and a checklist survey conducted with experts demonstrate the effectiveness of RAMSES. Moreover, a concrete WSN middleware instance derived from RAMSES was implemented as a proof of concept.

A dynamic stage-based fraud monitoring framework of multiple live auctions

Monitoring the progress of auctions for fraudulent bidding activities is crucial for detecting and stopping fraud during runtime to prevent fraudsters from succeeding. To this end, we introduce a stage-based framework to monitor multiple live auctions for In-Auction Fraud (IAF). Creating a stage fraud monitoring system is different than what has been previously proposed in the very limited studies on runtime IAF detection. More precisely, we launch the IAF monitoring operation at several time points in each running auction depending on its duration. At each auction time point, our framework first detects IAF by evaluating each bidder's stage activities based on the most reliable set of IAF patterns, and then takes appropriate actions to react to dishonest bidders. We develop the proposed framework with a dynamic agent architecture where multiple monitoring agents can be created and deleted with respect to the status of their corresponding auctions (initialized, completed or cancelled). The adoption of dynamic software architecture represents an excellent solution to the scalability and time efficiency issues of IAF monitoring systems since hundreds of live auctions are held simultaneously in commercial auction houses. Every time an auction is completed or terminated, the participants' fraud scores are updated dynamically. Our approach enables us to observe each bidder in each live auction and manage his fraud score as well. We validate the IAF monitoring service through commercial auction data. We conduct three experiments to detect and react to shill-bidding fraud by employing datasets acquired from auctions of two valuable items, Palm PDA and XBOX. We observe each auction at three-time points, verifying the shill patterns that most likely happen in the corresponding stage for each one.

Enhanced graph rewriting systems for complex software domains

Methodologies for correct by construction reconfigurations can efficiently solve consistency issues in dynamic software architecture. Graph-based models are appropriate for designing such architectures and methods. At the same time, they may be unfit to characterize a system from a non-functional perspective. This stems from efficiency and applicability limitations in handling time-varying characteristics and their related dependencies. In order to lift these restrictions, an extension to graph rewriting systems is proposed herein. The suitability of this approach, as well as the restraints of currently available ones, is illustrated, analyzed, and experimentally evaluated with reference to a concrete example. This investigation demonstrates that the conceived solution can (i) express any kind of algebraic dependencies between evolving requirements and properties; (ii) significantly ameliorate the efficiency and scalability of system modifications with respect to classic methodologies; (iii) provide an efficient access to attribute values; (iv) be fruitfully exploited in software management systems; and (v) guarantee theoretical properties of a grammar, like its termination.

An overview of Dynamic Software Product Line architectures and techniques: Observations from research and industry

Over the last two decades, software product lines have been used successfully in industry for building families of systems of related products, maximizing reuse, and exploiting their variable and configurable options. In a changing world, modern software demands more and more adaptive features, many of them performed dynamically, and the requirements on the software architecture to support adaptation capabilities of systems are increasing in importance. Today, many embedded system families and application domains such as ecosystems, service-based applications, and self-adaptive systems demand runtime capabilities for flexible adaptation, reconfiguration, and post-deployment activities. However, as traditional software product line architectures fail to provide mechanisms for runtime adaptation and behavior of products, there is a shift toward designing more dynamic software architectures and building more adaptable software able to handle autonomous decision-making, according to varying conditions. Recent development approaches such as Dynamic Software Product Lines (DSPLs) attempt to face the challenges of the dynamic conditions of such systems but the state of these solution architectures is still immature. In order to provide a more comprehensive treatment of DSPL models and their solution architectures, in this research work we provide an overview of the state of the art and current techniques that, partially, attempt to face the many challenges of runtime variability mechanisms in the context of Dynamic Software Product Lines. We also provide an integrated view of the challenges and solutions that are necessary to support runtime variability mechanisms in DSPL models and software architectures.

Dynamic Software Architecture for Medical Domain Using Pop Counts

Over the past few decades, the complexity of software for almost any era has increased significantly. The aim of this paper is to provide an approach which not only feasible but also decision-oriented in medical era. It focus on the careful planning and organizing success in continuous process improvements in software and hardware technology as this brings a lot of trouble to system development and maintenance. We have used the pop count method to develop the dynamic software architecture with the existence of quality attributes in order to find out the level of severity in patients of any diseases on the specialist perception. This is useful for taking decision on priority healing and regular concentration of the patients even in the absence of the specialist. Further the method (model) tested on the 25 symptoms of 100 patients which does not contain any dichotomous data and found with the help of statistical evaluation (that it result almost perfect classification) that the architecture is conformance to the medical software architecture quality requirements.

Specifying Dynamic Software Architectures with Dynamic Description Logic

Dynamic software architectures provide support for building long running and reconfigurable applications. Formal specification is useful to the design of correct and robust dynamic software architectures. In this paper, dynamic software architectures are specified with dynamic description logic. Dynamic description logic inherits the expressiveness and decidability of description logic and it has the ability to represent state changes. Reconfigurable dataflow model, which is an extension of the widely used dataflow model, is used as the architecture meta-model. Architectures, reconfiguration operations, and reconfiguration plans are represented in a unified framework from the view point of data flow. Three levels of constraints have been proposed to aid designers in predetermining the possible side effects of reconfiguration plans. The work can guide the development of dynamic software systems from component definition to reconfiguration plan design.

An Architecture Dynamic Modeling Language for Self-Healing Systems

As modern software-based systems increase in complexity, recovery from malicious attacks and rectification of system faults become more difficult, labor-intensive, and error-prone. These factors have actuated research dealing with the concept of self-healing systems, which employ architectural models to monitor system behavior and use inputs obtaining therefore to adapt themselves to the run-time environment. Numerous architectural description languages (ADLs) have been developed, each providing complementary capabilities for architectural development and analysis. Unfortunately, few ADLs embrace dynamic change as a fundamental consideration and support a broad class of adaptive changes at the architectural level. The Architecture Dynamic Modeling Language (ADML) is being developed as a new formal language and/or conceptual model for representing dynamic software architectures. TheADML couple the static information provided by the system requirements and the dynamic knowledge provided by tactics, and offer a uniform way to represent and reason about both static and dynamic aspects of self-healing systems. Because the ADML is based on the Dynamic Description Logic DDL, architectural ontology entailment for the ADML languages can be reduced to knowledge base satisfiability in DDL.

Component Model Supporting Trustworthiness-Oriented Software Evolution

PDF HTML阅读 XML下载 导出引用 引用提醒 一种支持软件可信演化的构件模型 DOI: 10.3724/SP.J.1001.2011.03813 作者: 作者单位: 作者简介: 通讯作者: 中图分类号: 基金项目: 国家自然科学基金(90818028); 国家重点基础研究发展计划(973)(2011CB302600); 国家杰出青年科学基金 (60625203) Component Model Supporting Trustworthiness-Oriented Software Evolution Author: Affiliation: Fund Project: 摘要 | 图/表 | 访问统计 | 参考文献 | 相似文献 | 引证文献 | 资源附件 | 文章评论 摘要:对环境的适应是软件保证其可信的重要手段.当应用场景超出开发阶段的预设时,软件的环境适应能力需要能够在线调整,以保证其行为和结果仍可符合用户预期.这一调整的前提是软件工程层面的高效支持机制.基于关注点分离原则和动态软件体系结构技术,提出了一种支持软件环境适应能力细粒度在线调整的构件模型ACOE(adaptive component model for open environment).ACOE 将软件环境适应能力中的感知、决策、执行等关注点封装为独立的构件和连接子,通过动态软件体系结构技术来支持它们的在线重配置,从而使第三方可在必要时通过有选择性的更新来调整适应能力.实现了支持ACOE 构件模型的容器原型,并通过实验验证了其有效性. Abstract:Environment-Driven adaptation is an important means ensuring software integrity. Confronted with scenarios not anticipated during the developmental stage, the predefined adaptability of the software should be adjusted to ensure that its behavior agree with the users’ expectation. The premise of this kind of adjustment are efficient software engineering mechanisms. Based on the principles of the Separation of Concerns and the Dynamic Software Architecture (DSA) technology, this paper proposes a component model named ACOE (adaptive component model for open environment) that supports the online fine-grained adjustment to software adaptability. ACOE encapsulates adaptation concerns, such as sensing, decision, and execution into components, and connectors, and then supports their dynamic configuration with the DSA technology. As a result, a third-party can adjust the adaptability by selectively upgrading it when necessary. An ACOE container prototype and experimental applications are implemented to validate this approach. 参考文献 相似文献 引证文献

Social interaction regulation in virtual web environments using the Social Theatres model

At the present time virtual communities are overspread in the web, providing users a cyber-place to share common purposes and interact with other users around the world. Interaction in these environments grapple with new challenges concerning to provide their users better tools to interact and fulfil their goals. In this context we propose a model to create regulated interaction environments based on the theatre metaphor: the Social Theatres. A dynamic multi-layer software architecture (ASTeaS) was developed to support this web-based interaction model, allowing easy construction of such social interaction spaces and adaptation to users' devices requirements. In this paper we discuss the usage of interaction regulation in virtual environments supported by the Social Theatres model and evaluate some aspects of the users interaction in two different case study scenarios.

Description and Verification of Dynamic Software Architectures for Distributed Systems

Continuing growth and increasing complexity of distributed software systems make them be more flexible, adaptive and easily extensible. Dynamic evolution or reconfiguration of distributed software systems is one possible solution to meet these demands. However, there are some challenges for building dynamically evolving distributed software systems at runtime, where dynamic software architectures for them is one of the most crucial problems. In this paper, we proposed a formal method of describing and verifying dynamic software architectures for distributed systems using hypergraph grammars. We firstly gave out reconfiguration production rules and operations for software architectures based on hypergraph grammars, and then described dynamic reconfiguration of software architectures for distributed systems according to those rules. At last we verified the invariant property of dynamic software architectures for those systems using model checking, and gave out corresponding verification algorithms.

Applying Bigraph Theory to Self-Adaptive Software Architecture

Existing theories of mobile and concurrency calculi for dynamic software architecture can not provide powerful support for evolutionary properties of self-adaptive software.Under this circumstance,Bigraph is based on a graphical model of mobile computation that emphasizes both locality and connectivity and has a complete and extensible theory framework.Therefore,Bigraph can provide a sound concept and intuitive,pervasive expression for self-adaptive software architecture.This paper introduces Bigraphical theory and current research,describes self-adaptive software architecture formally,analyzes and verifies some properties of dynamic evolution,and then discusses some promising directions of formal self-adaptive software architecture.

Hierarchical Design Rewriting with Maude

Architectural Design Rewriting (ADR) is a rule-based approach for the design of dynamic software architectures. The key features that make ADR a suitable and expressive framework are the algebraic presentation and the use of conditional rewrite rules. These features enable, e.g. hierarchical (top-down, bottom-up or composition-based) design and inductively-defined reconfigurations. The contribution of this paper is twofold: we define Hierarchical Design Rewriting (HDR) and present our prototypical tool support. HDR is a flavour of ADR that exploits the concept of hierarchical graph to deal with system specifications combining both symbolic and interpreted parts. Our prototypical implementation is based on Maude and its presentation serves several purposes. First, we show that HDR is not only a well-founded formal approach but also a tool-supported framework for the design and analysis of software architectures. Second, our illustration tailored to a particular algebra of designs and a particular scenario traces a general methodology for the reuse and exploitation of ADR concepts in other scenarios.

A Graph-based Design Framework for Global Computing Systems

We present a framework for designing and analyzing Global Computing Systems using Dynamic Software Architectures. The framework, called TGG A , integrates typed graph grammars and the Alloy modeling language to specify Programmed Dynamic Software Architectures that represent systems that evolve their topology at runtime. We demonstrate the benefits of the framework by applying it to the study of an Automotive Software System.

A Semantic and Adaptive Middleware Architecture for Pervasive Computing Systems

With the increasing demands for adaptive middleware of dynamic systems in pervasive computing environments, the need for dynamic software architecture and programming infrastructure to achieve dynamic adaptation is widely recognized. In this paper, we firstly present a semantic and adaptive middleware architecture called ScudWare that supports for dynamic and heterogeneous environments. ScudWare middleware is based on adaptive communication environments, which consists of adaptive components, and semantic virtual agents. Specially, a ScudADL framework and the specification semantics, based on higher-order typed ¼ calculus theory, are proposed, which describes ScudWare component structure characters, and dynamic behavior adaptation. In the ScudADL, the computing resources consumption is concerned. And the component inner and outer adaptive behaviors are separated from component functional behaviors in an explicit way. Finally, we introduce an application of ScudWare architecture, which is a computer aided assessment system in a smart CAA space, and give a case study to show its adaptation.

A Supporting Environment Based on Graph Grammar for Dynamic Software Architectures

PDF HTML阅读 XML下载 导出引用 引用提醒 基于图文法的动态软件体系结构支撑环境 DOI: 作者: 作者单位: 作者简介: 通讯作者: 中图分类号: 基金项目: Supported by the National Natural Science Foundation of China under Grant No.60736015 (国家自然科学基金); the National High-Tech Research and Development Plan of China under Grant Nos.2006AA01Z159, 2007AA01Z178 (国家高技术研究发展计划(863)); the Fund for Creative Research Groups of NSFC under Grant No.60721002 (国家基金委创新研究群体项目); the Program for New Century Excellent Talents in University of China under Grant No.NCET-07-0419 (新世纪优秀人才支持计划) A Supporting Environment Based on Graph Grammar for Dynamic Software Architectures Author: Affiliation: Fund Project: 摘要 | 图/表 | 访问统计 | 参考文献 | 相似文献 | 引证文献 | 资源附件 | 文章评论 摘要:使用类型化的属性图及其图文法来直观而形式地刻画软件体系结构和体系结构风格,用图转换来刻画动态体系结构的重配置行为.基于这种刻画,构建了一个动态软件体系结构支撑环境.该环境一方面,通过一个基于图文法的编辑器来支持体系结构图模型的可视化构造和操纵;另一方面,基于内置运行时体系结构技术实现了体系结构图模型在具体系统中的物理实施,并使得图模型上的图转换操作可以自动映射到实际系统的动态重配置上.再加上一系列的辅助设施,形成了一个较为完整的基于图文法的动态软件体系结构支撑环境. Abstract:In this paper, software architectures and architecture styles are modeled with attributed typed graphs and graph grammars respectively. Accordingly, dynamic reconfigurations of software architectures are modeled with graph transformations. Based on such a modeling, a supporting environment is constructed twofold. Firstly, the visual manipulation of the graphical representation of software architectures is supported with a graph grammar- enabled editor. Secondly, the graphical architecture model is reified as a runtime software architecture object built into the physical running system, through which graph transformations of the architecture model is then naturally reflected as dynamic reconfigurations of the running system. 参考文献 相似文献 引证文献