Thinging Machines for Requirements Engineering: Superseding Flowchart-Based Modeling
- URL: http://arxiv.org/abs/2501.16712v1
- Date: Tue, 28 Jan 2025 05:30:45 GMT
- Title: Thinging Machines for Requirements Engineering: Superseding Flowchart-Based Modeling
- Authors: Sabah Al-Fedaghi,
- Abstract summary: It is claimed that present elicitation of requirements models focus on collecting information using natural language.<n>It is proposed that a solution to this problem involves using complexity theory, transdisciplinarity, multidimensionality and knowledge management.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: This paper directs attention to conceptual modeling approaches that integrate advancements and innovations in requirements engineering. In some current (2024) works, it is claimed that present elicitation of requirements models focus on collecting information using natural language, which yields ambiguous specifications. It is proposed that a solution to this problem involves using complexity theory, transdisciplinarity, multidimensionality and knowledge management. Examples are used to demonstrate how such an approach helps solve the problem of quality and reliability in requirements engineering. The modeling method includes flowchart-like diagrams that show the relationships among system components and values in various modes of operation as well as path graphs that represent the system behavior. This paper focuses on the diagrammatic techniques in such approaches, with special attention directed to flowcharting (e.g., UML activity diagrams, business process model and notation (BPMN) business process diagrams). We claim that diagramming methods based on flowcharts is an outdated technique, and we promote an alternative diagrammatic modeling methodology based on thinging machines (TMs). TMs involve a high-level diagrammatic representation of a real-world system that integrates various component specifications to be refined into a more concrete executable form. TM modeling is a valuable tool to integrate requirements elicitation and address present challenges comprehensively. To demonstrate that, case studies are re-modeled using TMs. A TM model involves static, dynamic diagrams and event chronology charts. This study contrasts the flowchart-based and the TM approaches. The results point to the benefits of adopting the TM diagramming method.
Related papers
- Textual-Based vs. Thinging Machines Conceptual Modeling [0.0]
Software engineers typically interpret the domain description in natural language and translate it into a conceptual model.<n>Three approaches are used in this domain modeling: textual languages, diagrammatic languages, and a mixed based of text and diagrams.
arXiv Detail & Related papers (2025-06-03T09:00:26Z) - Transformer-Based Multimodal Knowledge Graph Completion with Link-Aware Contexts [3.531533402602335]
Multimodal knowledge graph completion (MMKGC) aims to predict missing links in multimodal knowledge graphs (MMKGs)
Existing MMKGC approaches primarily extend traditional knowledge graph embedding (KGE) models.
We propose a novel approach that integrates Transformer-based KGE models with cross-modal context generated by pre-trained VLMs.
arXiv Detail & Related papers (2025-01-26T22:23:14Z) - Towards Synthetic Trace Generation of Modeling Operations using In-Context Learning Approach [1.8874331450711404]
We propose a conceptual framework that combines modeling event logs, intelligent modeling assistants, and the generation of modeling operations.
In particular, the architecture comprises modeling components that help the designer specify the system, record its operation within a graphical modeling environment, and automatically recommend relevant operations.
arXiv Detail & Related papers (2024-08-26T13:26:44Z) - Model Merging in LLMs, MLLMs, and Beyond: Methods, Theories, Applications and Opportunities [89.40778301238642]
Model merging is an efficient empowerment technique in the machine learning community.
There is a significant gap in the literature regarding a systematic and thorough review of these techniques.
arXiv Detail & Related papers (2024-08-14T16:58:48Z) - CogCoM: Train Large Vision-Language Models Diving into Details through Chain of Manipulations [61.21923643289266]
Chain of Manipulations is a mechanism that enables Vision-Language Models to solve problems step-by-step with evidence.
After training, models can solve various visual problems by eliciting intrinsic manipulations (e.g., grounding, zoom in) actively without involving external tools.
Our trained model, textbfCogCoM, achieves state-of-the-art performance across 9 benchmarks from 4 categories.
arXiv Detail & Related papers (2024-02-06T18:43:48Z) - Sparse Graphical Linear Dynamical Systems [1.6635799895254402]
Time-series datasets are central in machine learning with applications in numerous fields of science and engineering.
This work proposes a novel approach to bridge the gap by introducing a joint graphical modeling framework.
We present DGLASSO, a new inference method within this framework that implements an efficient block alternating majorization-minimization algorithm.
arXiv Detail & Related papers (2023-07-06T14:10:02Z) - FAENet: Frame Averaging Equivariant GNN for Materials Modeling [123.19473575281357]
We introduce a flexible framework relying on frameaveraging (SFA) to make any model E(3)-equivariant or invariant through data transformations.
We prove the validity of our method theoretically and empirically demonstrate its superior accuracy and computational scalability in materials modeling.
arXiv Detail & Related papers (2023-04-28T21:48:31Z) - Methodology for Holistic Reference Modeling in Systems Engineering [0.0]
This paper presents a holistic approach to describe reference models across different views and levels.
Benefits include an end-to-end traceability of the capability coverage with performance parameters considered already at the starting point of the reference design.
arXiv Detail & Related papers (2022-11-21T13:41:07Z) - TCL: Transformer-based Dynamic Graph Modelling via Contrastive Learning [87.38675639186405]
We propose a novel graph neural network approach, called TCL, which deals with the dynamically-evolving graph in a continuous-time fashion.
To the best of our knowledge, this is the first attempt to apply contrastive learning to representation learning on dynamic graphs.
arXiv Detail & Related papers (2021-05-17T15:33:25Z) - Goal-Aware Prediction: Learning to Model What Matters [105.43098326577434]
One of the fundamental challenges in using a learned forward dynamics model is the mismatch between the objective of the learned model and that of the downstream planner or policy.
We propose to direct prediction towards task relevant information, enabling the model to be aware of the current task and encouraging it to only model relevant quantities of the state space.
We find that our method more effectively models the relevant parts of the scene conditioned on the goal, and as a result outperforms standard task-agnostic dynamics models and model-free reinforcement learning.
arXiv Detail & Related papers (2020-07-14T16:42:59Z) - Automated Diagram Generation to Build Understanding and Usability [0.0]
Causal loop and stock and flow diagrams are broadly used in System Dynamics because they help organize relationships and convey meaning.
This paper demonstrates how that information can be clearly presented in an automatically generated causal loop diagram.
arXiv Detail & Related papers (2020-05-27T22:32:16Z) - Tensor Graph Convolutional Networks for Multi-relational and Robust
Learning [74.05478502080658]
This paper introduces a tensor-graph convolutional network (TGCN) for scalable semi-supervised learning (SSL) from data associated with a collection of graphs, that are represented by a tensor.
The proposed architecture achieves markedly improved performance relative to standard GCNs, copes with state-of-the-art adversarial attacks, and leads to remarkable SSL performance over protein-to-protein interaction networks.
arXiv Detail & Related papers (2020-03-15T02:33:21Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.