![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 14 matches
- 2001
- Luciano Baresi, Mauro Pezzè
:
Improving UML with Petri nets. UNIGRA 2001: 107-119 - Juliane Dehnert, Maike Gajewsky, Sabine Lembke, Herbert Weber:
The Petri Net Baukasten - Second Installment. UNIGRA 2001: 120-139 - Jörg Desel, Gabriel Juhás
, Robert Lorenz:
Unifying Petri Nets with Restricted Occurrence Rule Using Partial Algebra. UNIGRA 2001: 163-187 - Hartmut Ehrig, Claudia Ermel, Julia Padberg:
Preface. UNIGRA 2001: 188-189 - Claudia Ermel, Roswitha Bardohl, Julia Padberg:
Visual Design of Software Architecture and Evolution based on Graph Transformation. UNIGRA 2001: 52-66 - Martin Große-Rhode:
Formal Concepts for an Integrated Internal Model of the UML. UNIGRA 2001: 80-92 - Reiko Heckel, Albert Zündorf:
How to Specify a Graph Transformation Approach - A Meta Model for Fujaba. UNIGRA 2001: 41-51 - Hans-Jörg Kreowski, Giorgio Busatto, Sabine Kuske:
GRACE as a unifying approach to graph-transformation-based specification. UNIGRA 2001: 1-15 - Mark Minas, Berthold Hoffmann:
Specifying and Implementing Visual Process Modeling Languages with DiaGen. UNIGRA 2001: 67-79 - Francesco Parisi-Presicce:
On Modifying High Level Replacement Systems. UNIGRA 2001: 16-27 - Andy Schürr:
Adding Graph Transformation Concepts to UML's Constraint Language OCL. UNIGRA 2001: 93-106 - Mark-Oliver Stehr, José Meseguer, Peter Csaba Ölveczky:
Representation and Execution of Petri Nets Using Rewriting Logic as a Unifying Framework. UNIGRA 2001: 140-162 - Gabriele Taentzer:
Towards Common Exchange Formats for Graphs and Graph Transformation Systems. UNIGRA 2001: 28-40 - Hartmut Ehrig, Claudia Ermel, Julia Padberg:
Uniform Approaches to Graphical Process Specification Techniques, UNIGRA 2001, a Satellite Event of ETAPS 2001, Genova, Italy, March 31 - April 1, 2001. Electronic Notes in Theoretical Computer Science 44(4), Elsevier 2001 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-08-18 22:49 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint