EEMCS EPrints Service

Education

Research

Prospective Students

Jobs

Publications

Intranet (internal)

Nederlands

Contact

Sitemap

Organisation

1536 Summary 2: Graph Grammar Verification through Abstraction

Home Policy Brochure Browse Search User Area Contact Help

Baldan, P. and König, B. and Rensink, A. (2005) Summary 2: Graph Grammar Verification through Abstraction. In: Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems, 2005, Dagstuhl, Germany. Dagstuhl Seminar 04241. Dagstuhl. ISSN 1862-4405

Full text available as:

PDF

- Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
331 Kb

Official URL: http://drops.dagstuhl.de/opus/volltexte/2005/29

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.

Item Type:	Conference or Workshop Paper (Full Paper, Talk)
Research Group:	EWI-SE: Software Engineering
Research Program:	CTIT-ASI: A-services Internet
Research Project:	GROOVE: Graphs for Object-Oriented Verification
Uncontrolled Keywords:	Graph Transformation, Verification
ID Code:	1536
Status:	Published
Deposited On:	09 February 2006
Refereed:	No
International:	Yes
More Information:	statistics metis

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item