Einloggen

Thematische Bibliographien / UML Graph / Zeitschriftenartikel

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: UML Graph.

Zeitschriftenartikel zum Thema „UML Graph“

Autor: Grafiati

Veröffentlicht am 28. Juni 2021

Zuletzt aktualisiert am 18. Februar 2022

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-50 Zeitschriftenartikel für die Forschung zum Thema "UML Graph" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Zeitschriftenartikel für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

Chama, Wafa, Allaoua Chaoui und Seidali Rehab. „Formal Modeling and Analysis of Object Oriented Systems using Triple Graph Grammars“. International Journal of Embedded and Real-Time Communication Systems 6, Nr. 2 (April 2015): 48–64. http://dx.doi.org/10.4018/ijertcs.2015040103.

Der volle Inhalt der Quelle

Annotation:

This paper proposes a Model Driven Engineering automatic translation approach based on the integration of rewriting logic formal specification and UML semi-formal models. This integration is a contribution in formalizing UML models since it lacks for formal semantics. It aims at providing UML with the capabilities of rewriting logic and its Maude language to control and detect incoherencies in their diagrams. Rewriting logic Maude language allows simulation and verification of system's properties using its LTL model-checker. This automatic translation approach is based on meta-modeling and graph transformation since UML diagrams are graphs. More precisely, the authors have proposed five meta-models and three triple graph grammars to perform the translation process. The authors have used Eclipse Generative Modeling tools: Eclipse Modeling Framework (EMF) for meta-modeling, Graphical Modeling Framework (GMF) for generating visual modeling tools and TGG Interpreter for proposing triple graph grammars. The approach is illustrated through an example.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Ziemann, Paul, Karsten Hölscher und Martin Gogolla. „From UML Models to Graph Transformation Systems“. Electronic Notes in Theoretical Computer Science 127, Nr. 4 (April 2005): 17–33. http://dx.doi.org/10.1016/j.entcs.2004.10.025.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Eiglsperger, Markus, Carsten Gutwenger, Michael Kaufmann, Joachim Kupke, Michael Jünger, Sebastian Leipert, Karsten Klein, Petra Mutzel und Martin Siebenhaller. „Automatic Layout of UML Class Diagrams in Orthogonal Style“. Information Visualization 3, Nr. 3 (22.07.2004): 189–208. http://dx.doi.org/10.1057/palgrave.ivs.9500078.

Der volle Inhalt der Quelle

Annotation:

Unified modelling language (UML) diagrams have become increasingly important in engineering and re-engineering processes for software systems. Of particular interest are UML class diagrams whose purpose is to display generalizations, associations, aggregations, and compositions in one picture. The combination of directed and undirected relations poses a special challenge to a graph layout tool. Current approaches for the automatic layout of class diagrams are based on the layered graph drawing paradigm. These algorithms produce good results for class diagrams with large and deep structural information, that is, diagrams with a large and deep inheritance hierarchy. However, they do not perform satisfactorily in absence of this information. We suggest to use the topology-shape—metrics paradigm for automatic layout of class diagrams, which has been used very successfully for drawing undirected graphs in orthogonal style. Moreover, we introduce the algorithms UML-Kandinsky and GoVisual fitting into this paradigm. Both algorithms work for class diagrams with rich structural information as well as for class diagrams with few or no structural information. Therefore, they improve the existing algorithms significantly.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Anas, Outair, Tanana Mariam und Lyhyaoui Abdelouahid. „New method for summative evaluation of UML class diagrams based on graph similarities“. International Journal of Electrical and Computer Engineering (IJECE) 11, Nr. 2 (01.04.2021): 1578. http://dx.doi.org/10.11591/ijece.v11i2.pp1578-1590.

Der volle Inhalt der Quelle

Annotation:

This paper deals with the problem of the evaluation of the student's productions during the construction of a UML class diagram from textual speciations, which can be a tedious task for teachers. The main objective is to propose a method of summative and semi-automatic evaluation of the class diagrams produced by the students, in order to provide an educational reaction on the learning process, and to reduce the evaluation work for the teachers. To achieve this objective, we must analyze these productions and study the transformation, matching, similarity measurement and comparison of several UML graphs. From this study, we adopted a method based on the comparison and matching of the components of several UML diagrams. This proposal is applied to evaluate UML class diagrams and focuses on the structural and semantic aspects of the UML graph produced by students compared to several solutions proposed by the teacher.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Purchase, Helen C., Jo-Anne Allder und David Carrington. „Graph Layout Aesthetics in UML Diagrams: User Preferences“. Journal of Graph Algorithms and Applications 6, Nr. 3 (2002): 255–79. http://dx.doi.org/10.7155/jgaa.00054.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Gogolla, Martin, Paul Ziemann und Sabine Kuske. „Towards an Integrated Graph Based Semantics for UML“. Electronic Notes in Theoretical Computer Science 72, Nr. 3 (Februar 2003): 160–75. http://dx.doi.org/10.1016/s1571-0661(04)80619-4.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Hölscher, Karsten, Paul Ziemann und Martin Gogolla. „On translating UML models into graph transformation systems“. Journal of Visual Languages & Computing 17, Nr. 1 (Februar 2006): 78–105. http://dx.doi.org/10.1016/j.jvlc.2005.11.001.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Kuske, Sabine, Martin Gogolla, Hans-Jörg Kreowski und Paul Ziemann. „Towards an integrated graph-based semantics for UML“. Software & Systems Modeling 8, Nr. 3 (28.08.2008): 403–22. http://dx.doi.org/10.1007/s10270-008-0101-4.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Čech, Pavel. „Matching UML class models using graph edit distance“. Expert Systems with Applications 130 (September 2019): 206–24. http://dx.doi.org/10.1016/j.eswa.2019.04.008.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Kundu, Debasish, Debasis Samanta und Rajib Mall. „An Approach to Convert XMI Representation of UML 2.x Interaction Diagram into Control Flow Graph“. ISRN Software Engineering 2012 (07.03.2012): 1–22. http://dx.doi.org/10.5402/2012/265235.

Der volle Inhalt der Quelle

Annotation:

For automation of many software engineering tasks such as program analysis, testing, and coverage analysis, it is necessary to construct a control flow graph. With the advancement of UML, software practitioners advocate to construct control flow graph from some of the UML design artifacts. UML 2.x supports the modeling of control flow information in interaction diagram by means of message sequences and different types of fragments like alt, opt, break, loop, and so forth. Leading UML modeling tools, namely MagicDraw, IBM's Rational, and so forth export models in XMI format. Construction of control flow graph from the XMI representation of an interaction diagram is not straightforward as model elements of interaction diagram are captured in XMI by means of values of attributes of multiple tagged elements and correlations among these tagged elements is not explicitly specified. This paper proposes an approach for construction of control flow graph from XMI representation of UML 2.x interaction diagram. A prototype tool based on our approach has been developed which can be plugged in any computer-aided software engineering tool.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

Belghiat, Aissam, und Allaoua Chaoui. „Mapping Mobile Statechart Diagrams to the π-Calculus using Graph Transformation“. International Journal of Intelligent Information Technologies 12, Nr. 4 (Oktober 2016): 1–20. http://dx.doi.org/10.4018/ijiit.2016100101.

Der volle Inhalt der Quelle

Annotation:

Mobile UML (M-UML) has been proposed as an extension of UML to model mobile agent-based software systems. As UML, M-UML suffers from lack of formal semantics due to its semi-formal nature which penalize the verification of correct behavior of the modeled systems. This paper provides a graphical yet formal approach for the modeling, simulation and verification of mobile statechart diagrams using graph transformations in the AToM3 tool. The authors have firstly proposed meta-models for mobile statechart diagram and flowgraph. Then, a twofold graph grammar is developed for the automatic mapping of mo-bile statechart diagrams into flowgraphs and in the same time generates the cor-responding p-calculus specification. This graph grammar enables either execu-tion through simulation by flowgraphs or verification through model checking, using existing tools (e.g. the Mobility Workbench, MWB). An illustrative example of the authors' approach is provided.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

KONG, JUN, DIANXIANG XU und XIAOQIN ZENG. „UML-BASED MODELING AND ANALYSIS OF SECURITY THREATS“. International Journal of Software Engineering and Knowledge Engineering 20, Nr. 06 (September 2010): 875–97. http://dx.doi.org/10.1142/s0218194010004980.

Der volle Inhalt der Quelle

Annotation:

Poor design has been a major source of software security problems. Rigorous and designer-friendly methodologies for modeling and analyzing secure software are highly desirable. A formal method for software development, however, often suffers from a gap between the rigidity of the method and the informal nature of system requirements. To narrow this gap, this paper presents a UML-based framework for modeling and analyzing security threats (i.e. potential security attacks) rigorously and visually. We model the intended functions of a software application with UML statechart diagrams and the security threats with sequence diagrams, respectively. Statechart diagrams are automatically converted into a graph transformation system, which has a well-established theoretical foundation. Method invocations in a sequence diagram of a security threat are interpreted as a sequence of paired graph transformations. Therefore, the analysis of a security threat is conducted through simulating the state transitions from an initial state to a final state triggered by method invocations. In our approach, designers directly work with UML diagrams to visually model system behaviors and security threats while threats can still be rigorously analyzed based on graph transformation.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Depke, Ralph, Reiko Heckel und Jochen Malte Küster. „Formal agent-oriented modeling with UML and graph transformation“. Science of Computer Programming 44, Nr. 2 (August 2002): 229–52. http://dx.doi.org/10.1016/s0167-6423(02)00040-0.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Kong, Jun, Kang Zhang, Jing Dong und Dianxiang Xu. „Specifying behavioral semantics of UML diagrams through graph transformations“. Journal of Systems and Software 82, Nr. 2 (Februar 2009): 292–306. http://dx.doi.org/10.1016/j.jss.2008.06.030.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

RAFE, VAHID, ADEL T. RAHMANI und REZA RAFEH. „FORMAL ANALYSIS OF UML 2.0 ACTIVITIES USING GRAPH TRANSFORMATION SYSTEMS“. International Journal of Software Engineering and Knowledge Engineering 20, Nr. 05 (August 2010): 679–94. http://dx.doi.org/10.1142/s0218194010004918.

Der volle Inhalt der Quelle

Annotation:

Graph transformation is a general visual modeling language which is suitable for stating the dynamic semantics of the designed models formally. We present a highly understandable yet precise approach to formally define the behavioral semantics of UML 2.0 Activity diagrams by using graph transformation. In our approach we take into account control flow and data flow semantics. Our proposed semantics is based on token-like semantics and traverse-to-completion. The main advantage of our approach is automated formal verification and analysis of UML Activities. We use AGG to design Activities and we use our previous approach to model checking graph transformation system. Hereby, designers can verify and analyze designed Activity diagrams. Since workflow modeling is one of the main application areas of the Activities, we use our proposed semantics for modeling and verification of workflows to illustrate our approach.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Liamwiset, Chalida, und Vatanawood Wiwat. „Detection of Design Patterns in Software Design Model Using Graph“. Applied Mechanics and Materials 411-414 (September 2013): 559–62. http://dx.doi.org/10.4028/www.scientific.net/amm.411-414.559.

Der volle Inhalt der Quelle

Annotation:

Detection of design patterns in software design phase possibly ensures the non-functional requirements, regarding performance features, before investing the implementation. We formalize the structural UML class diagram using graph. By applying graph matching technique, we propose an alternative of subgraph matching algorithm to extract the local properties of the UML class diagrams and perform the detecting of subgraph of possible design patterns found in the target software design model.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Lukacs, D., und M. Toth. „Translating Erlang State Machines to UML Using Triple Graph Grammars“. Studia Universitatis Babeș-Bolyai Informatica 63, Nr. 1 (19.06.2018): 33–50. http://dx.doi.org/10.24193/subbi.2018.1.03.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Ziemann, Paul, Karsten Hölscher und Martin Gogolla. „Coherently Explaining UML Statechart and Collaboration Diagrams by Graph Transformations“. Electronic Notes in Theoretical Computer Science 130 (Mai 2005): 263–80. http://dx.doi.org/10.1016/j.entcs.2005.03.014.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Panigrahi, Satya Sobhan, und Ajay Kumar Jena. „Optimization of Test Cases in Object-Oriented Systems Using Fractional-SMO“. International Journal of Open Source Software and Processes 12, Nr. 1 (Januar 2021): 41–59. http://dx.doi.org/10.4018/ijossp.2021010103.

Der volle Inhalt der Quelle

Annotation:

This paper introduces the technique to select the test cases from the unified modeling language (UML) behavioral diagram. The UML behavioral diagram describes the boundary, structure, and behavior of the system that is fed as input for generating the graph. The graph is constructed by assigning the weights, nodes, and edges. Then, test case sequences are created from the graph with minimal fitness value. Then, the optimal sequences are selected from the proposed fractional-spider monkey optimization (fractional-SMO). The developed fractional-SMO is designed by integrating fractional calculus and SMO. Thus, the efficient test cases are selected based on the optimization algorithm that uses fitness parameters, like coverage and fault. Simulations are performed via five synthetic UML diagrams taken from the dataset. The performance of the proposed technique is computed using coverage and the number of test cases. The maximal coverage of 49 and the minimal number of test cases as 2,562 indicate the superiority of the proposed technique.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Outair, Anas, Abdelouahid Lyhyaoui und Mariam Tanana. „Towards an Automatic Evaluation of UML Class Diagrams by Graph Transformation“. International Journal of Computer Applications 95, Nr. 21 (18.06.2014): 36–41. http://dx.doi.org/10.5120/16721-7063.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

Grønmo, Roy, und Birger Møller-Pedersen. „From UML 2 Sequence Diagrams to State Machines by Graph Transformation.“ Journal of Object Technology 10 (2011): 8:1. http://dx.doi.org/10.5381/jot.2011.10.1.a8.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Chama, Wafa. „Model Checking and Code Generation for UML Diagrams Using Graph Transformation“. International Journal of Software Engineering & Applications 3, Nr. 6 (30.11.2012): 39–55. http://dx.doi.org/10.5121/ijsea.2012.3604.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Goto, Takaaki, Tadaaki Kirishima, Tetsuro Nishino, Takeo Yaku und Kensei Tsuchida. „Generation of UML package diagrams based on an attribute graph grammar“. Journal of Computational Science 5, Nr. 4 (Juli 2014): 606–15. http://dx.doi.org/10.1016/j.jocs.2014.02.005.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

Aouag, Mouna, Raida Elmansouri und Allaoua Chaoui. „From UML 2.0 diagrams to aspect oriented diagrams using graph transformation“. International Journal of Computer Aided Engineering and Technology 6, Nr. 2 (2014): 200. http://dx.doi.org/10.1504/ijcaet.2014.060309.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

Belghiat, Aissam, und Mustapha Bourahla. „UML Class Diagrams to OWL Ontologies: A Graph Transformation based Approach“. International Journal of Computer Applications 41, Nr. 3 (31.03.2012): 41–46. http://dx.doi.org/10.5120/5525-7566.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

Cabot, Jordi, Robert Clarisó, Esther Guerra und Juan de Lara. „A UML/OCL framework for the analysis of graph transformation rules“. Software & Systems Modeling 9, Nr. 3 (19.08.2009): 335–57. http://dx.doi.org/10.1007/s10270-009-0129-0.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Huang, C. Y., und X. G. Fu. „Study on the Computer Modeling Technology of Die Design and Engineering“. Advanced Materials Research 670 (März 2013): 45–47. http://dx.doi.org/10.4028/www.scientific.net/amr.670.45.

Der volle Inhalt der Quelle

Annotation:

UML modeling technology combines static modeling process (object graph) and dynamic modeling process (cooperation figure, sequence diagram), and the dynamic modeling process makes static modeling process move forward. This paper introduces the geometrical modeling technology of CAD/CAM, feature modeling technology, the characteristic modeling technology of UML and the application in the mould design.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Rahmoune, Yasmina, Allaoua Chaoui und Elhillali Kerkouche. „A Framework for Modeling and Analysis UML Activity Diagram using Graph Transformation“. Procedia Computer Science 56 (2015): 612–17. http://dx.doi.org/10.1016/j.procs.2015.07.261.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

Djaaboub, Salim, Elhillali Kerkouche und Allaoua Chaoui. „Generating verifiable LOTOS specifications from UML models: a graph transformation-based approach“. International Journal of Embedded Systems 10, Nr. 6 (2018): 453. http://dx.doi.org/10.1504/ijes.2018.095751.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Chaoui, Allaoua, Elhillali Kerkouche und Salim Djaaboub. „Generating verifiable LOTOS specifications from UML models: a graph transformation-based approach“. International Journal of Embedded Systems 10, Nr. 6 (2018): 453. http://dx.doi.org/10.1504/ijes.2018.10016822.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

Arifin, Mohammad Nazir, und Daniel Siahaan. „Structural and Semantic Similarity Measurement of UML Use Case Diagram“. Lontar Komputer : Jurnal Ilmiah Teknologi Informasi 11, Nr. 2 (13.07.2020): 88. http://dx.doi.org/10.24843/lkjiti.2020.v11.i02.p03.

Der volle Inhalt der Quelle

Annotation:

Reusing software has several benefits ranging from reducing cost and risk, accelerating development, and its primary purposes are improving software quality. In the early stage of software development, reusing existing software artifacts may increase the benefit of reusing software because it uses mature artifacts from previous artifacts. One of software artifacts is diagram, and in order to assist the reusing diagram is to find the level of similarity of diagrams. This paper proposes a method for measuring the similarity of the use case diagram using structural and semantic aspects. For structural similarity measurement, Graph Edit Distance is used by transforming each factor and use case into a graph, while for semantic similarity measurement, WordNet, WuPalmer,and Levenshtein were used. The experimentation was conducted on ten datasets from variousprojects. The results of the method were compared with the results of assessments from experts.The measurement of agreement between experts and method was done by using Gwet’s AC1 andPearson correlation coefficient. Measurement results with Gwet’s AC1 diagram similarity are 0,60,which were categorized as “moderate" agreement and the result of measurement with Pearsonis 0.506 which means there is a significant correlation between experts and methods. The resultshowed that the proposed method can be used to find the similarity of the diagram, so finding andreuse of the diagram as a software component can be optimized.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Kerkouche, Elhillali, Algeria Allaoua Chaoui, El Bay Bourennane und Ouassila Labbani. „A UML and Colored Petri Nets Integrated Modeling and Analysis Approach using Graph Transformation.“ Journal of Object Technology 9, Nr. 4 (2010): 25. http://dx.doi.org/10.5381/jot.2010.9.4.a2.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

Kerkouche, Elhillali, Khaled Khalfaoui und Allaoua Chaoui. „A rewriting logic-based semantics and analysis of UML activity diagrams: a graph transformation approach“. International Journal of Computer Aided Engineering and Technology 12, Nr. 2 (2020): 237. http://dx.doi.org/10.1504/ijcaet.2020.10026291.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

Kerkouche, Elhillali, Khaled Khalfaoui und Allaoua Chaoui. „A rewriting logic-based semantics and analysis of UML activity diagrams: a graph transformation approach“. International Journal of Computer Aided Engineering and Technology 12, Nr. 2 (2020): 237. http://dx.doi.org/10.1504/ijcaet.2020.105578.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

Kuzmina, E. A., und G. F. Nizamova. „Curriculum development based on the graph model“. Informatics and education, Nr. 5 (04.07.2020): 33–43. http://dx.doi.org/10.32517/0234-0453-2020-35-5-33-43.

Der volle Inhalt der Quelle

Annotation:

The article discusses the approach to planning interrelated work within a given number of time periods using the example of the formation of a curriculum of a higher educational institution based on the competence model of students. It is proposed to consider the task of forming a curriculum as an optimization task of cutting-packing, solved with the help of an ordered graph. A logical model of the curriculum is developed in the form of an N-layer ordered graph in which the vertices correspond to the disciplines of the curriculum, and the arcs specify the relations of the preceding of disciplines in semesters, the temporal preceding (following) of disciplines is set using the discipline following matrix. As a criterion for the optimality of the curriculum, the criterion of the uniformity of the study load and the criterion of minimum fines, which reflects the degree of compliance with the given causal relationships between the disciplines of the plan, are considered. The UML diagram of the components of the software package for the formation of curricula is developed, the functions of the developed software package are described. The software implementation of the developed models and algorithms is completed. An experiment was conducted, various curriculum options were obtained and analyzed. Their optimality was estimated based on the proposed criteria, the characteristics of the constructed curriculum options are given, recommendations are given for choosing the final curriculum version, taking into account the established priorities

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

DEPKE, RALPH, REIKO HECKEL und JOCHEN MALTE KÜSTER. „ROLES IN AGENT-ORIENTED MODELING“. International Journal of Software Engineering and Knowledge Engineering 11, Nr. 03 (Juni 2001): 281–302. http://dx.doi.org/10.1142/s0218194001000529.

Der volle Inhalt der Quelle

Annotation:

For the generic specification of protocols, goals, or workflows, many approaches to agent-oriented modeling provide a concept of role. Roles abstract from the concrete agents involved in an interaction. They provide means for the evolution of agents and serve as components of agent design. Despite the widespread usage of roles in agent-oriented modeling, a systematic analysis of the different aspects and properties of this concept is still missing. In this paper, we perform such an analysis and identify requirements for a general role concept. We develop such a role concept for a modeling approach based on the UML and graph transformation systems and exemplify its use for the specification (and application) of protocols. Finally, we provide a run-time semantics for roles based on concepts from the theory of graph transformation.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

Ramsaier, M., R. Stetter, M. Till und S. Rudolph. „ABSTRACT PHYSICS REPRESENTATION OF A BALANCED TWO-WHEEL SCOOTER IN GRAPH-BASED DESIGN LANGUAGES“. Proceedings of the Design Society: DESIGN Conference 1 (Mai 2020): 1057–66. http://dx.doi.org/10.1017/dsd.2020.32.

Der volle Inhalt der Quelle

Annotation:

AbstractThis paper presents a novel approach to include a holistic description of abstract physics in a digital engineering framework. Physical phenomena realize the numerous functions of technical systems and are an important link between rather abstract product functions and the concrete product geometry and material. Until now, a possibility to integrate the analysis and synthesis on this level of abstraction into a holistic engineering frameworks is not existing. The novel approach employs graph-based design languages using UML for this endeavour; the product example is a two-wheel scooter.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

SHIN, MICHAEL E., ALEXANDER H. LEVIS, LEE W. WAGENHALS und DAE-SIK KIM. „ANALYZING DYNAMIC BEHAVIOR OF LARGE-SCALE SYSTEMS THROUGH MODEL TRANSFORMATION“. International Journal of Software Engineering and Knowledge Engineering 15, Nr. 01 (Februar 2005): 35–60. http://dx.doi.org/10.1142/s0218194005001896.

Der volle Inhalt der Quelle

Annotation:

This paper describes model transformation for analyzing dynamic behavior of large-scale systems. The Unified Modeling Language (UML) based system model is transformed into the Colored Petri Nets (CPN) model, which is used for analyzing the scenarios of the use cases of a system and checking freedom of system deadlock at an early stage of software development. The CPN model that is executable is hierarchically structured on the basis of the functional decomposition of a large-scale system. The UML-based system model consisting of the use case model, class model and collaboration model is not executable so that the dynamic behavior of the system cannot be analyzed until implementation of the system. However, the UML-based system model has no hierarchical structure to be transformed into the hierarchical CPN model as well. The discrepancies of dynamic and structural views in the two models are resolved by transformation of the UML model into the layered, executable CPN model with three layers — the use case layer, object layer and operation layer. The model transformation is carried out using relationships among the use case model, class model, and collaboration model of the UML. With the executable CPN model transformed, the dynamic properties of the system are analyzed using the simulation technique, occurrence graph, and state space report provided by the Design/CPN tool. The approach in this paper is validated through two case studies — the gas station system and the distributed factory automation system.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Hermann, Frank, Hartmut Ehrig und Gabriele Taentzer. „A Typed Attributed Graph Grammar with Inheritance for the Abstract Syntax of UML Class and Sequence Diagrams“. Electronic Notes in Theoretical Computer Science 211 (April 2008): 261–69. http://dx.doi.org/10.1016/j.entcs.2008.04.048.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

Sun, J. K., Zhao Qian Li, Chuan Zhen Huang und Qi Gao. „Framework and Modeling of Networked Manufacturing for Automobile Die“. Key Engineering Materials 315-316 (Juli 2006): 30–34. http://dx.doi.org/10.4028/www.scientific.net/kem.315-316.30.

Der volle Inhalt der Quelle

Annotation:

To improve the collaboration efficiency of the networked manufacturing coalition for automobile die enterprise, the networked manufacturing system framework is put forward. Then the information model, resource model and organization structure model are studied one of the other. The information model contains three layers lengthways and the product lifecycle is divided into 5 stages on landscape; for the resource model, the resource is classified and described, the relationship between resource entities is analyzed. The participants of each member enterprise are grouped according to the task relevance in organization structure model, and collaborative discussion center is constructed for the participants to communicate. On the basis, the workflow model is then discussed, the activity in business process is described with UML, then the UML activity diagram is transformed to Petri net graph, thus the workflow model can be diagnosed and analyzed.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Ko, Jong Won. „Design of MDA Based Model Transformation Profile for Model Verification“. Applied Mechanics and Materials 224 (November 2012): 69–72. http://dx.doi.org/10.4028/www.scientific.net/amm.224.69.

Der volle Inhalt der Quelle

Annotation:

Validation of existing software design models and transformed target models for the study, mainly checking (Model Checking) with a code-based software designed to define in the abstract syntax tree or on the models generated using refactoring on design models for refinery operations and define how to perform. The problem with these traditional research methods, but the first model, design model for checking the information with the model by defining a formal representation in the form of an abstract syntax tree, as you've shown how to perform validation of UML design model. Additional steps need to define more complex due to a software problem that is not the way to the model suitable for model transformation verification. In this paper, as defined in the MDA based model transformation studies of a graph based mode transformation, and how to perform model transformation verification through improving graph comparison algorithm and model property information.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

Wu, Hao. „An SMT-based Approach for Generating Coverage Oriented Metamodel Instances“. International Journal of Information System Modeling and Design 7, Nr. 3 (Juli 2016): 23–50. http://dx.doi.org/10.4018/ijismd.2016070102.

Der volle Inhalt der Quelle

Annotation:

An effective technique for generating instances of a metamodel should quickly and automatically generate instances satisfying the metamodel's structural and OCL constraints. Ideally it should also produce quantitatively meaningful instances with respect to certain criteria, that is, instances which meet specified generic coverage criteria that help the modelers test or verify a metamodel at a general level. In this paper, the author presents an approach consisting of two techniques for coverage oriented metamodel instance generation. The first technique realises the standard coverage criteria defined for UML class diagrams, while the second technique focuses on generating instances satisfying graph-based criteria. With the author's approach, both kinds of criteria are translated to SMT formulas which are then investigated by an SMT solver. Each successful assignment is then interpreted as a metamodel instance that provably satisfies a coverage criteria or a graph property. The author has already integrated this approach into his existing tool to demonstrate the feasibility.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Chandrasekar, K. Raja, und S. Saravanakumar. „OPEN PACKING NUMBER FOR SOME CLASSES OF PERFECT GRAPHS“. Ural Mathematical Journal 6, Nr. 2 (26.12.2020): 38. http://dx.doi.org/10.15826/umj.2020.2.004.

Der volle Inhalt der Quelle

Annotation:

Let \(G\) be a graph with the vertex set \(V(G)\). A subset \(S\) of \(V(G)\) is an open packing set of \(G\) if every pair of vertices in \(S\) has no common neighbor in \(G.\) The maximum cardinality of an open packing set of \(G\) is the open packing number of \(G\) and it is denoted by \(\rho^o(G)\). In this paper, the exact values of the open packing numbers for some classes of perfect graphs, such as split graphs, \(\{P_4, C_4\}\)-free graphs, the complement of a bipartite graph, the trestled graph of a perfect graph are obtained.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

Taryana, Acep, Bangun Wijayanto, Naoyasu Ubayashi und Joko Setyono. „MODEL-DRIVEN DEVELOPMENT : FASE AWAL VERIFIKASI MODEL DESIGN REKAM MEDIS ELEKTRONIS MENGGUNAKAN PERUMUSAN GRAF LENGKAP“. Jurnal Ilmiah Matematika dan Pendidikan Matematika 6, Nr. 2 (26.12.2014): 53. http://dx.doi.org/10.20884/1.jmp.2014.6.2.2904.

Der volle Inhalt der Quelle

Annotation:

In this paper will be shown a graph formulation as a formal approaches in research Model-Driven Development (MDD) with a case study : the development of Electronic Medical Record (RME) on the scope of the public health center. The model was designed using UML notation and be selected a State Machine diagram that represents prerequisite user needs (requirements). Before the model is derived (driven) into the skeleton code, the accuracy of the state machine must be verified. In order for the State Machine can be verified by formal approach, the State Machine should be first transformed into a propositional formula using the complete graph approach, and partial models. The initial phase of verification will check the suitability of the model with the requirements in Propositional Normal Form (PNF) using SAT Solver, respectively as and . SAT solver will provide a design decision, whether a requirement represented in the model or not. If these requirements are not hold in the model, the requirement is not certainty (uncertain) and model must be redesigned.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

Kadar, Rozita, Jamal Othman, Naemah Abdul Wahab und Saiful Nizam Warris. „Semantic Metadata Information (SMI) Visualisation Technique Using the Integration of Ontology and UML Graph-Based Approach to Support Program Comprehension“. Journal of Computing Research and Innovation 4, Nr. 1 (03.11.2019): 52–63. http://dx.doi.org/10.24191/jcrinn.v4i1.107.

Der volle Inhalt der Quelle

Annotation:

Representing any ideas with pictures rather than words is intuitively more appealing because a visual presentation can be more readily understood than that of textual-based. Program visualisation is one of the techniques that can be used in teaching to help users in understanding how programs work. Program visualisation technique is a mental image or a visual representation of an object, scene, person or abstraction that is similar to visual perception. This technique is significant to users because the criteria of source code cannot be physically viewed. It is applicable in the process of writing programs as it helps users to understand their codes better. The purpose of program visualisation is to translate a program into a graphical view to show either the program code, data or control flow. Visualisation technique uses the capability of human visual system to enhance program comprehensibility. Thus, this study uses program visualisation technique to represent program domain in a graphical view to help novices in improving their comprehension. This research aims to support beginners or novice programmers who have been exposed to programming languages by providing effective visualisation technique.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

Gein, Pavel A. „ON CHROMATIC UNIQUENESS OF SOME COMPLETE TRIPARTITE GRAPHS“. Ural Mathematical Journal 7, Nr. 1 (30.07.2021): 38. http://dx.doi.org/10.15826/umj.2021.1.004.

Der volle Inhalt der Quelle

Annotation:

Let \(P(G, x)\) be a chromatic polynomial of a graph \(G\). Two graphs \(G\) and \(H\) are called chromatically equivalent iff \(P(G, x) = H(G, x)\). A graph \(G\) is called chromatically unique if \(G\simeq H\) for every \(H\) chromatically equivalent to \(G\). In this paper, the chromatic uniqueness of complete tripartite graphs \(K(n_1, n_2, n_3)\) is proved for \(n_1 \geqslant n_2 \geqslant n_3 \geqslant 2\) and \(n_1 - n_3 \leqslant 5\).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Elmatsani, Huda M. „Desain Sistem Informasi Kehumasan Terintegrasi Situs Media Sosial“. Jurnal Edukasi dan Penelitian Informatika (JEPIN) 5, Nr. 1 (22.04.2019): 24. http://dx.doi.org/10.26418/jp.v5i1.31164.

Der volle Inhalt der Quelle

Annotation:

Media sosial telah memasyarakat. Kehumasan yang mempunyai tugas berkomunikasi dengan masyarakat, mau tidak mau harus juga menggunakan media sosial sebagai salah satu saluran untuk berkomunikasi. Namun, di sisi lain terdapat kendala ketika harus mengumpulkan dan mengelola tanggapan balik dari masyarakat yang bersumber dari beragam media sosial. Penelitian ini mengembangkan sebuah desain sistem informasi kehumasan (SIK) yang terintegrasi dengan Facebook. Tujuannya agar SIK dapat mengelola informasi yang akan dipublikasikan ke medsos serta dapat mengevaluasi dan menanggapi balik setiap umpan balik sehingga hubungan dengan masyarakat dapat terjalin lebih baik. Desain SIK dibuat dengan dengan model arsitektur MVC dengan mengintegrasikan CodeIgniter dan Graph API, sedangkan pengembangan aplikasi dan pengu-jiannya menggunakan metode prototyping dan UML. Hasil pengujian menunjukkan SIK dapat mengelola konten yang dipublikasikan ke Facebook dan dapat mengelola konten umpan balik yang diperoleh dari Facebook.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Schalles, Christian, John Creagh und Michael Rebstock. „A Causal Model for Analyzing the Impact of Graphical Modeling Languages on Usability“. International Journal of Software Engineering and Knowledge Engineering 24, Nr. 09 (November 2014): 1337–55. http://dx.doi.org/10.1142/s0218194014500417.

Der volle Inhalt der Quelle

Annotation:

Today, developing the conceptual design of information systems has become inconceivable without the support of graphical models. Models are developed using graph-based modeling languages such as UML. This study focuses on the impact of metamodel properties on different usability attributes in the domain of graphical modeling languages. The study is based on a model of hypotheses including a structural causal model developed under consideration of cognitive theories and usability theory. Survey data is collected and the causal hypotheses are assessed using a structure equation modeling approach. The study shows important findings for practical and theoretical issues of how differing modeling languages are influencing usability attributes on causal stages in the modeling domain. The main focus of this article is to define differences and similarities of how language metaproperties impact usability attributes in model interpretation scenarios.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Efimov, Konstantin S., und Alexander A. Makhnev. „DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {27, 20, 7; 1, 4, 21} DOES NOT EXIST“. Ural Mathematical Journal 6, Nr. 2 (26.12.2020): 63. http://dx.doi.org/10.15826/umj.2020.2.006.

Der volle Inhalt der Quelle

Annotation:

In the class of distance-regular graphs of diameter 3 there are 5 intersection arrays of graphs with at most 28 vertices and noninteger eigenvalue. These arrays are \(\{18,14,5;1,2,14\}\), \(\{18,15,9;1,1,10\}\), \(\{21,16,10;1,2,12\}\), \(\{24,21,3;1,3,18\}\), and \(\{27,20,7;1,4,21\}\). Automorphisms of graphs with intersection arrays \(\{18,15,9;1,1,10\}\) and \(\{24,21,3;1,3,18\}\) were found earlier by A.A. Makhnev and D.V. Paduchikh. In this paper, it is proved that a graph with the intersection array \(\{27,20,7;1,4,21\}\) does not exist.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Brigl, B., T. Wendt und A. Winter. „Modeling Hospital Information Systems (Part 1): The Revised Three-layer Graph-based Meta Model 3LGM2“. Methods of Information in Medicine 42, Nr. 05 (2003): 544–51. http://dx.doi.org/10.1055/s-0038-1634381.

Der volle Inhalt der Quelle

Annotation:

Summary Objectives: Not only architects but also information managers need models and modeling tools for their subject of work. Especially for supporting strategic information management in hospitals, the meta model 3LGM2 is presented as an ontological basis for modeling the comprehensive information system of a hospital (HIS). Methods: In a case study, requirements for modeling HIS have been deduced. Accordingly 3LGM2 has been designed to describe HIS by concepts on three layers. The domain layer consists of enterprise functions and entity types, the logical tool layer focuses on application components and the physical tool layer describes physical data processing components. In contrast to other approaches a lot of inter-layer-relationships exist. 3LGM2 is defined using the Unified Modeling Language (UML). Results: Models of HIS can be created which comprise not only technical and semantic aspects but also computer-based and paper-based information processing. A software tool supporting the creation of 3LGM2 compliant models in a graphical way has been developed. The tool supports in detecting those shortcomings at the logical or the physical tool layers which make it impossible to satisfy the information needs at the domain layer. 3LGM2 can also be used as an ontology for describing HIS in natural language. Conclusions: Strategic information management even in large hospitals should be and can be supported by dedicated methods and tools. Although there have been good experiences with 3LGM2 concerning digital document archiving at the Leipzig University Hospital, which are presented in part 2, the benefit of the proposed method and tool has to be further evaluated.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!