Jianxing Gong

Research and implement on the layout method of bom-based federation

In the HLA-based distributed simulation system, the traditional federates exist as a single program application module, therefore, federates canpsilat be extensible flexibly. By the method of BOM, the federate composed of the reusable simulation model components can be customized and is scalable. However, in fact, the component-based federate can not be extended randomly, and the scale can not be extended infinitely. Usually itpsilas restricted by some factors, such as the performance of the operating system. So that itpsilas useful to have a rational layout of the federation before itpsilas generated. In this paper, there are two methods to be presented in detail: the stepwise incremental layout and the template-based layout. On the base of that two methods, the federation layout tool has been designed and implemented. Finally, the examples are given to describe the process of the federation layout. And the methods of the layout are proved to be feasible in practice.

Design of Component-Oriented Centralized and Distributed-Integrative Runtime Infrastructure of Simulation System

Focusing on specific domains, most traditional simulation systems have features of standalone-centralized running mode, weak interoperability with external simulation systems, difficult reusability of system components. With the technical development of the distributed simulation, the inspiration of developing reusable simulation model components satisfying the needs of simulation systems or environments in the whole simulation domain, as well as endowing the simulation system with the ability of customization, expansion and interoperability by assembling above mentioned components rapidly and conveniently have drawn significant attention within simulation community. The paper addresses a component-oriented centralized and distributed-integrative runtime infrastructure of simulation system. The system has designed the corresponding data distribution, filtering and cache concentration, operating on the subscribing and publishing mechanism, for reducing the redundancy of interactive data between models and improving the running efficiency of the system. It also proposes the simulation service based on the bridge-based design pattern, shielding implementation details between models in the application layer and underlying runtime platforms. The service enables the application of models used not only in traditional standalone centralized simulation systems, but also in distributed simulation system with no editing even compiling. Besides, through using international standard descriptive specification, namely Base Object Model (BOM), for component-oriented simulation models, the system improves the standardization and interoperability of models.

An algorithm for interest management in High Level Architecture

One of the most important design concerns when implementing large-scale high-level architecture (HLA) simulations is how to perform effective interest management. HLA interest management separates routing from data delivery so as to filter out unnecessary data communication between federated computers. One of the more scalable mechanisms for such interest management, data distributed management (DDM), distributes and filters data based on regional clustering. Essential to DDM, therefore, are the algorithms for dividing routing space and for matching regions. In this article, we describe how the spatial hierarchy of routing space is defined, and introduce a technique based on n-dimensional binary trees to solve the problem of region matching. We then introduce two algorithms: one to compute the coding of hierarchically structured regions, and the other to match regions based on this coding. Finally, we outline our general strategy for data filtering in HLA, and analyze the advantageous and limitations of the algorithm through experiments.

Optimised ExpTime Tableaux for

This study proposes to adopt a novel tableau reasoning algorithm for the description logic with semantics based on a finite residuated De Morgan lattice. The syntax, semantics, and logical properties of this logic are given, and a sound, complete, and terminating tableaux algorithm for deciding fuzzy ABox consistency and concept satisfiability problem with respect to TBox is presented. Moreover, based on extended and/or completion-forest with a series of sound optimization technique for checking satisfiability with respect to a TBox in the logic, a new optimized ExpTime (complexity-optimal) tableau decision procedure is presented here. The experimental evaluation indicates that the optimization techniques we considered result in improved efficiency significantly.

\mathrm{\scr S}\scr H\scr I\mathrm{\scr N}

This study proposes to adopt a novel tableau reasoning algorithm for the description logic with semantics based on a finite residuated De Morgan lattice. The syntax, semantics, and logical properties of this logic are given, and a sound, complete, and terminating tableaux algorithm for deciding fuzzy ABox consistency and concept satisfiability problem with respect to TBox is presented. Moreover, based on extended and/or completion-forest with a series of sound optimization technique for checking satisfiability with respect to a TBox in the logic, a new optimized ExpTime (complexity-optimal) tableau decision procedure is presented here. The experimental evaluation indicates that the optimization techniques we considered result in improved efficiency significantly.

over Finite Residuated Lattices

This study proposes to adopt a novel tableau reasoning algorithm for the description logic with semantics based on a finite residuated De Morgan lattice. The syntax, semantics, and logical properties of this logic are given, and a sound, complete, and terminating tableaux algorithm for deciding fuzzy ABox consistency and concept satisfiability problem with respect to TBox is presented. Moreover, based on extended and/or completion-forest with a series of sound optimization technique for checking satisfiability with respect to a TBox in the logic, a new optimized ExpTime (complexity-optimal) tableau decision procedure is presented here. The experimental evaluation indicates that the optimization techniques we considered result in improved efficiency significantly.

Optimised ExpTime Tableaux forℋℐover Finite Residuated Lattices

With the sustaining development and expanding domain of the simulation technology, the operating system and platform that the simulation tools relied on are becoming multiplex. Thus more and more simulation tools need to be used in multi-platform. Therefore, how to improve the application portability of simulation tools has made many scholars addicted to it. This paper has analyzed the basic ideas of MDA, put forward a way of generating HLA-based federate frame based in MDA, and finally developed a tool which can generate HLA-based federate code frame for multi-platform automatically. This tool can greatly improve the efficiency of HLA-based federate development.

Optimised ExpTime Tableaux for over Finite Residuated Lattices

BOMs (Base Object Models) supported by SISO (Simulation Interoperability Standards Organization) are intended to provide a key mechanism in facilitating interoperability, reuse, and composability and support and promote reuse of simulation components and agile, rapid, and efficient development and maintenance of models. We examine how pattern components, supported by IF BOM (interface BOMs) and how behavior components, supported by the ECAP BOM (encapsulated BOMs), can be used to enable simulation model components based on BOM composability at design time and dynamically at run-time. Then, we give a method to rapidly compose simulations and simulation environments by applying simulation model components. Specially, we use IF BOMs as windows to filter data, which is dependent on the publishing and subscribing capability of conceptual entities among simulation model components, to enable simulation model components low coupling and high aggregation so that simulation components are not necessary for each other to know the needed inner behavior required of a conceptual entity. At last, we explore a BOM-based simulation engine, which auto-loads the desired simulation model components to rapidly compose simulations and simulation environments.

One method of generating HLA-based federate code frame for multi-platform

With the rapid advance of component-based technology in software engineering, component-based software has been widely used to develop highly modular simulation environments. The integration of component-based technology with M&S (modeling and simulation) environments gives the latter powerful capability and greatly supports reusability of components and interoperability of simulation environments. BOMs (base object models) supported by SISO (Simulation Interoperability Standards Organization) are intended to provide a key mechanism in facilitating interoperability, reusability, and composability and support and promote reuse of simulation model components and agile, rapid, and efficient development and maintenance of models. BOM-based simulation model components are designed and assembled to rapidly build dynamic federates in HLA. A flexibly extensible simulation framework is developed to provide a component-oriented methodology for M&S and a common extensible simulation framework for various federates by composing BOM-based simulation model components to improve reusability and interoperability of HLA. The middleware technique is applied to design the simulation engine of the simulation framework and separates simulation model components with different running platforms so that federates can be agilely reconfigured and customized.

Applying BOM-based simulation model components to rapidly compose simulations and simulation environments

Composable modeling enables the rapid, efficient and flexible assembly of simulation systems from components. To data there is a lack of formal descriptions for the process of composable modeling or composable modeling approaches are not operable in engineering. In view of the existing problems, a composable modeling approach based on Petri nets was proposed. Petri nets formal definition of component model was presented. Composition, substitution and deletion operations of component models were defined according to Petri nets operations. The process of composable modeling was transformed to Petri nets operations by the operations of component models. It was revealed by theoretical analysis that this approach based on Petri nets is a good solution to the problems of formal descriptions and operatability of composable modeling and can be used to describe composite models, federates and federations conveniently. The computability of composite models, federate and federations were also proven.