DROPS

Document

Summary 2: Graph Grammar Verification through Abstraction

Authors: Paolo Baldan, Barbara König, and Arend Rensink

Published in: Dagstuhl Seminar Proceedings, Volume 4241, Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems (2005)

Abstract

Until now there have been few contributions concerning the verification of graph grammars, specifically of infinite-state graph grammars. This paper compares two existing approaches, based on abstractions of graph transformation systems. While in the unfolding approach graph grammars are approximated by Petri nets, in the partitioning approach graphs are abstracted according to their local structure. We describe differences and similarities of the two approaches and explain the underlying ideas.

Cite as

Paolo Baldan, Barbara König, and Arend Rensink. Summary 2: Graph Grammar Verification through Abstraction. In Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems. Dagstuhl Seminar Proceedings, Volume 4241, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{baldan_et_al:DagSemProc.04241.3,
  author =	{Baldan, Paolo and K\"{o}nig, Barbara and Rensink, Arend},
  title =	{{Summary 2: Graph Grammar Verification through Abstraction}},
  booktitle =	{Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems},
  pages =	{1--9},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4241},
  editor =	{Barbara K\"{o}nig and Ugo Montanari and Philippa Gardner},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04241.3},
  URN =		{urn:nbn:de:0030-drops-291},
  doi =		{10.4230/DagSemProc.04241.3},
  annote =	{Keywords: graph transformation , verification}
}

Document

DOI: 10.4230/DagSemProc.04101.14

Subjects, Models, Languages, Transformations

Authors: Arend Rensink

Published in: Dagstuhl Seminar Proceedings, Volume 4101, Language Engineering for Model-Driven Software Development (2005)

Abstract

Discussions about model-driven approaches tend to be hampered by terminological confusion. This is at least partially caused by a lack of formal precision in defining the basic concepts, including that of \model" and \thing being modelled" | which we call subject in this paper. We propose a minimal criterion that a model should fulfill: essentially, it should come equipped with a clear and unambiguous membership test; in other words, a notion of which subjects it models. We then go on to discuss a certain class of models of models that we call languages, which apart from defining their own membership test also determine membership of their members. Finally, we introduce transformations on each of these layers: a subject transformation is essentially a pair of subjects, a model transformation is both a pair of models and a model of pairs (namely, subject transformations), and a language transformation is both a pair of languages and a language of model transformations. We argue that our framework has the benefits of formal precision (there can be no doubt about whether something satifies our criteria for being a model, a language or a transformation) and minimality (it is hard to imagine a case of modelling or transformation not having the characterstics that we propose).

Cite as

Arend Rensink. Subjects, Models, Languages, Transformations. In Language Engineering for Model-Driven Software Development. Dagstuhl Seminar Proceedings, Volume 4101, pp. 1-13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{rensink:DagSemProc.04101.14,
  author =	{Rensink, Arend},
  title =	{{Subjects, Models, Languages, Transformations}},
  booktitle =	{Language Engineering for Model-Driven Software Development},
  pages =	{1--13},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4101},
  editor =	{Jean Bezivin and Reiko Heckel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04101.14},
  URN =		{urn:nbn:de:0030-drops-242},
  doi =		{10.4230/DagSemProc.04101.14},
  annote =	{Keywords: no keywords}
}

Search Results

Documents authored by Rensink, Arend

Summary 2: Graph Grammar Verification through Abstraction

Abstract

Cite as

Subjects, Models, Languages, Transformations

Abstract

Cite as

Thanks for your feedback!

Could not send message