Integrating Analytical Models with Descriptive System Models: Implementation of the OMG SyML Standard for the Tool-specific Case of MapleSim and MagicDraw

AbstractThe Jet Propulsion Laboratory (JPL) is investing heavily in the development of an infrastructure for building system models using the Systems Modeling Language (SysML). An essential component is a transformation apparatus that permits diverse models to be integrated independently of their nature (e.g. declarative, analytical and statistical). This paper presents one useful case: the integration of analytical models expressed using the Modelica language. Modelica is an open standard, declarative, multi-domain modeling language that allows for complex dynamic systems to be modeled. Maplesoft's MapleSim is one software tool that supports the Modelica language. The tool-neutral specification for the transformation between the languages Modelica and SysML is defined in the SysML-Modelica transformation specification (SyML) standard published by the Object Management Group (OMG). As part of the development efforts, said specification has been implemented using the Query-View- Transformation Operational (QVTO) language. During the process, several critical changes to the current SyML standard were proposed. Furthermore, a number of current limitations related to MapleSim were identified. Despite these issues, a proof-of- concept transformation was successfully implemented. In conclusion, the integration of complex simulation models conforming to the Modelica language with SysML-based system models has shown great promise and is a highly useful tool to support the decision making process in design

Goal-conflict detection based on temporal satisfiability checking

Goal-oriented requirements engineering approaches propose capturing how a system should behave through the speci ca- tion of high-level goals, from which requirements can then be systematically derived. Goals may however admit subtle situations that make them diverge, i.e., not be satis able as a whole under speci c circumstances feasible within the domain, called boundary conditions . While previous work al- lows one to identify boundary conditions for con icting goals written in LTL, it does so through a pattern-based approach, that supports a limited set of patterns, and only produces pre-determined formulations of boundary conditions. We present a novel automated approach to compute bound- ary conditions for general classes of con icting goals expressed in LTL, using a tableaux-based LTL satis ability procedure. A tableau for an LTL formula is a nite representation of all its satisfying models, which we process to produce boundary conditions that violate the formula, indicating divergence situations. We show that our technique can automatically produce boundary conditions that are more general than those obtainable through existing previous pattern-based approaches, and can also generate boundary conditions for goals that are not captured by these patterns