Graph transformation systems support the formal modeling of dynamic, concurrent, and distributed systems. States are given by their graphical structure, and transitions are modeled by graph transformation rules. In this paper we investigate two kinds of refinement relations for graph transformation systems in order to support the development of a module concept for graph transformation systems. In a spatial refinement each rule is refined by an amalgamation of rules, in a temporal refinement it is refined by a sequence of rules.

Spatial and Temporal Refinement of Graph Transformation Systems

SIMEONI, Marta
1998-01-01

Abstract

Graph transformation systems support the formal modeling of dynamic, concurrent, and distributed systems. States are given by their graphical structure, and transitions are modeled by graph transformation rules. In this paper we investigate two kinds of refinement relations for graph transformation systems in order to support the development of a module concept for graph transformation systems. In a spatial refinement each rule is refined by an amalgamation of rules, in a temporal refinement it is refined by a sequence of rules.
1998
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in ARCA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10278/32907
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 23
  • ???jsp.display-item.citation.isi??? 17
social impact