Search

BPMN process models have been widely used in software designs. The BPMN process models are characterized by a static graph-oriented modeling language and a lack of analytical capabilities as well as dynamic behavior verification capabilities, which not only leads to inconsistencies in the semantics of the BPMN process models, but also leads to a lack of model error detection capabilities for the BPMN process models, which also hinders the correctness verification and error correction efforts of the models. In this study, we propose an executable modeling approach for CPN-based data flow well-structured BPMN (dw-BPMN) process models, and consider both control-flow and data-flow perspectives. First, we present a formal definition of the dw-BPMN process model, which is formally mapped into a CPN executable model in three steps: splitting, mapping and combining. Then, we discuss four types of data flow errors that can occur in the model: missing, lost, redundant, and inconsistent data error. To detect these four data flow errors, we propose a detection method based on the execution results of the CPN model. Subsequently, we propose correction strategies for these four data flow errors. Finally, a dw-BPMN process model of a robot’s temperature detection system for COVID-19 prevention and control in a kindergarten was used as an example to verify the validity of the method.

Information systems alignment with enterprise evolution affects the performance of enterprises. The systems conceptual and data quality, development time and sustainable life cycle management, are issues for enterprise competitiveness. The ability to directly generate enterprise information systems from models has been thought of as a solution to improve on these issues. Model-driven systems have been a research topic for decades. Fundamental principles for a proven model-driven information systems architecture are outlined in this article. Architectural foundation is a separation of user communities conceptual domain from the information technical domain. The users domain is modeled as an information system model in three layers, conceptual data logic model, interface model and user community model. The technical domain is a platform, allowing the modeling and execution of such a model. These principles have been applied in practice and proven viable. Two platforms and applications, which adhere to these principles, are briefly described.

The cross-line operation mode, based on interoperability technology, is becoming increasingly common in urban rail transits (URTs). Compared to trains running on a single line, cross-line trains can greatly facilitate transfer passengers. Taking the scenario of emergent large transfer passenger flow as an example, this paper explores the train rescheduling problem for serving transfer passengers by adding a cross-line backup train. To maximize the number of transfer passengers served by the cross-line backup train, a nonlinear optimization model is constructed by taking into account the operation parameters of planned trains on relevant lines, the deviation degree of the planned timetable, the utilization of the cross-line backup train, and the passenger flow calculation as constraints, and some linearization lemmas are proposed to transform it into a mixed integer programming (MIP) model with quadratic terms. A case study is conducted to discuss the impact of parameter changes on the objective function value and the applicability of different solution approaches. The results suggest that the operation trajectory of the cross-line backup train has an effect on the objective function value, which is related to the demand, the deviation tolerance of the planned timetable, and the running efficiency tolerance of the cross-line backup train. The corresponding methods help guide the organization of the cross-line backup train for large transfer passenger flow scenarios.

Model transformation testing has become crucial as model‐driven engineering has raised the abstraction level for developing software systems. Transformation is written to transform models from one level of abstraction to another, for example, model to model or model to code. A major challenge in testing the transformation is the creation of test models, such that (i) they conform to the source meta‐model (i.e., multiplicities and Object Constraint Language [OCL] constraints on meta‐model) and (ii) they provide coverage of the complete transformation (solving branch conditions for traversing all paths). Manual creation of test models requires a lot of time and effort. Still, the validity of the developed test models cannot be ensured. This paper aims to solve the above challenges using an automated search‐based strategy. The proposed approach is two‐stepped. First, valid test models are generated by solving source meta‐model constraints. Second, the generated models are evolved for achieving the structural coverage of the transformation by solving the branch conditions. A toolset model transformation testing environment (MOTTER) is developed to automate the search‐based solution. The proposed work is empirically evaluated on two case studies using four search algorithms. The result reflects that it successfully generates valid test models for achieving desired structural coverage with high performance on both the case studies. [ABSTRACT FROM AUTHOR]

Executable engines for relational model-transformation languages evolve continuously because of language extension, performance improvement and bug fixes. While new versions generally change the engine semantics, end-users expect to get backward-compatibility guarantees, so that existing transformations do not need to be adapted at every engine update. The CoqTL model-transformation language allows users to define model transformations, theorems on their behavior and machine-checked proofs of these theorems in Coq. Backward-compatibility for CoqTL involves also the preservation of these proofs. However, proof preservation is challenging, as proofs are easily broken even by small refactorings of the code they verify. In this paper, we present the solution we designed for the evolution of CoqTL. We provide a deep specification of the transformation engine, including a set of theorems that must hold against the engine implementation. Then, at each milestone in the engine development, we certify the new version of the engine against this specification, by providing proofs of the impacted theorems. The certification formally guarantees end-users that all the proofs they write using the provided theorems will be preserved through engine updates. We illustrate the structure of the deep specification theorems, we produce a machine-checked certification of three versions of CoqTL against it, and we show examples of user proofs that leverage this specification and are thus preserved through the updates. Finally, we discuss the evolution of the deep specification by an extension mechanism, we present an evolution that introduces trace links in the specification, and we show which user proofs are preserved through specification evolutions. [ABSTRACT FROM AUTHOR]

The Object Management Group (OMG) has put considerable effort into the standardization of various business modeling aspects within the context of model-driven systems development. Indeed, the Business Process Model and Notation (BPMN) is now arguably the most popular process modeling language. At the same time, the Semantics of Business Vocabulary and Business Rules (SBVR), which is a novel and formally sound standard for the specification of virtually any kind of knowledge using controlled natural language, is also gaining its grounds. Nonetheless, the integration between these two very much related standards remains weak. In this paper, we present one such integration effort, namely an approach for the extraction of SBVR process rules from BPMN processes. To accomplish this, we utilized model-to-model transformation technology, which is one of the core features of Model-Driven Architecture. At the core of the presented solution stands a set of model transformation rules and two algorithms specifying the formation of formally defined process rules from process models. Basic implementation aspects, together with the source code of the solution, are also presented in the paper. The experimental results acquired from the automatic model transformation have shown full compliance with the benchmark results and cover the entirety of the specified flow of work defined in the experimental process models. Following this, it is safe to conclude that the set of specified transformation rules and algorithms was sufficient for the given scope of the experiment, providing a solid background for the practical application and future developments of the solution. [ABSTRACT FROM AUTHOR]

Since its 3.3 release, Modelica offers the possibility to specify models of dynamical systems with multiple modes having different DAE-based dynamics. However, the handling of such models by the current Modelica tools is not satisfactory, with mathematically sound models yielding exceptions at runtime. In this article, we propose several contributions to this multifaceted issue, namely: an efficient and scalable multimode extension of the structural analysis of Modelica models; a systematic way of rewriting a multimode Modelica model, based on this analysis, so that the rewritten model is guaranteed to be correctly compiled by state-of-the-art Modelica tools; a proposal for the handling of the consistent initialization of multimode models; multimode structural analysis algorithms that handle both multiple modes and mode change events in a unified framework, coupled with a compile-time algorithm for identifying and quantifying impulsive behaviors at mode changes. Our approach is illustrated on relevant example models, and the performance of our implementations is assessed on a variable dimension large-scale model. [ABSTRACT FROM AUTHOR]

Blockchain technology has the advantages of decentralization,non-tampering,and traceability,and has been widely used in various fields.However,as a cutting-edge technology,blockchain has problems in development and high learning costs,and most developers are more familiar with application development methods based on relational databases,that is operating relational databases through SQL.Hyperledger Fabric is the most mainstream blockchain development framework.In response to this pro-blem,the article proposes a SQL access framework for Hyperledger Fabric.First of all,in view of the inconsistency of the underlying storage structure of Fabric and SQL,the conversion rules from relational model to key-value model are defined and implemented the model conversion algorithm.Second,the SQL execution contract is developed based on smart contract technology,which realizes the automatic transformation from SQL statement to CouchDB operation statement,and then operates the under-lying data of Fabric.Finally,from the perspective of application layer development,an application automation refactoring tool is designed.The tool consists of two parts,including the application refactoring tool and the blockchain.Fabric-Driver is an interactive middleware for the network.The experimental results show that compared with the existing scheme,using the proposed framework to develop blockchain applications can save about 82% of the time,the reading and writing performance of using this framework is less than 5%.

Traditional reliability analysis methods such as Reliability Block Diagram, Fault Tree Analysis, and Markov Analysis are all subjective methods whose results significantly depend on the analysts’ skills and experiences. A model-based reliability method is proposed for the wheel brake system by using the architectural analysis and design language (AADL). The wheel brake system is modeled based on the AADL, and the AADL Error Model Annex is applied to describe the fault propagation of the system. An information extraction approach is proposed for the AADL-based model, and rules for transforming AADL-based models to colored Petri nets are given according to the information extracted. The reliability analysis of the wheel brake system is conducted in terms of the Colored Petri Nets. Through Monte Carlo simulation and linear regression, it is inferred that the lifetime of the wheel brake system follows a Weibull distribution with shape parameter 1.303 and scale parameter 9.992 × 103, and the accuracy of the method has been verified. In this study, the reliability analysis results are generated via the system model automatically; they do not depend on the analysts’ experiences and skills, and ambiguity among different analysts can be avoided.

In the existing papers considering the stability analysis of discrete-time systems with distributed delays via the Lyapunov-Krasovskii functional (LKF) method, the delay kernels are normally restricted to be non-negative. In this paper, we aim to remove such a restriction and deal with the stability analysis of systems with arbitrary delay kernels. For this purpose, a kernel-related summation inequality is first constructed. Then, a stability condition is derived based on the proposed inequality and a model transformation. Finally, two numerical examples are presented to show that the proposed stability condition not only has a wider scope of application and is less conservative than the existing ones. [ABSTRACT FROM AUTHOR]

This paper considers the issue of linear-quadratic regulator (LQR) design for nonlinear systems with the use of smooth state and input transformations. The proposed design methodology is considered in the stabilisation task of the Pendubot, which is based on the concept of feedback equivalent control systems. It turns out that it is possible to find a controller that ensures comparable dynamics of the closed-loop system in the vicinity of the set point regardless of the state-space representation adopted. In addition, the synthesis of suboptimal controllers according to the LQR strategy ensuring equal dynamics at the equilibrium point is presented. The properties of the studied controllers were investigated in a simulation environment and using experimental tests. The detailed forms of transformations and linear approximations given can be regarded as ready-made procedures that can be applied to stabilise similar mechanical systems in robotics. [ABSTRACT FROM AUTHOR]

Maintaining software artifacts is a complex and time-consuming task. Like any other program, model transformations are subject to maintenance. In a maintenance process, much effort is dedicated to the comprehension of programs. To this end, several techniques are used, such as feature location and design pattern detection. In the particular case of model transformations, detecting design patterns contributes to a better comprehension as they carry valuable information on the transformation structure. In this paper, we propose a generic approach to detect, semi-automatically, design patterns and their variations in model transformations. Our approach encodes both design patterns and transformations as strings and use a string-matching algorithm for the detection. The approach is able to detect complete and partial implementations of design patterns in transformations, which is useful to refactoring and improving model transformations. [ABSTRACT FROM AUTHOR]

To aid in making software bug-free, several high-tech companies are moving from coding to modelling. In some cases model checking techniques are explored or have already been adopted to get more value from these models. This also holds for Canon Production Printing, where the language OIL was developed for modelling control-software components. In this paper, we present OIL and give its semantics. We define a translation from OIL to mCRL2 to enable the use of model checking techniques. Moreover, we discuss validity requirements on OIL component specifications and show how these can be formalised and verified using model checking. To test the feasibility of these techniques, we apply them to two models of systems used in production. [ABSTRACT FROM AUTHOR]

Model transformation (MT) contributes a major role in the model-driven engineering (MDE), which are used to transfer the models among various languages to refactor and simulate the models or to obtain the useful codes from the models. Thus, the need for MT in MDE is very important, but the practical methods are not suitable for the detection of errors in transformations. This paper proposes an advanced algorithm, called fractional whale optimization integrated adaptive dragonfly (F-WOADF) algorithm to perform the MT from the class diagram (CLD) to relational schema (RS) model. The proposed algorithm modifies the adaptive dragonfly (ADF) algorithm with the concept of whale optimization algorithm (WOA) using the fractional theory. The UML CLD is transformed into the RS model using the optimal blocks that are selected with the use of the proposed algorithm. The performance of the F-WOADF method is evaluated using automatic correctness (AC), and fitness measure. The proposed method produces the maximum AC of 0.8583 and the maximum fitness measure of 0.8984 that indicates the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

Parallel scheduling of multiple real-time applications onto heterogeneous processors is needed in the emerging embedded systems such as self-driving cars, smart cameras, and smartphones. Assuming that an embedded application is specified as a synchronous dataflow (SDF) graph or its extension, we propose a novel parallel scheduling methodology based on an evolutionary algorithm where the mapping of tasks onto processors is evolved to optimize a given objective function in an iterative fashion. In each iteration, we use an existing worst-case response time (WCRT) analysis tool to check if all applications satisfy their real-time requirements by translating each SDF graph into a directed acyclic graph (DAG) that is assumed in the WCRT analysis tool. Since the WCRT analysis must be performed in each iteration of evolution, we propose a clustering technique to reduce drastically the analysis time that depends on the number of nodes and their dependency. We formally prove that the proposed clustering technique does not change the estimated WCRT of each application. The effectiveness of the proposed scheduling methodology with the clustering technique is verified with extensive experiments using real-life benchmarks, randomly generated graphs, and the comparison with the existing technique.

The ever-increasing number of mobile platforms constitutes a challenge for application developers, who must develop efficient mobile applications for multiple platforms. Recently, a specific interest is being taken in the Model Based User Interface Development (MBUID) by Software Engineering Community. In such paradigm, an application’s user interface is obtained by defining models and transformations of those models. This paper aim at adopting MBUID paradigm to address the problem of mobile application development. As such, we propose a new approach and its support system for the automatic generation of mobile user interfaces. The approach and the system are based on a set of standards and relevant technologies such as EMF, GMF, ATL, and Xpand. A case study is presented, in the paper, with the aim of verifying the usefulness of this approach.

In the early phases of the software development process, specifications are mostly written in a natural language rather than formal models, which is not supported by the Model Driven Architecture (MDA). For this reason, the Semantic of Business Vocabulary and Rules (SBVR) is proposed by the Object Management Group to represent the textual specifications in a language comprehensible by both of humans and machines, to facilitate its integration in the MDA lifecycle. However, businesspeople are usually not familiar with SBVR standard. In this paper we present an approach to automatically transform textual business rules to an SBVR model, to facilitate its integration in nowadays information technology infrastructures. Our approach is distinguished from existing works in that it uses an in-depth Natural Language Processing to extract a more comprehensible SBVR model that includes the semantic formulation of each business rule statement, coupled with a Terminological Dictionary of extracted concepts, to which we have added further specifications such as definitions and synonyms. The evaluation of our approach shows that for three sets of business rules statements taken from different domains, we could generate the correct meaning with an average of F1-score exceeding 87%.

Model-based software engineering has made great strides in developing new software that would outshine traditional methodology. Due to this, well-defined support has been provided for process modeling by the introduction of varieties of notations to develop the UML models. In addition to this, Business Process Modeling (BPM) is a pioneer in introducing process models with domain knowledge representation. Most of the software has similarities based on their operations, structures, validation, and so on. So, an automatic process involvement supports them in terms of cost and duration. This proposed secure Business Process Model will support the development phase and help incorporate the security code along with customer requirements. The proposed Secured Business Process (SecBP) system is an automation process to fine-tune the software engineering design process automatically. Security requirement incorporation requires an image to text and vice versa conversion at the early stages of the software design process. The security integration process is optimized by a decision learning algorithm. Hence the proposed system brings an output model as a domain-specific model with security mapping. [ABSTRACT FROM AUTHOR]

RoboChart is a timed domain-specific language for robotics, distinctive in its support for automated verification by model checking and theorem proving. Since uncertainty is an essential part of robotic systems, we present here an extension to RoboChart to model uncertainty using probabilism. The extension enriches RoboChart state machines with probability through a new construct: probabilistic junctions as the source of transitions with a probability value. RoboChart has an accompanying tool, called RoboTool, for modelling and verification of functional and real-time behaviour. We present here also an automatic technique, implemented in RoboTool, to transform a RoboChart model into a PRISM model for verification. We have extended the property language of RoboTool so that probabilistic properties expressed in temporal logic can be written using controlled natural language. [ABSTRACT FROM AUTHOR]

Summary: Modeling and specifying correct software systems is a challenging task that can be supported by providing appropriate modeling abstractions. This article proposes an approach for graphical multiscale modeling of such systems using model transformation techniques. The approach is founded on a guided rule‐based iterative modeling process ensuring controlled transition from a coarse‐grained description to a fine‐grained description. It provides also user‐friendly graphical descriptions by extension of UML notations, hence preserving the common practices from software architectures design. The iterative design process is supported by a set of model transformation rules. The rules manage the refinement process (by adding or removing subsystems or by adding or removing details on a given subsystem) as a model transformation. Our approach is supported by a rule‐based generator that implements the automatic transformation of UML diagrams into Event‐B specifications allowing formal verification of their correctness properties, and relieving software architects of mastering formal techniques. To experiment and validate our approach, we consider a case study dedicated to the smart cities. [ABSTRACT FROM AUTHOR]

In the last years, mobile applications have gained a lot of importance in the software industry, since every day more people become users of mobile devices and companies create a lot of mobile applications to keep competitive in the market. Then, it has become necessary to adopt new strategies that help the industry produce applications that can be extensible, scalable, testable, and deployable effectively and efficiently. Based on this, several architectural approaches have been proposed to provide the required features in mobiles applications. In the paper, we propose an approach that uses concepts of modeldriven engineering and model-driven architecture to build a model to text transformation that allows generating Android applications using Clean Architecture. [ABSTRACT FROM AUTHOR]

Data integration is one of the core responsibilities of EDM (enterprise data management) and interoperability. It is essential for almost every digitalization project, e.g., during the migration from a legacy ERP (enterprise resource planning) software to a new system. One challenge is the incompatibility of data models, i.e., different software systems use specific or proprietary terminology, data structures, data formats, and semantics. Data need to be interchanged between software systems, and often complex data conversions or transformations are necessary. This paper presents an approach that allows software engineers or data experts to use models and patterns in order to specify data integration: it is based on data models such as ER (entity-relationship) diagrams or UML (unified modeling language) class models that are well-accepted and widely used in practice. Predefined data integration patterns are combined (applied) on the model level leading to formal, precise, and concise definitions of data transformations and conversions. Data integration definitions can then be executed (via code generation) so that a manual implementation is not necessary. The advantages are that existing data models can be reused, standardized data integration patterns lead to fast results, and data integration specifications are executable and can be easily maintained and extended. An example transformation of elements of a relational data model to object-oriented data structures shows the approach in practice. Its focus is on data mappings and relationships. [ABSTRACT FROM AUTHOR]

Healthcare processes have many particularities captured and described within standards for medical information exchange such as HL7 FHIR. BPMN is a widely used standard to create readily understandable processes models. We show an approach to integrate both these standards via an automated transformation mechanism. This will allow us to use the various tools available for BPMN to visualize and automate processes in the healthcare domain. In the future we plan to extend this approach to enable mining and analyzing executed processes. [ABSTRACT FROM AUTHOR]

This paper deals with modeling and verification of software systems by combining UML diagrams and Pi-calculus. UML 2.0 Activity diagrams are used for modeling the behavior of software systems, while Pi-calculus is used for semantic and verification purposes. More precisely, UML is a semi-formal language and so it needs formal semantics for its constructs and lacks tools for verifying properties. To this end, we propose an approach and a tool called AD2PICALC for transforming UML 2.0 Activity diagrams to Pi-calculus processes using Eclipse Xpand and TGG tools. The obtained Pi-calculus processes are then used as input for Pi-calculus tools, like MWB, to verify some properties as deadlocks, safety, determinism, termination and livelock. We illustrate our contribution through an example from the literature and verify the property of deadlock using MWB tool. The main contribution of this paper lies in the automation of the transformation approach using TGG tools.

Software Architecture (SA) generally has a considerable influence on software quality attributes. Coordination of software architecture to the requirements of the stakeholders and avoiding common mistakes and faults in designing SA increases the chance of success of the project and satisfaction of the stakeholders. Making the wrong decisions at the architectural design phase usually proves very costly later on. Refactoring is a method which helps in detecting and avoiding complications, improving the internal characteristics of software, while keeping the external behavior intact. Various problems can undermine the architecture refactoring process. The existence of different requirements in different domains, the diversity of architecture description languages, and the difficulty of describing refactoring patterns lead to the difficulty of performing automatic and semi-automatic refactoring on the SA. In this study, we use model transformation as a way to overcome the above mentioned difficulties. In this regard, the first step is converting the SA to a pivot-model. Then, based on the refactoring patterns, the refactoring process is performed on the pivotmodel. And finally, the pivot-model is converted back to the original (source) model. In this paper, the requirements of the stakeholders are taken into account in the refactoring process by modeling them as refactoring goals. These goals show the importance of the quality attributes in the project and the process of refactoring. The applicability of the framework is demonstrated using a case study.