A Partial Order Representation of Processes of Transforming Graphs

Authors:
Andrea Maggiolo-Schettini;Józef Winkowski
Affiliations:
Dipartimento di Informatica, Università di Pisa, 56 125 Pisa, Corso Italia 40, Italy. maggiolo@di.unipi.it;Instytut Podstaw Informatyki PAN, Ordona 21, 01-237 Warszawa, Poland. wink@ipipan.waw.pl
Venue:
Fundamenta Informaticae
Year:
1997

Citing 9
Cited 0

Axiomatizing net computations and processes

Proceedings of the Fourth Annual Symposium on Logic in computer science
Algebraic operational semantics and Occam

CSL '89 Proceedings of the third workshop on Computer science logic
Branching processes of Petri nets

Acta Informatica
Computation graphs for actor grammars

Journal of Computer and System Sciences
Dynamic Graphs

MFCS '96 Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science
An Event Structure Semantics for Safe Graph Grammars

PROCOMET '94 Proceedings of the IFIP TC2/WG2.1/WG2.2/WG2.3 Working Conference on Programming Concepts, Methods and Calculi
An Event Structure Semantics for Graph Grammars with Parallel Productions

Selected papers from the 5th International Workshop on Graph Gramars and Their Application to Computer Science
Graph-grammars: An algebraic approach

SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
GRAPH PROCESSES

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

A model of processes of transforming graphs is proposed in which concurrency and branching can be represented. Operations on structures representing processes of transforming graphs are defined that allow one to construct such structures from simple components and to characterize sets of processes of transforming graphs, including sets of processes generated by graph grammars.