Algebraic graph rewriting using a single pushout

P.M. van den Broek

doi:10.1007/3-540-53982-4_6

Algebraic graph rewriting using a single pushout

P.M. van den Broek

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

8 Citations (Scopus)

90 Downloads (Pure)

Abstract

We show how graph rewriting can be described with a single pushout in a suitable category of graphs, and compare our result with the conventional approach which uses double pushouts.

Original language	English
Title of host publication	TAPSOFT '91
Subtitle of host publication	Proceedings of the International Joint Conference on Theory and Practice of Software Development Brighton, UK, April 8–12, 1991
Editors	S. Abramski, T.S.E. Maibaum
Place of Publication	Berlin, Heidelberg
Publisher	Springer
Pages	90-102
Number of pages	13
ISBN (Electronic)	978-3-540-46563-8
ISBN (Print)	978-3-540-53982-7
DOIs	https://doi.org/10.1007/3-540-53982-4_6
Publication status	Published - Apr 1991
Event	4th International Joint Conference on Theory and Practice of Software Development, TAPSOFT 1991 - Brighton, United Kingdom Duration: 8 Apr 1991 → 12 Apr 1991 Conference number: 4

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer-Verlag
Volume	493
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	4th International Joint Conference on Theory and Practice of Software Development, TAPSOFT 1991
Abbreviated title	TAPSOFT
Country/Territory	United Kingdom
City	Brighton
Period	8/04/91 → 12/04/91

Access to Document

10.1007/3-540-53982-4_6

VandenBroek1991algebraicFinal published version, 640 KB

8 Citations
1 Report

Algebraic graph rewriting using a single pushout
van den Broek, P. M., 1991, Enschede: University of Twente. 13 p. (Memoranda informatica; no. 91-09)
Research output: Book/Report › Report › Professional

Cite this

van den Broek, P. M. (1991). Algebraic graph rewriting using a single pushout. In S. Abramski, & T. S. E. Maibaum (Eds.), TAPSOFT '91: Proceedings of the International Joint Conference on Theory and Practice of Software Development Brighton, UK, April 8–12, 1991 (pp. 90-102). (Lecture Notes in Computer Science; Vol. 493). Springer. https://doi.org/10.1007/3-540-53982-4_6

@inproceedings{a50e1cd1326c417591c951c122733dae,

title = "Algebraic graph rewriting using a single pushout",

abstract = "We show how graph rewriting can be described with a single pushout in a suitable category of graphs, and compare our result with the conventional approach which uses double pushouts.",

author = "{van den Broek}, P.M.",

year = "1991",

month = apr,

doi = "10.1007/3-540-53982-4_6",

language = "English",

isbn = "978-3-540-53982-7",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "90--102",

editor = "S. Abramski and T.S.E. Maibaum",

booktitle = "TAPSOFT '91",

address = "Germany",

note = "4th International Joint Conference on Theory and Practice of Software Development, TAPSOFT 1991, TAPSOFT ; Conference date: 08-04-1991 Through 12-04-1991",

}

van den Broek, PM 1991, Algebraic graph rewriting using a single pushout. in S Abramski & TSE Maibaum (eds), TAPSOFT '91: Proceedings of the International Joint Conference on Theory and Practice of Software Development Brighton, UK, April 8–12, 1991. Lecture Notes in Computer Science, vol. 493, Springer, Berlin, Heidelberg, pp. 90-102, 4th International Joint Conference on Theory and Practice of Software Development, TAPSOFT 1991, Brighton, United Kingdom, 8/04/91. https://doi.org/10.1007/3-540-53982-4_6

Algebraic graph rewriting using a single pushout. / van den Broek, P.M.
TAPSOFT '91: Proceedings of the International Joint Conference on Theory and Practice of Software Development Brighton, UK, April 8–12, 1991. ed. / S. Abramski; T.S.E. Maibaum. Berlin, Heidelberg: Springer, 1991. p. 90-102 (Lecture Notes in Computer Science; Vol. 493).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Algebraic graph rewriting using a single pushout

AU - van den Broek, P.M.

N1 - Conference code: 4

PY - 1991/4

Y1 - 1991/4

N2 - We show how graph rewriting can be described with a single pushout in a suitable category of graphs, and compare our result with the conventional approach which uses double pushouts.

AB - We show how graph rewriting can be described with a single pushout in a suitable category of graphs, and compare our result with the conventional approach which uses double pushouts.

U2 - 10.1007/3-540-53982-4_6

DO - 10.1007/3-540-53982-4_6

M3 - Conference contribution

SN - 978-3-540-53982-7

T3 - Lecture Notes in Computer Science

SP - 90

EP - 102

BT - TAPSOFT '91

A2 - Abramski, S.

A2 - Maibaum, T.S.E.

PB - Springer

CY - Berlin, Heidelberg

T2 - 4th International Joint Conference on Theory and Practice of Software Development, TAPSOFT 1991

Y2 - 8 April 1991 through 12 April 1991

ER -