Bidirectional Transformation Research Articles

Dagstuhl seminar on bidirectional transformations (BX)

research-article Dagstuhl seminar on bidirectional transformations (BX) Authors: Zhenjiang Hu National Institute of Informatics, Japan National Institute of Informatics, JapanView Profile , Andy Schurr Technische Universit - at Darmstadt Technische Universit - at DarmstadtView Profile , Perdita Stevens University of Edinburgh University of EdinburghView Profile , James F. Terwilliger Microsoft Corporation Microsoft CorporationView Profile Authors Info & Claims ACM SIGMOD RecordVolume 40Issue 1March 2011 pp 35–39https://doi.org/10.1145/2007206.2007217Published:18 July 2011Publication History 27citation155DownloadsMetricsTotal Citations27Total Downloads155Last 12 Months11Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

System-level model integration of design and simulation for mechatronic systems based on SysML

The design of a mechatronic system (MTS) is not a trivial task due to the complexity of the systems. The evaluation of various design scenarios for the given requirements of a specific MTS is also difficult. Currently, model-based systems engineering (MBSE) and the modeling language SysML provide a novel means for the systematic design of MTSs. However, the specific requirements of MTS behavior modeling, i.e., continuous dynamics or even discrete/continuous hybrid behavior modeling, and automatic simulation and evaluation of the behavior models, are not supported by SysML which intends to create descriptive static design models. Therefore, extension should be made for SysML to support detailed hybrid behavior modeling and the transformation between hybrid models in SysML and executable simulation models in certain simulation environment. For this study, a meta-model based method is proposed to integrate the system design and simulation models of MTSs. First, a set of stereotypes is defined to facilitate the designer to explicitly model hybrid dynamic behavior based on SysML. The necessary simulation information is also formalized in SysML to support an analysis of the system dynamic behavior with the aid of simulations. Finally, the SysML-based system dynamic behavior, and the related simulation information are integrated with the platform-specific simulation model through a bidirectional model transformation approach based on a triple graph grammar (TGG), which facilitates the automatic model consistency and traceability between system design and simulation. The proposed method is implemented and illustrated by using an Inverted Pendulum System (IPS).

Propagation of Constraints along Model Transformations Based on Triple Graph Grammars

Model transformations based on triple graph grammars (TGGs) have been applied in several practical case studies and they convince by their intuitive and descriptive way of specifying bidirectional model transformations. Moreover, fundamental properties have been extensively studied including syntactical correctness, completeness, termination and functional behaviour. But up to now, it is an open problem how domain specific properties that are valid for a source model can be preserved along model transformations such that the transformed properties are valid for the derived target model. In this paper, we analyse in the framework of TGGs how to propagate constraints from a source model to an integrated and target model such that, whenever the source model satisfies the source constraint also the integrated and target model satisfy the corresponding integrated and target constraint. In our main new results we show under which conditions this is possible. The case study shows how this result is successfully applied for the propagation of security constraints in enterprise modelling between business and IT models.

A simple game-theoretic approach to checkonly QVT Relations

The QVT Relations (QVT-R) transformation language allows the definition of bidirectional model transformations, which are required in cases where two (or more) models must be kept consistent in the face of changes to either or both. A QVT-R transformation can be used either in checkonly mode, to determine whether a target model is consistent with a given source model, or in enforce mode, to change the target model. A precise understanding of checkonly mode transformations is prerequisite to a precise understanding of enforce mode transformations, and this is the focus of this paper. In order to give semantics to checkonly QVT-R transformations, we need to consider the overall structure of the transformation as given by when and where clauses, and the role of trace classes. In the standard, the semantics of QVT-R are given both directly, and by means of a translation to QVT Core, a language which is intended to be simpler. In this paper, we argue that there are irreconcilable differences between the intended semantics of QVT-R and those of QVT Core, so that no translation from QVT-R to QVT Core can be semantics-preserving, and hence no such translation can be helpful in defining the semantics of QVT-R. Treating QVT-R directly, we propose a simple game-theoretic semantics. We demonstrate its behaviour on examples and show how it can be used to prove an example result comparing two QVT-R transformations. We demonstrate that consistent models may not possess a single trace model whose objects can be read as traceability links in either direction. We briefly discuss the effect of variations in the rules of the game, to elucidate some design choices available to the designers of the QVT-R language.

Research and Modeling for Bi-Directional DC/DC Converter Based on Formation Technology for Lithium Battery

This paper puts forward a new kind of bidirectional DC/DC topological structure which is used in technology of lithium batteries .It adopts two-stage bidirectional topological structure which called half-bridge bidirectional converter and buck-boost bidirectional converter. This structure can achieve the transformation in the case of large voltage difference between input voltage and output voltage by DSP taking control of buck-boost bidirectional converter. This topological structure is authenticated in the environment of MATLAB/SIMLINK .The result demonstrates that the converter is stable, and can effectively realize bi-directional transformation between 3V battery voltage and 400V bus bar voltage.

Symmetric lenses

Lenses --bidirectional transformations between pairs of connected structures--have been extensively studied and are beginning to find their way into industrial practice. However, some aspects of their foundations remain poorly understood. In particular, most previous work has focused on the special case of asymmetric lenses , where one of the structures is taken as primary and the other is thought of as a projection, or view. A few studies have considered symmetric variants, where each structure contains information not present in the other, but these all lack the basic operation of composition . Moreover, while many domain-specific languages based on lenses have been designed, lenses have not been thoroughly explored from an algebraic perspective. We offer two contributions to the theory of lenses. First, we present a new symmetric formulation, based on complements , an old idea from the database literature. This formulation generalizes the familiar structure of asymmetric lenses, and it admits a good notion of composition. Second, we explore the algebraic structure of the space of symmetric lenses. We present generalizations of a number of known constructions on asymmetric lenses and settle some longstanding questions about their properties---in particular, we prove the existence of (symmetric monoidal) tensor products and sums and the non -existence of full categorical products or sums in the category of symmetric lenses. We then show how the methods of universal algebra can be applied to build iterator lenses for structured data such as lists and trees, yielding lenses for operations like mapping, filtering, and concatenation from first principles. Finally, we investigate an even more general technique for constructing mapping combinators, based on the theory of containers .

Synchronizing concurrent model updates based on bidirectional transformation

Model-driven software development often involves several related models. When models are updated, the updates need to be propagated across all models to make them consistent. A bidirectional model transformation keeps two models consistent by updating one model in accordance with the other. However, it does not work when the two models are modified at the same time. In this paper we first examine the requirements for synchronizing concurrent updates. We view a synchronizer for concurrent updates as a function taking the two original models and the two updated models as input, and producing two new models where the updates are synchronized. We argue that the synchronizer should satisfy three properties that we define to ensure a reasonable synchronization behavior. We then propose a new algorithm to wrap any bidirectional transformation into a synchronizer with the help of model difference approaches. We show that synchronizers produced by our algorithm are ensured to satisfy the three properties if the bidirectional transformation satisfies the correctness property and the hippocraticness property. We also show that the history ignorance property contributes to the symmetry of our algorithm. An implementation of our algorithm shows that it worked well in a practical runtime management framework.

A Molecular Dynamics Study of Bidirectional Phase Transformation between bcc and fcc Iron

Bidirectional phase transformation between bcc and fcc iron is investigated by molecular dynamics simulation using the Finnis-Sinclair potential with a cutoff function in the atomic charge density. It is confirmed that the influence distance (i.e., cutoff distance) of the atomic charge density affects the relative stability between the bcc and fcc phases at high temperature: the bcc is stable at a long cutoff distance and the fcc is stable at a short cutoff distance. Hence, the bidirectional phase transformation across the A3 point comes true by changing the cutoff distance at the A3 point. The propagation of an fcc-bcc heterointerface with a Nishiyama-Wassermann orientation relationship is then examined by relaxation of an fcc-bcc biphasic system at various temperatures. The fcc-to-bcc phase transformation is observed below the A3 point, whereas the heterointerface does not move to any direction at the A3 point. On the other hand, the bcc-to-fcc phase transformation is observed above the A3 point, which has not been successful in previous studies using the original Finnis-Sinclair potential.

From State- to Delta-Based Bidirectional Model Transformations: the Asymmetric Case.

From State- to Delta-Based Bidirectional Model Transformations: the Asymmetric Case.

Supporting runtime software architecture: A bidirectional-transformation-based approach

Runtime software architectures (RSA) are architecture-level, dynamic representations of running software systems, which help monitor and adapt the systems at a high abstraction level. The key issue to support RSA is to maintain the causal connection between the architecture and the system, ensuring that the architecture represents the current system, and the modifications on the architecture cause proper system changes. The main challenge here is the abstraction gap between the architecture and the system. In this paper, we investigate the synchronization mechanism between architecture configurations and system states for maintaining the causal connections. We identify four required properties for such synchronization, and provide a generic solution satisfying these properties. Specifically, we utilize bidirectional transformation to bridge the abstraction gap between architecture and system, and design an algorithm based on it, which addresses issues such as conflicts between architecture and system changes, and exceptions of system manipulations. We provide a generative tool-set that helps developers implement this approach on a wide class of systems. We have successfully applied our approach on JOnAS JEE system to support it with C2-styled runtime software architecture, as well as some other cases between practical systems and typical architecture models.

Constructing a bidirectional transformation between BPMN and BPEL with a functional logic programming language

In this article we show how functional logic programming techniques can be used to construct a bidirectional transformation between structured process models of the business process modeling notation (BPMN) and executable models of the business process execution language (BPEL). We specify the abstract syntax of structured process models by a context-free hypergraph grammar. This grammar can be subsequently transformed into a graph parser using our previously developed G rappa framework of functional logic GRAPh PArser combinators. The G rappa framework has been implemented using the functional logic programming language Curry. Furthermore, we show how the constructed parsers can be enriched with semantic computations as required for the synthesis of BPEL from BPMN. Since our parser is a function implemented in a functional logic language, it can be applied in both directions. Thus, given a BPEL model, a corresponding BPMN graph can be constructed with the very same parser. Finally, logic-based parsers can be used for model completion and language generation in a straightforward way. In order to be self-contained, this article also surveys context-free hypergraph grammars, the concepts of the programming language Curry, the example languages BPMN and BPEL, and the ideas of the G rappa framework. Actually, this article is a literate Curry program and, as such, directly executable. Thus, it contains the complete concise source code of our application.

사용자 프로파일 기반의 맞춤형 광고 서비스 및 양방향 개인 맞춤형 방송 시스템 구축

@A1234()*5/67BCD8E. ()*8 F!GHI#JKLM!GHI5NBOP HI-./QRDE. 12-./I!'S RT-U8'12V8WMX!HYLZ[\,34]^-./QH I_M`a#DE. @I12()*-./QbD!#$5/6M3cHdE. 85/6A()*-./QbDae4TV-AnytimeB-fH,PIghV8WQ%&i#!#$TjklV8W0()*+,-./QmnD()*'E1D%oMmnHY12V8Wp  H,PE. 7^12()*5/6A!#$MqHY34r#s HIjkl0+,Qtu0 HY!'5vLZ[Q\diw, %x'Tyr]^o z4-./'i#!'LZ[Q{G5|E.AbstractThis paper shows the research about the personalized broadcasting system. The personalized broadcasting is the service that users only show the programs which they want to watch when they want to watch these. The purpose of the bi-directional broadcasting service is supporting more satisfied and more personalized services by permitting the bi-directional data transformation. This research also develops the user profiling system for the bi-directional and personalized broadcasting service. This system applied the TV-Anytime metadata specifications which is the standard for the personalized broadcasting services, the system supports the various functions for the bi-directionl and personalized broadcasting such as the user profiling, contents metadata and targeting advertisement services. The bi-directional and personalized broadcasting system increases the users' satisfaction with the recommendation and management of the personally favorite broadcasting contents and advertisements, the trial run results show that the services raise the users' satisfaction with the intelligent and discriminating broadcasting services. Keyword : bi-directional broadcasting, personalized broadcasting, user profile, targeting advertisement, program recommendation

Bidirectionalizing graph transformations

Bidirectional transformations provide a novel mechanism for synchronizing and maintaining the consistency of information between input and output. Despite many promising results on bidirectional transformations, these have been limited to the context of relational or XML (tree-like) databases. We challenge the problem of bidirectional transformations within the context of graphs, by proposing a formal definition of a well-behaved bidirectional semantics for UnCAL, i.e., a graph algebra for the known UnQL graph query language. The key to our successful formalization is full utilization of both the recursive and bulk semantics of structural recursion on graphs. We carefully refine the existing forward evaluation of structural recursion so that it can produce sufficient trace information for later backward evaluation. We use the trace information for backward evaluation to reflect in-place updates and deletions on the view to the source, and adopt the universal resolving algorithm for inverse computation and the narrowing technique to tackle the difficult problem with insertion. We prove our bidirectional evaluation is well-behaved. Our current implementation is available online and confirms the usefulness of our approach with nontrivial applications.

Integrating Process and Work Breakdown Structure with Design Structure Matrix

In software development, project plans document scope, cost, effort, and schedule, guide project managers, and control project execution. Developing a project plan without incorporating how an organization doing things - i.e., organizational culture - may lead to project failure. To ensure stable process performance and to benefit from organizational culture, it is crucial that organizational processes be taken into account in project planning. Organizational processes enable stable process performance across an organization and provide a basis for cumulative, long term benefits to the organization. In proposing a systematic approach that supports bi-directional transformation between processes and the Work Breakdown Structure (WBS), we propose Process2WBS and WBS2Process to assist project managers in project planning with an organization’s set of standard processes. Process2WBS consumes processes and transforms them into a WBS with Design Structure Matrix (DSM) analysis, and WBS2Process transforms the WBS with project-specific information into executable processes expressed in XPDL.

The Two Faces of Cervical Adenocarcinoma In Situ

In order of frequency, cervical intraepithelial neoplasia (CIN), combined adenocarcinoma in situ (AIS)/CIN lesions, and solitary AIS are the most prevalent premalignant lesions of the uterine cervix. As the morphologic distinction of these subtypes is not always straightforward, we performed an immunophenotyping analysis to establish distinguishing profiles for each of these squamous and glandular progenitor lesions of cervical carcinoma. A series of 26 premalignant cervical lesions, comprising 13 cases of AIS, of which 7 represented solitary AIS and 6 were combined with CIN (combined AIS/CIN), as well as 13 solitary high-grade CIN lesions, were immunophenotypically analyzed using antibodies directed against p16, p63, bcl-2, and cytokeratins (CK) 5, 7, 8, 13, 17, 18, and 19. Adjacent normal epithelia were also investigated. CIN lesions expressed the full panel of antibodies. Combined AIS/CIN lesions also expressed the full complement of markers in both the AIS and CIN compartments. However, the expression of p63, bcl-2, CK5, and CK17 was lower in AIS compared with CIN. The solitary AIS lesions could be subdivided into 2 subgroups, 1 expressing the full complement of markers and a second group in which no expression of p63, bcl-2, CK5, and a sporadically CK17 expression was observed. We conclude that 2 phenotypically distinct types of AIS can be identified, that is, AIS with a reserve cell marker phenotype and AIS with an endocervical glandular phenotype. These observations support the view that reserve cells are capable of bidirectional premalignant transformation, that is, into CIN and reserve cell-type AIS, as well as combined AIS/CIN. The endocervical type of AIS is probably a result of the unidirectional transformation of progenitor cells within the glandular cell compartment.

Adaptive Long-Term Coding of LSF Parameters Trajectories for Large-Delay/Very- to Ultra-Low Bit-Rate Speech Coding

This paper presents a model-based method for coding the LSF parameters of LPC speech coders on a basis, that is, beyond the usual 20-30 ms frame duration. The objective is to provide efficient LSF quantization for a speech coder with large delay but very- to ultra-low bit-rate (i.e., below 1 kb/s). To do this, speech is first segmented into voiced/unvoiced segments. A Discrete Cosine model of the time trajectory of the LSF vectors is then applied to each segment to capture the LSF interframe correlation over the whole segment. Bi-directional transformation from the model coefficients to a reduced set of LSF vectors enables both efficient sparse coding (using here multistage vector quantizers) and the generation of interpolated LSF vectors at the decoder. The proposed method provides up to 50% gain in bit-rate over frame-by-frame quantization while preserving signal quality and competes favorably with 2D-transform coding for the lower range of tested bit rates. Moreover, the implicit time-interpolation nature of the long-term coding process provides this technique a high potential for use in speech synthesis systems.

Consistent Web site updating based on bidirectional transformation

A transformation-based Web site can keep the contents of a Web site consistent by furnishing a single database and a set of transformation programs, each generating a Web page from the database. However, when someone notices an error or stale content on a Web page in this style of Web site construction, the Web site maintainer must access a possibly huge database to update the corresponding content. In this paper, we propose a new approach to Web site construction based on bidirectional transformation, and report our design and implementation of a practical updating system called Vu-X. We bring the idea of bidirectional transformation to Web site construction, describing not only a forward transformation for generating Web pages from the database but also a backward transformation for reflecting modifications on the Web pages to the database. By use of the bidirectional transformation language Bi-X, we can obtain both transformations only by specifying a forward transformation. Our Vu-X system is implemented as a Web server built upon the Bi-X transformation engine, which can keep the content of Web sites consistent by updating Web pages in WYSIWYG style on Web browsers.

An XML-based framework for bidirectional transformation in model-driven architecture (MDA)

A model transformation in Model-Driven Architecture is the generation of a target model from a source model, which is normally based on different processes. These processes are described by a transformation definition, consisting of a number of transformation rules, and executed with the help of a transformational tool. In Model-Driven Architecture approach, bidirectionality is one of the most desirable features of the transformational process. Here bi-directionality means that a transformation can be applied from source to target as well as back from target to source model. Different technologies are available which provide bidirectionality between platform specific models to Code Generation but hardly any tool is providing bidirectionality between platform independent models to platform specific models. Here we proposed an XML-Based Bidirectional Transformation Model (as a framework) for Model-Driven Architecture that provides bidirectionality between platform independent model and platform specific model.

Bidirectionalization for free! (Pearl)

A bidirectional transformation consists of a function get that takes a source (document or value) to a view and a function put that takes an updated view and the original source back to an updated source, governed by certain consistency conditions relating the two functions. Both the database and programming language communities have studied techniques that essentially allow a user to specify only one of get and put and have the other inferred automatically. All approaches so far to this bidirectionalization task have been syntactic in nature, either proposing a domain-specific language with limited expressiveness but built-in (and composable) backward components, or restricting get to a simple syntactic form from which some algorithm can synthesize an appropriate definition for put. Here we present a semantic approach instead. The idea is to take a general-purpose language, Haskell, and write a higher-order function that takes (polymorphic) get-functions as arguments and returns appropriate put-functions. All this on the level of semantic values, without being willing, or even able, to inspect the definition of get, and thus liberated from syntactic restraints. Our solution is inspired by relational parametricity and uses free theorems for proving the consistency conditions. It works beautifully.

Model transformations to bridge concrete and abstract syntax of web rule languages

This paper presents a solution to bridging the abstract and concrete syntax of a Web rule languages by using model transformations. Current specifications of Web rule languages such as Semantic Web Rule Language (SWRL) or RuleML define their abstract syntax (e.g., metamodel) and concrete syntax (e.g., XML schema) separately. Although the recent research in the area of Model-Driven Engineering (MDE) demonstrates that such a separation of two types of syntax is a good practice (due to the complexity of languages), one should also have tools that check validity of rules written in a concrete syntax with respect to the abstract syntax of the rule language. In this study, we use the REWERSE I1 Rule Markup Language (R2ML), SWRL, and Object Constraint Language (OCL), whose abstract syntax is defined by using metamodeling, while their textual concrete syntax is defined by using either XML/RDF schema or Extended Backus-Naur Form (EBNF) syntax. We bridge this gap by a bi-directional transformation defined in a model transformation language (ATLAS Transformation Language, ATL). This transformation allowed us to discover a number of issues in both web rule language metamodels and their corresponding concrete syntax, and thus make them fully compatible. This solution also enables for sharing web rules between different web rule languages.