Article

Unfolding Symbolic Attributed Graph Grammars

Authors:

Graph Transformation: 13th International Conference, ICGT 2020, Held as Part of STAF 2020, Bergen, Norway, June 25–26, 2020, Proceedings

Pages 75 - 90

https://doi.org/10.1007/978-3-030-51372-6_5

Published: 25 June 2020 Publication History

Abstract

Attributed graph grammars can specify the transformation of complex data and object structures within a natural rule-based model of concurrency. This is crucial to their use in modelling interfaces of services and components as well as the evolution of complex systems and networks. However, the established concurrent semantics of graph grammars by unfolding does not cover attributed grammars. We develop a theory of unfolding for attributed graph grammars where attribution is represented symbolically, via logical constraints. We establish a functorial representation (a coreflection) of unfolding which guarantees it to be correct, complete and fully abstract.

As a case study and running example we demonstrate the use of visual contracts to specify an escrow smart contract.

References

[1]

Baldan P, Corradini A, Heindel T, König B, and Sobociński P Kurz A, Lenisa M, and Tarlecki A Unfolding grammars in adhesive categories Algebra and Coalgebra in Computer Science 2009 Heidelberg Springer 350-366

Crossref

Google Scholar

[2]

Baldan P, Corradini A, and König B Degano P, De Nicola R, and Meseguer J Unfolding graph transformation systems: theory and applications to verification Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday 2008 Heidelberg Springer 16-36

Digital Library

Google Scholar

[3]

Baldan P, Corradini A, Montanari U, and Ribeiro L Wirsing M, Pattinson D, and Hennicker R Coreflective concurrent semantics for single-pushout graph grammars Recent Trends in Algebraic Development Techniques 2003 Heidelberg Springer 165-184

Crossref

Google Scholar

[4]

Baldan P, Corradini A, Montanari U, and Ribeiro L Unfolding semantics of graph transformation Inf. Comput. 2007 205 5 733-782

Digital Library

Google Scholar

[5]

Ehrig H, Ehrig K, Prange U, and Taentzer G Fundamentals of Algebraic Graph Transformation 2006 Heidelberg Springer

Crossref

Google Scholar

[6]

Esparza J and Heljanko K Unfoldings: A Partial-Order Approach to Model Checking 2008 Heidelberg Springer

Crossref

Google Scholar

[7]

K�nig B and Kozioura V Ehrig H, Heckel R, Rozenberg G, and Taentzer G Towards the verification of attributed graph transformation systems Graph Transformations 2008 Heidelberg Springer 305-320

Digital Library

Google Scholar

[8]

Orejas, F., Lambers, L.: Symbolic attributed graphs for attributed graph transformation. ECEASST 30 (2010). http://journal.ub.tu-berlin.de/index.php/eceasst/article/view/405

Google Scholar

[9]

Orejas F and Lambers L Lazy graph transformation Fundam. Inform. 2012 118 1–2 65-96

Crossref

Google Scholar

[10]

Rideau, S., Winskel, G.: Concurrent strategies. In: 2011 IEEE 26th Annual Symposium on Logic in Computer Science, pp. 409–418. IEEE (2011)

Google Scholar

Recommendations

Ordered attributed grammars

Ordered attributed grammars are defined as a large subclass of semantically well-defined attributed grammars proposed by Knuth. An attributed grammar is ordered if for each symbol a partial order over the associated attributes can be given, such that in ...
Symbolic graphs for attributed graph constraints

In this paper we present a new class of graphs, called symbolic graphs, to define a new class of constraints on attributed graphs. In particular, in the first part of the paper, we study the category of symbolic graphs showing that it satisfies some ...
Translating Controlled Graph Grammars to Ordinary Graph Grammars

Graph Grammar (GG) is an appropriate formal language for specifying complex systems. In a GG the system states are represented by graphs and the changes between the states are described by rules. The use of GGs is interesting as there are several ...

Comments

Information & Contributors

Information

Published In

Graph Transformation: 13th International Conference, ICGT 2020, Held as Part of STAF 2020, Bergen, Norway, June 25–26, 2020, Proceedings

Jun 2020

345 pages

ISBN:978-3-030-51371-9

DOI:10.1007/978-3-030-51372-6

Editors:
Fabio Gadducci
Università di Pisa, Pisa, Italy
,
Timo Kehrer
Humboldt-Universität zu Berlin, Berlin, Germany

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 25 June 2020

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 21 Oct 2024

Other Metrics

View Author Metrics

Citations

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Recommendations

Ordered attributed grammars

Symbolic graphs for attributed graph constraints

Translating Controlled Graph Grammars to Ordinary Graph Grammars

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations