About

Log in?

DTU users get better search results including licensed content and discounts on order fees.

Anyone can log in and get personalized features such as favorites, tags and feeds.

Log in as DTU user Log in as non-DTU user No thanks

DTU Findit
Boolean: (bicycle AND helmet) OR (head AND protection) (always group AND in parenthesis)
Title: title:(climate change)
Author: author:("bohr niels" OR "bohr n") (avoid only full first name)
Phrase: "water pump control" (does not work with wildcards)
Wildcards: wom?n pharm*

More help on how to search

Flexible matching

About search syntax

Search syntax Advanced
Close advanced
{{problem}}
By field Using AND/OR By author
This tool can help you build boolean queries suitable for doing a broad search for different synonyms or spellings of each word. Start via the drop-down below or just start typing in the search field.
{{ row.typeTitle }}: ( )

Since our index often lack the full first name of people it can be difficult to correctly search by author.

Fill in the fields and let us help you build a good query:

If you need to find everything possible, consider only searching by last name.

Use "Starting year" to ignore publications out of year range.

More...

Report

TGGs for Transforming UML to CSP: Contribution to the AGTIVE 2007 Graph Transformation Tools Contest

By Greenyer, Joel1; Kindler, Ekkart2,3; Rieke, Jan; Travkin, Oleg

From

Paderborn University1

Software Engineering, Department of Informatics and Mathematical Modeling, Technical University of Denmark2

Department of Informatics and Mathematical Modeling, Technical University of Denmark3

Along with the AGTIVE 2007 conference, a Graph Transformation Tools Contenst invited tool implementers to present their solutions in order to compare the principles and particular strengths and weaknesses of today's graph transformation tools. This paper documents our contribution to the Tools Contest.

The second transformation problem, a transformation from UML activity diagrams to CSP processes, i.e. a transformation between two models, is a typical application for Triple Graph Grammars (TGGs). We present our contributed solution, presenting the TGG rules and the implementation of our TGG interpreter.

Moreover, we point out the advantages of our soulution as well as some restrictions of the current implementation. This paper will only briefly state the transformation problem and focus on our TGG approach and the discussion of the rules.

Language: English
Publisher: Department of Computer Science, University of Paderborn
Year: 2008
Series: Reihe Informatik
Types: Report
ORCIDs: Kindler, Ekkart

DTU users get better search results including licensed content and discounts on order fees.

Log in as DTU user

Access

Analysis