feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    UID:
    b3kat_BV046791850
    Format: 1 Online-Ressource (xiv, 335 Seiten) , 1368 Illustrationen, 66 in Farbe
    ISBN: 9783030513726
    Series Statement: Lecture notes in computer science 12150
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-030-51371-9
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-030-51373-3
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Diskrete Mathematik ; Algorithmus ; Datenstruktur ; Graph-Grammatik ; Graphersetzungssystem ; Hypergraph ; Konferenzschrift
    URL: Volltext  (URL des Erstveröffentlichers)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    b3kat_BV047389671
    Format: 1 Online-Ressource , Diagramme
    ISBN: 9783030789466
    Series Statement: Lecture notes in computer science 12741
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-030-78945-9
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-030-78947-3
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Diskrete Mathematik ; Computergrafik ; Datenstruktur ; Algorithmus ; Graph-Grammatik ; Graphersetzungssystem ; Hypergraph ; Konferenzschrift
    URL: Volltext  (URL des Erstveröffentlichers)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    UID:
    edochu_18452_27321
    Format: 1 Online-Ressource (33 Seiten)
    ISSN: 1619-1366 , 1619-1366
    Content: Model transformations are among the key concepts of model-driven engineering (MDE), and dedicated model transformation languages (MTLs) emerged with the popularity of the MDE pssaradigm about 15 to 20 years ago. MTLs claim to increase the ease of development of model transformations by abstracting from recurring transformation aspects and hiding complex semantics behind a simple and intuitive syntax. Nonetheless, MTLs are rarely adopted in practice, there is still no empirical evidence for the claim of easier development, and the argument of abstraction deserves a fresh look in the light of modern general purpose languages (GPLs) which have undergone a significant evolution in the last two decades. In this paper, we report about a study in which we compare the complexity and size of model transformations written in three different languages, namely (i) the Atlas Transformation Language (ATL), (ii) Java SE5 (2004–2009), and (iii) Java SE14 (2020); the Java transformations are derived from an ATL specification using a translation schema we developed for our study. In a nutshell, we found that some of the new features in Java SE14 compared to Java SE5 help to significantly reduce the complexity of transformations written in Java by as much as 45%. At the same time, however, the relative amount of complexity that stems from aspects that ATL can hide from the developer, which is about 40% of the total complexity, stays about the same. Furthermore we discovered that while transformation code in Java SE14 requires up to 25% less lines of code, the number of words written in both versions stays about the same. And while the written number of words stays about the same their distribution throughout the code changes significantly. Based on these results, we discuss the concrete advancements in newer Java versions. We also discuss to which extent new language advancements justify writing transformations in a general purpose language rather than a dedicated transformation language. We further indicate potential avenues for future research on the comparison of MTLs and GPLs in a model transformation context.
    Content: Peer Reviewed
    In: Berlin ; Heidelberg ; New York, NY : Springer, 21,2, Seiten 805-837, 1619-1366
    Language: English
    URL: Volltext  (kostenfrei)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    UID:
    edochu_18452_27435
    Format: 1 Online-Ressource (20 Seiten)
    ISSN: 1619-1366 , 1619-1366
    Content: Simulink is an example of a successful application of the paradigm of model-based development into industrial practice. Numerous companies create and maintain Simulink projects for modeling software-intensive embedded systems, aiming at early validation and automated code generation. However, Simulink projects are not as easily available as code-based ones, which profit from large publicly accessible open-source repositories, thus curbing empirical research. In this paper, we investigate a set of 1734 freely available Simulink models from 194 projects and analyze their suitability for empirical research. We analyze the projects considering (1) their development context, (2) their complexity in terms of size and organization within projects, and (3) their evolution over time. Our results show that there are both limitations and potentials for empirical research. On the one hand, some application domains dominate the development context, and there is a large number of models that can be considered toy examples of limited practical relevance. These often stem from an academic context, consist of only a few Simulink blocks, and are no longer (or have never been) under active development or maintenance. On the other hand, we found that a subset of the analyzed models is of considerable size and complexity. There are models comprising several thousands of blocks, some of them highly modularized by hierarchically organized Simulink subsystems. Likewise, some of the models expose an active maintenance span of several years, which indicates that they are used as primary development artifacts throughout a project’s lifecycle. According to a discussion of our results with a domain expert, many models can be considered mature enough for quality analysis purposes, and they expose characteristics that can be considered representative for industry-scale models. Thus, we are confident that a subset of the models is suitable for empirical research. More generally, using a publicly available model corpus or a dedicated subset enables researchers to replicate findings, publish subsequent studies, and use them for validation purposes. We publish our dataset for the sake of replicating our results and fostering future empirical research.
    Content: Peer Reviewed
    In: New York, NY : Springer, 20,6, Seiten 2111-2130, 1619-1366
    Language: English
    URL: Volltext  (kostenfrei)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    UID:
    gbv_172427306X
    Format: 1 Online-Ressource(XIV, 335 p. 1368 illus., 66 illus. in color.)
    Edition: 1st ed. 2020.
    ISBN: 9783030513726
    Series Statement: Theoretical Computer Science and General Issues 12150
    Content: Theoretical Advances -- Conditional Bigraphs -- Confluence up to Garbage -- Computing embeddings of directed bigraphs -- A Categorical Semantics for Guarded Petri Nets -- Unfolding Symbolic Attributed Graph Grammars -- Single Pushout Rewriting in Comprehensive Systems -- Initial Conflicts for Transformation Rules with Nested Application Conditions -- Patch Graph Rewriting -- Hypergraph basic categorial grammars -- Multilevel Typed Graph Transformations -- Application Domains -- Rewriting Theory for the Life Sciences: A Unifying Framework for CTMC Semantics -- Algebras for tree decomposable graphs -- Graph Parsing as Graph Transformation - Correctness of Predictive Top-Down Parsers -- Graph Consistency as a Graduated Property: Consistency-Sustaining and -Improving Graph Transformations -- Formal Verification of Invariants for Attributed Graph Transformation Systems Based on Nested Attributed Graph Conditions -- Optimistic and Pessimistic On-the- y Analysis for Metric Temporal Graph Logic -- Tool Presentations -- A Flexible and Easy-to-Use Library for the Rapid Development of Graph Tools in Java -- Multiscale graph grammars can generate Cayley graphs of groups and monoids -- The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants -- A Simulator for Probabilistic Timed Graph Transformation Systems with Complex Large-Scale Topologies.
    Content: This book constitutes the refereed proceedings of the 13th International Conference on Graph Transformation, ICGT 2020, in Bergen, Norway, in June 2020.* The 16 research papers and 4 tool paper presented in this book were carefully reviewed and selected from 40 submissions. One invited paper is also included. The papers deal with the following topics: theoretical advances; application domains; and tool presentations. *The conference was held virtually due to the COVID-19 pandemic.
    Additional Edition: ISBN 9783030513719
    Additional Edition: ISBN 9783030513733
    Additional Edition: Erscheint auch als Druck-Ausgabe ICGT (13. : 2020 : Online) Graph transformation Cham : Springer, 2020 ISBN 9783030513719
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783030513733
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Graphersetzungssystem ; Graph-Grammatik ; Hypergraph ; Konferenzschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    UID:
    edochu_18452_29089
    Format: 1 Online-Ressource (23 Seiten)
    Content: Model matching algorithms are used to identify common elements in input models, which is a fundamental precondition for many software engineering tasks, such as merging software variants or views. If there are multiple input models, an n-way matching algorithm that simultaneously processes all models typically produces better results than the sequential application of two-way matching algorithms. However, existing algorithms for n-way matching do not scale well, as the computational effort grows fast in the number of models and their size. We propose a scalable n-way model matching algorithm, which uses multi-dimensional search trees for efficiently finding suitable match candidates through range queries. We implemented our generic algorithm named RaQuN (Range Queries on input models) in Java and empirically evaluate the matching quality and runtime performance on several datasets of different origins and model types. Compared to the state of the art, our experimental results show a performance improvement by an order of magnitude, while delivering matching results of better quality.
    Content: Peer Reviewed
    In: Berlin : Springer, 22,5, Seiten 1495-1517
    Language: English
    URL: Volltext  (kostenfrei)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    UID:
    almahu_9949083906402882
    Format: XII, 303 p. 64 illus., 10 illus. in color. , online resource.
    Edition: 1st ed. 2021.
    ISBN: 9783030789466
    Series Statement: Theoretical Computer Science and General Issues ; 12741
    Content: This book constitutes the refereed proceedings of the 14th International Conference on Graph Transformation, ICGT 2021, which took place virtually during June 24-25, 2021. The 14 full papers and 2 tool papers presented in this book were carefully reviewed and selected from 26 submissions. They deal with the following topics: theoretical advances; application domains; and tool presentations.
    Note: Theoretical Advances -- Concurrency Theorems for Non-linear Rewriting Theories -- A Generalized Concurrent Rule Construction for Double-Pushout Rewriting -- Transformations of Reaction Systems over Categories by means of Epi-Mono Factorization and Functors -- Graph Rewriting and Relabeling with PBPO+ -- Incorrectness Logic for Graph Programs -- Powerful and NP-Complete: Hypergraph Lambek Grammars -- Evaluation Diversity for Graph Conditions -- Application Domains -- Host-Graph-Sensitive RETE Nets for Incremental Graph Pattern Matching -- Rule-Based Top-Down Parsing for Acyclic Contextual Hyperedge Replacement Grammars -- Nets with Mana: A Framework for Chemical Reaction Modelling -- A Case Study on the Graph-transformational Modeling and Analysis of Puzzles -- Interval Probabilistic Timed Graph Transformation Systems -- Verifying Graph Programs with Monadic Second-Order Logic -- On the Complexity of Simulating Probabilistic Timed Graph Transformation Systems -- Tool Presentations -- Automated Checking and Completion of Backward Confluence for Hyperedge Replacement Grammars -- GrapePress - A Computational Notebook for Graph Transformations.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783030789459
    Additional Edition: Printed edition: ISBN 9783030789473
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    UID:
    almahu_9948435923702882
    Format: XIV, 335 p. 1368 illus., 66 illus. in color. , online resource.
    Edition: 1st ed. 2020.
    ISBN: 9783030513726
    Series Statement: Theoretical Computer Science and General Issues ; 12150
    Content: This book constitutes the refereed proceedings of the 13th International Conference on Graph Transformation, ICGT 2020, in Bergen, Norway, in June 2020.* The 16 research papers and 4 tool paper presented in this book were carefully reviewed and selected from 40 submissions. One invited paper is also included. The papers deal with the following topics: theoretical advances; application domains; and tool presentations. *The conference was held virtually due to the COVID-19 pandemic.
    Note: Theoretical Advances -- Conditional Bigraphs -- Confluence up to Garbage -- Computing embeddings of directed bigraphs -- A Categorical Semantics for Guarded Petri Nets -- Unfolding Symbolic Attributed Graph Grammars -- Single Pushout Rewriting in Comprehensive Systems -- Initial Conflicts for Transformation Rules with Nested Application Conditions -- Patch Graph Rewriting -- Hypergraph basic categorial grammars -- Multilevel Typed Graph Transformations -- Application Domains -- Rewriting Theory for the Life Sciences: A Unifying Framework for CTMC Semantics -- Algebras for tree decomposable graphs -- Graph Parsing as Graph Transformation - Correctness of Predictive Top-Down Parsers -- Graph Consistency as a Graduated Property: Consistency-Sustaining and -Improving Graph Transformations -- Formal Verification of Invariants for Attributed Graph Transformation Systems Based on Nested Attributed Graph Conditions -- Optimistic and Pessimistic On-the- y Analysis for Metric Temporal Graph Logic -- Tool Presentations -- A Flexible and Easy-to-Use Library for the Rapid Development of Graph Tools in Java -- Multiscale graph grammars can generate Cayley graphs of groups and monoids -- The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants -- A Simulator for Probabilistic Timed Graph Transformation Systems with Complex Large-Scale Topologies.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783030513719
    Additional Edition: Printed edition: ISBN 9783030513733
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    UID:
    edoccha_BV046791850
    Format: 1 Online-Ressource (xiv, 335 Seiten) : , 1368 Illustrationen, 66 in Farbe.
    ISBN: 978-3-030-51372-6
    Series Statement: Lecture notes in computer science 12150
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-030-51371-9
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-030-51373-3
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Diskrete Mathematik ; Algorithmus ; Datenstruktur ; Graph-Grammatik ; Graphersetzungssystem ; Hypergraph ; Konferenzschrift
    URL: Volltext  (URL des Erstveröffentlichers)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    UID:
    edocfu_BV046791850
    Format: 1 Online-Ressource (xiv, 335 Seiten) : , 1368 Illustrationen, 66 in Farbe.
    ISBN: 978-3-030-51372-6
    Series Statement: Lecture notes in computer science 12150
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-030-51371-9
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-030-51373-3
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Diskrete Mathematik ; Algorithmus ; Datenstruktur ; Graph-Grammatik ; Graphersetzungssystem ; Hypergraph ; Konferenzschrift
    URL: Volltext  (URL des Erstveröffentlichers)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages