Tool Integration with Triple Graph Grammars - A Survey

Nowadays, typical software and system engineering projects in various industrial sectors (automotive, telecommunication, etc.) involve hundreds of developers using quite a number of different tools. Thus, the data of a project as a whole is distributed over these tools. Therefore, it is necessary to make the relationships of different tool data repositories visible and keep them consistent with each other. This still is a nightmare due to the lack of domain-specific adaptable tool and data integration solutions which support maintenance of traceability links, semi-automatic consistency checking as well as update propagation. Currently used solutions are usually hand-coded one-way transformations between pairs of tools. In this article we present a rule-based approach that allows for the declarative specification of data integration rules. It is based on the formalism of triple graph grammars and uses directed graphs to represent MOF-compliant (meta) models. As a result we give an answer to OMG's request for proposals for a MOF-compliant “queries, views, and transformation” (QVT) approach from the “model driven application development” (MDA) field.     

Distributed Event Graphs: Formalizing Component-based Modelling and Simulation

In this work an extension to the classical Event Graphs formalism for discrete-event simulation is presented. The extensions are oriented towards the specification of component-based models. The abstract syntax has been defined through meta-modelling. Several methodological issues are discussed, concerning the use of two different meta-modelling levels or collapsing the language into a single one, where “instance-of” relationships are used between processes and their classes. The operational semantics have been defined through graph transformation. This formal definition enables analysis before code is generated from the model. The syntax and semantics of the visual language have been implemented in the multi-paradigm tool AToM³, together with a code generator that produces stand-alone applications able to run the analysed models in real-time.     

Automated Composition of Module Chains

We introduce a problem of module composition. Modules are seen as “black boxes” with input and output ports. A compatibility relation models which input ports can connected to which output ports. We are given a set of available modules and a target module. We want to connect available modules into a chain that implements the target module. Constraints may be given on how many copies of each module can or should appear in the solution chain. Costs may be given on modules or ports or connections, so that an optimal solution with respect to these costs is found. We derive an algorithm to solve the above problem automatically. The algorithm transforms the problem into a shortest-path problem in a graph.     

Undergraduate students' use of information elicited during e-mail “tutorials”

This study considers those questions posed by students during e-mail “tutorials” to elicit information from “guest lecturers” and the use of that information by students in their essays. The “tutorials” were conducted for students in the U.K. by a “guest lecturer” in France. The “guest lecturer” was accredited as a tutor on the module for which the students were enrolled, and participated in the module by the provision of lecture notes prior to the e-mail tutorials. Data for the study, drawn from a comparative education assignment set for undergraduate students enrolled on the module, comprised surveys of students' perceived IT capabilities and attitudes towards IT, analyses of students' questions and analyses of students' essays. The findings of the study indicate (1) that tutees tend to pose questions to elicit information or clarification rather than to elicit the viewpoint or opinions of the “guest lecturer” and (2) that two-thirds of tutees' essays cited information elicited from the “guest lecturer”.     

Precise visual modeling: A case-study

We develop an abstract model for our case-study: software to support a “video rental service.” This illustrates how a visual formalism, constraint diagrams, may be used in order to specify such systems precisely.     

Rapid response manufacturing through a rapidly reconfigurable robotic workcell

This article describes the development of a component-based technology robot workcell that can be rapidly configured to perform a specific manufacturing task. The workcell is conceived with standard and inter-operable components including actuator modules, rigid link connectors and tools that can be assembled into robots with arbitrary geometry and degrees of freedom. The reconfigurable “plug-and-play” robot kinematic and dynamic modeling algorithms are developed. These algorithms are the basis for the control and simulation of reconfigurable robots. The concept of robot configuration optimization is introduced for the effective use of the rapidly reconfigurable robots. Control and communications of the workcell components are facilitated by a workcell-wide TCP/IP network and device-level CAN-bus networks. An object-oriented simulation and visualization software for the reconfigurable robot is developed based on Windows NT. Prototypes of the robot workcells configured to perform the light-machining task and the positioning task are constructed and demonstrated.     

Control design for recycled, multi unit processes

An integrated multi-unit chemical plant presents a challenging control design problem due to the existence of recycling streams. In this paper, we develop a framework for analyzing the effects of recycling dynamics on closed-loop performance from which a systematic design of a decentralized control system for a recycled, multi-unit plant is established. In the proposed approach, the recycled streams are treated as unmodelled dynamics of the “unit” model so that their effects on closed-loop stability and performance can be analyzed using the robust control theory. As a result, two measures are produced: (1) the ν-gap metric, which quantifies the strength of recycling effects, and (2) the maximum stability margin of “unit” controller, which represents the ability of the “unit” controller to compensate for such effects. A simple rule for the “unit” control design is then established using the combined two measures in order to guarantee the attainment of good overall closed-loop performances. As illustrated by several design examples, the controllability of a recycled, multi unit process under a decentralized “unit” controller can be determined without requiring any detailed design of the “unit” controller because the simple rule is calculated from the open-loop information only.     

Methods for parallel computation of complex flow problems

This paper is an overview of some of the methods developed by the Team for Advanced Flow Simulation and Modeling (TAFSM) [http://www.mems.rice.edu/TAFSM/] to support flow simulation and modeling in a number of “Targeted Challenges”. The “Targeted Challenges” include unsteady flows with interfaces, fluid–object and fluid–structure interactions, airdrop systems, and air circulation and contaminant dispersion. The methods developed include special numerical stabilization methods for compressible and incompressible flows, methods for moving boundaries and interfaces, advanced mesh management methods, and multi-domain computational methods. We include in this paper a number of numerical examples from the simulation of complex flow problems.     

Using the Model Coupling Toolkit to couple earth system models

Continued advances in computational resources are providing the opportunity to operate more sophisticated numerical models. Additionally, there is an increasing demand for multidisciplinary studies that include interactions between different physical processes. Therefore there is a strong desire to develop coupled modeling systems that utilize existing models and allow efficient data exchange and model control. The basic system would entail model “1” running on “M” processors and model “2” running on “N” processors, with efficient exchange of model fields at predetermined synchronization intervals. Here we demonstrate two coupled systems: the coupling of the ocean circulation model Regional Ocean Modeling System (ROMS) to the surface wave model Simulating WAves Nearshore (SWAN), and the coupling of ROMS to the atmospheric model Coupled Ocean Atmosphere Prediction System (COAMPS). Both coupled systems use the Model Coupling Toolkit (MCT) as a mechanism for operation control and inter-model distributed memory transfer of model variables. In this paper we describe requirements and other options for model coupling, explain the MCT library, ROMS, SWAN and COAMPS models, methods for grid decomposition and sparse matrix interpolation, and provide an example from each coupled system. Methods presented in this paper are clearly applicable for coupling of other types of models.     

Ghost Simulation Model for the Optimization of an Urban Subway System

The first part of the paper presents a model of a complex subway network that includes an operational cost and social costs measured in terms of passenger waiting times. We reformulate the model with a simple discrete event simulation model that considerably reduces the complexity of the simulation. The simplified model uses conditional expectations to filter out rapid dynamics, and it can be interpreted in terms of a subway network with “fluid” passenger levels. Because this network only sees train movements and no individual passengers are described, we call it the “ghost” model.In the second part of the paper, we explore the benefits of using stochastic approximations to adjust the service level (headway) of different subway lines as the network is operating, thus learning passenger traffic patterns and adaptively seeking the best service values. Our formulation of the ghost model is amenable for decentralized estimation of gradients of the cost function with respect to the control parameters (the line headways) and we use ersatz estimation methods to formulate a control scheme that uses minimal measurements and virtually no overhead.     

Beyond particle systems: Operator networks

Particle systems are used for simulating non-linear dynamics of complex systems. They are computationally attractive, because the models are simple difference equations. The difference equations, however, constitute a closed system lacking scalability and intentionality; it is hard to “reverse engineer” the equations, to understand the relations of the variables and coefficients to the dynamics displayed by the simulation. Consequently, much of the modeling work goes into finding workarounds. In this paper, we study a potential solution. As the main contribution, we formalize particle system computations as mathematical operator networks, to gain intentionality and modularity. Operators also support the inclusion of processes outside the mathematical domain of difference equations. We illustrate the use of operator networks by simulating the construction and dynamics of an hourglass.     

Testing XML constraint satisfiability

In a previous paper, we have showed that Hybrid Modal Logic can be successfully used to model semistructured data and provides a simple and well suited formalism for capturing “well typed” references and of course a powerful language for expressing constraint. This paper builds on the previous one and provides a tableau proof technique for constraint satisfiability testing in the presence of schemas.     

“Graphical” Jogthrough: expert based methodology for user interface evaluation, applied in the case of an educational simulation interface

“Walkthrough” and “Jogthrough” techniques are well known expert based methodologies for the evaluation of user interface design. In this paper we describe the use of “Graphical” Jogthrough method for evaluating the interface design of the Network Simulator, an educational simulation program that enables users to virtually build a computer network, install hardware and software components, make the necessary settings and test the functionality of the network. Graphical Jogthrough is a further modification of a typical Jogthrough method, where evaluators' ratings produce evidence in the form of a graph, presenting estimated proportion of users who effectively use the interface versus the time they had to work with it in order to succeed effectiveness. We comment on the question: “What are the possible benefits and limitations of the Graphical Jogthrough method when applied in the case of educational software interface design?” We present the results of the evaluation session, and concluding from our experience we argue that the method could offer designers quantitative and qualitative data for formulating a useful (though rough in some aspects) estimation about the novice–becoming–expert pace that end users might follow when working with the evaluated interface.     

Implementing a hybrid simulation model for a Kanban-based material handling system

Plant floor material handling is a loose loop in most assembly plants. Simulation offers a quick, controllable and tunable approach for prototyping complex material handling processes in manufacturing environments. This paper proposes a hybrid simulation approach, using both discrete event and agent-based technologies, to model complex material handling processes in an assembly line. A prototype system is implemented using a commercial multi-paradigm modeling tool. In this prototype, JIT principles are applied to both the production and the material handling processes. The system performance is evaluated and system optimization directions are suggested. The proposed hybrid modeling approach facilitates the implementation of a responsive and adaptive environment in that various “what-if” scenarios can be simulated under different simulation configurations and real-time situations.     

Molecular dynamics, smoothed-particle applied mechanics, and irreversibility

We explore the relationship of Monaghan's version of “smoothed-particle hydrodynamics,” here called “smoothed-particle applied mechanics,” to nonequilibrium molecular dynamics. We first use smoothed particles to model the simplest possible linear transport problems, as well as a liquid-drop problem. We then consider both gas-phase and dense-fluid versions of Rayleigh-Bénard convection, all in two space dimensions. We also discuss the possibility of combining the microscopic and macroscopic techniques in a hybrid scheme well-suited to the massively-parallel modelling of large-scale nonequilibrium flows.     

A DFO technique to calibrate queueing models

A crucial step in the modeling of a system is to determine the values of the parameters to use in the model. In this paper we assume that we have a set of measurements collected from an operational system, and that an appropriate model of the system (e.g., based on queueing theory) has been developed. Not infrequently proper values for certain parameters of this model may be difficult to estimate from available data (because the corresponding parameters have unclear physical meaning or because they cannot be directly obtained from available measurements, etc.). Hence, we need a technique to determine the missing parameter values, i.e., to calibrate the model.As an alternative to unscalable “brute force” technique, we propose to view model calibration as a non-linear optimization problem with constraints. The resulting method is conceptually simple and easy to implement. Our contribution is twofold. First, we propose improved definitions of the “objective function” to quantify the “distance” between performance indices produced by the model and the values obtained from measurements. Second, we develop a customized derivative-free optimization (DFO) technique whose original feature is the ability to allow temporary constraint violations. This technique allows us to solve this optimization problem accurately, thereby providing the “right” parameter values. We illustrate our method using two simple real-life case studies.