Studies and their role in representing the international graph

Links table

Abstract and 1 introduction

2 definitions and basic instructions

2.1 groups

2.2 sequence

2.3 Signatures and algebra and 2.4 categories

3 studies and its morphology

4 limits and colimits

5 drawing studies

6 structures for graph and written studies

7 sub -pictures and partial morphology

8 House transformations from studies

9 written studies

10 conclusion and references

10 conclusion

Studies generalize the standard concepts of graphic fees directed by allowing the edges of any length with free trade aspects. The edge of the length is zero knots, and if it has a larger length, it can be adjacent to any edge, including itself. In “Monograph”, it justifies the unilateral precedence through this unified view of the contract as edges and edges of unrestricted commercial aspects that provide formal summary (formation are functions that are characterized by one equation); The justified suffix is ​​justified by correspondence (even symmetry) between the limited monographs and its graphics.

Global studies are global with regard to the structures of the graph and the opposite algebra, meaning that studies are equivalent to the structures of the graph extended with appropriate request agreements on the names of the operators, and that the written studies categories are equivalent to the corresponding categories of algebra. Since many standard or strange concepts of guided graphs can be represented as a single force, they can also be represented as written studies, but these advantages have two structures on the structures of the graph: they provide a direction of the edges and distribute them (and therefore) with the operator’s names.

The algebraic transformations of studies are similar to the transformations of standard graphs. Consequently, dealing with written studies may be more simple than structured algebra, as shown in the results of section 9. The representation of the guided edges appears as a more natural series than its standard representation as unorganized organisms that have images through a set of functions. Thus, qualitative studies appear as a natural way to determine the chart structures.

Reference

[1] T

[2] H. EHRIG, K. Ehrig, U. Prang, G. Taentzer, the basics of the conversion of the forced graph, studies in theoretical computer science. Eatcs series, Springer, 2006.

[3] M. Lowe, forced approach to transform single graph, computer science theoretical 109 (1993) 181-224.

[4] T 12669 from LNCS, Springer, 2021, p. 54-74.

[5] P. SUPPES, the theory of the intuitive collection, doger publications, Inc. , 1972.

[6] D. Sanneella, A. Tarlecki, the foundations of house specifications and the development of official software, studies in theoretical computer science. Eatcs series, Springer, 2012.

[7] H. Herrich, Ge Strecker, Category Theory, 3rd Edition, Heldermann Verlag, Berlin, 2007.

[8] Q.

[9] D. Plump, rewriting the graph, at: H. Ehrig, G. Engels, H.-J. Krewski, G. Rozenberg (EDS.), Rural and Computing graphical booklet by converting graph, folder 2: applications, languages ​​and tools, world scriftics, 1999, p. 3-61.

[10] A. Burroni, Supreme Dimensions Word problems with applications on equal logic, theoretical computer science 115 (1) (1993) 43-62.

[11] E. Robinson, G. Rosolini, partial maps, information and account 79 (2) (1988) 95-130.

[12] A. Corradini, T 4178 from LNCS, Springer, 2006, p. 30-45.

[13] A. Corradini, D. Duval, R. Echaheted, F. Prost, L. Ribeiro, Complet – Abbraic Graph Rewing with controlled inclusion, in: 8th ICGT, folder. 9151 from LNCS, Springer, 2015, pages 35-51.

[14] A. Corradini, D. Duval, R. Echaheted, F. Prost, L. Ribeiro, The PBPO Graph Transformation Approach, J. LOG. Algebra. Met. program. 103 (2019) 213-331.

[15] T 12669 from LNCS, Springer, 2021, p. 75-97.

[16] H. Ehrig, M. Pfender, HJ Schneider, Graph-Grammars: A Analbraic Approach, in: 4th Symposium on Switching and Automata Theory, Iowa City, IOWA, USA, 15-17 October, 1973, 1973, P. 167-180.

[17] A. Corradini, u. Montanari, F. Rossi, H. EHRIG, R. HECKEL, M. Lowe, Abbraic Divepes to convert the graph – Part 1: basic concepts and dual -wheel drive approach, World Scientific, 1997, PP. 163-246.

[18] A. Hoble, J structure. account. Sci 11 (5) (2001) 637–688.

[19] J.-C. Raoult, on rewriting the graph, theoretical computer science 32 (1,284) 1-24.

[20] M. Lowe, the extended forced graph, PhD thesis, Berlin Technical University, Germany (1991).

[21] M. Lowe, M. Korf, A. Wagner, a forced frame to convert attributed graphs, in: R. Sleep, R. Plasmeijer, M. Van Eekelen (EDS.), The term rewriting graph: theory and practice, John Waili, New York, 1993, p. 185-199.

[22] R. HECKEL, JM K¨uster, g 2505 from LNCS, Springer, 2002, p. 161-176.

[23] H. EHRIG, K. Ehrig, U. Prang, G. Taentzer, a basic theory of cooked graphic fees and transformation of the graph based on HLR adhesive categories, Fundam. Informaticae 74 (1) (2006) 31-61.

[24] H. EHRIG, J Informaticae 74 (1) (2006) 1-29.