Internetware is envisioned as a general software paradigm for the application style of resources integration and sharing in the open, dynamic and uncertain platforms such as the Internet. Continuing the agent-based Internetware model presented in a previous paper, in this paper, after an analysis of the behavioral patterns and the technical challenges of environment-driven applications, a software-structuring model is proposed for environment-driven Internetware applications. A series of explorations on the enabling techniques for the model, especially the modeling, management and utilization of context information are presented. Several proto-typical systems have also been built to prove the concepts and evaluate the techniques. These research efforts make a further step toward the Internetware paradigm by providing an initial framework for the construction of context-aware and self-adaptive software application systems in the open network environment.
Lǔ Jian MA XiaoXing TAO XianPing CAO Chun HUANG Yu YU Ping
图形化、集成化的软件体系结构开发环境对于推动软件体系结构相关技术的研究和应用具有重要的意义.提出了一种基于图文法的可视化编辑环境生成机制.对于给定的软件体系结构风格的图文法描述,可以自动生成相应的图文法制导的体系结构编辑工具.与常见的基于Meta-Model的开发环境相比,这种图文法制导的开发方式更多地利用了相应软件体系结构风格的内在语义,从而提高了环境的易用性和可靠性.设计并实现了一个原型系统Artemis-GADE(graph grammar-directed architecture development environment),初步验证了上述途径的可行性.
Since the specifications of most of the existing context-sensitive graph grammars tend to be either too intricate or not intuitive, a novel context-sensitive graph grammar formalism, called context-attributed graph grammar（CAGG）, is proposed. In order to resolve the embedding problem, context information of a graph production in the CAGG is represented in the form of context attributes of the nodes involved. Moreover, several properties of a set of confluent CAGG productions are characterized, and then an algorithm based on them is developed to decide whether or not a set of productions is confluent, which provides the foundation for the design of efficient parsing algorithms. It can also be shown through the comparison of CAGG with several typical context-sensitive graph grammars that CAGG is more succinct and, at the same time, more intuitive than the others, making it more suitably and effortlessly applicable to the specification of visual languages.
